Auswahl der wissenschaftlichen Literatur zum Thema „Logical encodings“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Inhaltsverzeichnis
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Logical encodings" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "Logical encodings"
Kovács, Tibor, Gábor Simon und Gergely Mezei. „Benchmarking Graph Database Backends—What Works Well with Wikidata?“ Acta Cybernetica 24, Nr. 1 (21.05.2019): 43–60. http://dx.doi.org/10.14232/actacyb.24.1.2019.5.
Der volle Inhalt der QuelleYoder, Theodore J., und Isaac H. Kim. „The surface code with a twist“. Quantum 1 (25.04.2017): 2. http://dx.doi.org/10.22331/q-2017-04-25-2.
Der volle Inhalt der QuelleSteiner, Erich. „Ideational grammatical metaphor“. Languages in Contrast 4, Nr. 1 (14.04.2004): 137–64. http://dx.doi.org/10.1075/lic.4.1.07ste.
Der volle Inhalt der QuellePal, Amit Kumar, Philipp Schindler, Alexander Erhard, Ángel Rivas, Miguel-Angel Martin-Delgado, Rainer Blatt, Thomas Monz und Markus Müller. „Relaxation times do not capture logical qubit dynamics“. Quantum 6 (24.01.2022): 632. http://dx.doi.org/10.22331/q-2022-01-24-632.
Der volle Inhalt der QuelleScala, Enrico, Miquel Ramírez, Patrik Haslum und Sylvie Thiebaux. „Numeric Planning with Disjunctive Global Constraints via SMT“. Proceedings of the International Conference on Automated Planning and Scheduling 26 (30.03.2016): 276–84. http://dx.doi.org/10.1609/icaps.v26i1.13766.
Der volle Inhalt der QuelleCAVE, ANDREW, und BRIGITTE PIENTKA. „Mechanizing proofs with logical relations – Kripke-style“. Mathematical Structures in Computer Science 28, Nr. 9 (02.08.2018): 1606–38. http://dx.doi.org/10.1017/s0960129518000154.
Der volle Inhalt der QuelleDennis, Louise A., Martin Mose Bentzen, Felix Lindner und Michael Fisher. „Verifiable Machine Ethics in Changing Contexts“. Proceedings of the AAAI Conference on Artificial Intelligence 35, Nr. 13 (18.05.2021): 11470–78. http://dx.doi.org/10.1609/aaai.v35i13.17366.
Der volle Inhalt der QuelleRABE, FLORIAN. „A logical framework combining model and proof theory“. Mathematical Structures in Computer Science 23, Nr. 5 (01.03.2013): 945–1001. http://dx.doi.org/10.1017/s0960129512000424.
Der volle Inhalt der QuelleLocher, David F., Lorenzo Cardarelli und Markus Müller. „Quantum Error Correction with Quantum Autoencoders“. Quantum 7 (09.03.2023): 942. http://dx.doi.org/10.22331/q-2023-03-09-942.
Der volle Inhalt der QuelleHardie, Andrew. „From legacy encodings to Unicode: the graphical and logical principles in the scripts of South Asia“. Language Resources and Evaluation 41, Nr. 1 (04.04.2007): 1–25. http://dx.doi.org/10.1007/s10579-006-9003-7.
Der volle Inhalt der QuelleDissertationen zum Thema "Logical encodings"
Dubois, De Prisque Louise. „Prétraitement compositionnel en Coq“. Electronic Thesis or Diss., université Paris-Saclay, 2024. http://www.theses.fr/2024UPASG040.
Der volle Inhalt der QuelleThis thesis presents a preprocessing methodology aimed at transforming certain statements from the Coq proof assistant's logic into first-order logic statements, in order to send them to automatic provers, in particular SMT solvers. This methodology involves composing small, independent, and certifying transformations, taking the form of Coq tactics. An implementation of this methodology is provided in a plugin called Sniper, which offers a "push-button" automation tactic. Furthermore, a logical transformation scheduler (called Orchestrator) allows adding one's own logical transformations and determines which transformations apply depending on the proof to be carried out
Sheridan, Daniel. „Temporal logic encodings for SAT-based bounded model checking“. Thesis, University of Edinburgh, 2006. http://hdl.handle.net/1842/1467.
Der volle Inhalt der QuelleMalik, Usama Computer Science & Engineering Faculty of Engineering UNSW. „Configuration encoding techniques for fast FPGA reconfiguration“. Awarded by:University of New South Wales. School of Computer Science and Engineering, 2006. http://handle.unsw.edu.au/1959.4/26212.
Der volle Inhalt der QuelleHamdaoui, Yann. „Concurrency, references and linear logic“. Thesis, Sorbonne Paris Cité, 2018. http://www.theses.fr/2018USPCC190/document.
Der volle Inhalt der QuelleThe topic of this thesis is the study of the encoding of references andconcurrency in Linear Logic. Our perspective is to demonstrate the capabilityof Linear Logic to encode side-effects to make it a viable, formalized and wellstudied compilation target for functional languages in the future. The keynotion we develop is that of routing areas: a family of proof nets whichcorrespond to a fragment of differential linear logic and which implementscommunication primitives. We develop routing areas as a parametrizable deviceand study their theory. We then illustrate their expressivity by translating aconcurrent λ-calculus featuring concurrency, references and replication to afragment of differential nets. To this purpose, we introduce a language akin toAmadio’s concurrent λ-calculus, but with explicit substitutions for bothvariables and references. We endow this language with a type and effect systemand we prove termination of well-typed terms by a mix of reducibility and anew interactive technique. This intermediate language allows us to prove asimulation and an adequacy theorem for the translation
Karmarkar, Kedar Madhav. „SCALABLE BUS ENCODING FOR ERROR-RESILIENT HIGH-SPEED ON-CHIP COMMUNICATION“. OpenSIUC, 2013. https://opensiuc.lib.siu.edu/dissertations/720.
Der volle Inhalt der QuelleJohnson, Justin Scott Escobar Martha Cecilia. „Initially held hypothesis does not affect encoding of event frequencies in contingency based causal judgment“. Auburn, Ala., 2009. http://hdl.handle.net/10415/1948.
Der volle Inhalt der QuelleYuan, Zeying. „Sequential Equivalence Checking of Circuits with Different State Encodings by Pruning Simulation-based Multi-Node Invariants“. Thesis, Virginia Tech, 2015. http://hdl.handle.net/10919/56693.
Der volle Inhalt der QuelleMaster of Science
Mailly, Jean-Guy. „Dynamics of argumentation frameworks“. Thesis, Artois, 2015. http://www.theses.fr/2015ARTO0402/document.
Der volle Inhalt der QuelleThis thesis tackles the problem of integrating a new piece of information in an abstract argumentation framework. Such a framework is a directed graph such that its nodes represent the arguments, and the directed edges represent the attacks between arguments. There are different ways to decide which arguments are accepted by the agent who uses such a framework to represent her beliefs.An agent may be confronted with a piece of information such that "this argument should be accepted", which is in contradiction with her current beliefs, represented by her argumentation framework.In this thesis, we have studied several approaches to incorporate a piece of information in an argumentation framework.Our first contribution is an adaptation of the AGM framework for belief revision, which has been developed for characterizing the incorporation of a new piece of information when the agent's beliefs are represented in a logical setting. We have adapted the rationality postulates from the AGM framework to characterize the revision operators suited to argumentation frameworks, and we have identified several ways to generate the argumentation frameworks resulting from the revision.We have also shown how to use AGM revision as a tool for revising argumentation frameworks. Our approach uses a logical encoding of the argumentation framework to take advantage of the classical revision operators, for deriving the expected result.At last, we have studied the problem of enforcing a set of arguments (how to change an argumentation framework so that a given set of arguments becomes an extension). We have developed a new family of operators which guarantee the success of the enforcement process, contrary to the existing approaches, and we have shown that a translation of our approaches into satisfaction and optimization problems makes possible to develop efficient tools for computing the result of the enforcement
Abrahamsson, Olle. „A Gröbner basis algorithm for fast encoding of Reed-Müller codes“. Thesis, Linköpings universitet, Matematik och tillämpad matematik, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-132429.
Der volle Inhalt der QuelleSastrawan, Dewa Ayu Dwi Damaiyanti. „The Instagram News Logic : The Encoding and Decoding of News Credibility on Instagram in the COVID-19 Infodemic in Indonesia“. Thesis, Uppsala universitet, Medier och kommunikation, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-446746.
Der volle Inhalt der QuelleBuchteile zum Thema "Logical encodings"
Smoryński, Craig. „Arithmetic Encoding“. In Logical Number Theory I, 1–139. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-75462-3_1.
Der volle Inhalt der QuelleSmoryński, Craig. „Diophantine Encoding“. In Logical Number Theory I, 140–265. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-75462-3_2.
Der volle Inhalt der QuelleEisenhofer, Clemens, Ruba Alassaf, Michael Rawson und Laura Kovács. „Non-Classical Logics in Satisfiability Modulo Theories“. In Lecture Notes in Computer Science, 24–36. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-43513-3_2.
Der volle Inhalt der QuelleSeiffertt, John. „Encoding Code“. In Digital Logic for Computing, 135–48. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-56839-3_10.
Der volle Inhalt der QuelleSasao, Tsutomu. „Encoding Method“. In Memory-Based Logic Synthesis, 41–54. New York, NY: Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4419-8104-2_6.
Der volle Inhalt der QuelleHeuer, Jan, und Christoph Wernhard. „Synthesizing Strongly Equivalent Logic Programs: Beth Definability for Answer Set Programs via Craig Interpolation in First-Order Logic“. In Automated Reasoning, 172–93. Cham: Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-63498-7_11.
Der volle Inhalt der QuellePompe, Uroš. „Efficient proof encoding“. In Inductive Logic Programming, 299–314. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-63494-0_62.
Der volle Inhalt der QuelleSchürmann, Carsten. „Recursion for Higher-Order Encodings“. In Computer Science Logic, 585–99. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44802-0_41.
Der volle Inhalt der QuelleCortadella, J., M. Kishinevsky, A. Kondratyev, L. Lavagno und A. Yakovlev. „State Encoding“. In Logic Synthesis for Asynchronous Controllers and Interfaces, 87–123. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/978-3-642-55989-1_5.
Der volle Inhalt der QuelleSaeedloei, Neda. „A Logical Encoding of Timed $$\pi $$ -Calculus“. In Logic-Based Program Synthesis and Transformation, 164–82. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-14125-1_10.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "Logical encodings"
Bienvenu, Meghyn, und Camille Bourgaux. „Querying Inconsistent Prioritized Data with ORBITS: Algorithms, Implementation, and Experiments“. In 19th International Conference on Principles of Knowledge Representation and Reasoning {KR-2022}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/kr.2022/54.
Der volle Inhalt der QuelleRoux, Johannes D., und F. Wilhelm Leuschner. „Polarization-based optical computing using liquid crystals.“ In Optical Computing. Washington, D.C.: Optica Publishing Group, 1989. http://dx.doi.org/10.1364/optcomp.1989.tui13.
Der volle Inhalt der QuelleFeyzbakhsh Rankooh, Masood, und Tomi Janhunen. „Capturing (Optimal) Relaxed Plans with Stable and Supported Models of Logic Programs (Extended Abstract)“. In Thirty-Third International Joint Conference on Artificial Intelligence {IJCAI-24}. California: International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/ijcai.2024/930.
Der volle Inhalt der Quellede Haan, Ronald, und Marija Slavkovik. „Answer Set Programming for Judgment Aggregation“. In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/231.
Der volle Inhalt der QuelleWagner, Kelvin, Robert T. Weverka und Demetri Psaltis. „Global Communication, Accuracy and Optical Threshold Device Tolerances in Digital Optical Matrix Multipliers“. In Optical Bistability. Washington, D.C.: Optica Publishing Group, 1985. http://dx.doi.org/10.1364/obi.1985.ma5.
Der volle Inhalt der QuelleJi, Zhang, Liu Weiwei, Zhong Licheng und Gou Yili. „Optical Space-variant Logic-gate Using a New Hybrid BSO Spatial Light Modulator“. In Optical Computing. Washington, D.C.: Optica Publishing Group, 1989. http://dx.doi.org/10.1364/optcomp.1989.mg3.
Der volle Inhalt der QuelleWan, Lingxiao, Hui Zhang, Huihui Zhu, Leong Chuan Kwek und Ai-Qun Liu. „Quantum Computing Chip with Error-Correction Encoding“. In CLEO: QELS_Fundamental Science. Washington, D.C.: Optica Publishing Group, 2022. http://dx.doi.org/10.1364/cleo_qels.2022.ff2i.5.
Der volle Inhalt der QuelleThomae, D. A., und D. E. Van den Bout. „Encoding logical constraints into neural network cost functions“. In 1990 IJCNN International Joint Conference on Neural Networks. IEEE, 1990. http://dx.doi.org/10.1109/ijcnn.1990.137943.
Der volle Inhalt der QuelleClaudette, Cayrol, und Lagasquie-Schiex Marie-Christine. „Logical Encoding of Argumentation Frameworks with Higher-Order Attacks“. In 2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI). IEEE, 2018. http://dx.doi.org/10.1109/ictai.2018.00106.
Der volle Inhalt der QuelleBednarczyk, Bartosz, und Sebastian Rudolph. „Worst-Case Optimal Querying of Very Expressive Description Logics with Path Expressions and Succinct Counting“. In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/212.
Der volle Inhalt der QuelleBerichte der Organisationen zum Thema "Logical encodings"
Baader, Franz, und Barbara Morawska. SAT Encoding of Unification in EL. Technische Universität Dresden, 2010. http://dx.doi.org/10.25368/2022.177.
Der volle Inhalt der QuelleBaader, Franz, Stefan Borgwardt und Barbara Morawska. SAT Encoding of Unification in ELHR+ w.r.t. Cycle-Restricted Ontologies. Technische Universität Dresden, 2012. http://dx.doi.org/10.25368/2022.186.
Der volle Inhalt der QuelleRuff, Grigory, und Tatyana Sidorina. THE DEVELOPMENT MODEL OF ENGINEERING CREATIVITY IN STUDENTS OF MILITARY INSTITUTIONS. Science and Innovation Center Publishing House, Dezember 2020. http://dx.doi.org/10.12731/model_of_engineering_creativity.
Der volle Inhalt der Quelle