Literatura académica sobre el tema "Logical encodings"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Logical encodings".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Logical encodings"
Kovács, Tibor, Gábor Simon y Gergely Mezei. "Benchmarking Graph Database Backends—What Works Well with Wikidata?" Acta Cybernetica 24, n.º 1 (21 de mayo de 2019): 43–60. http://dx.doi.org/10.14232/actacyb.24.1.2019.5.
Texto completoYoder, Theodore J. y Isaac H. Kim. "The surface code with a twist". Quantum 1 (25 de abril de 2017): 2. http://dx.doi.org/10.22331/q-2017-04-25-2.
Texto completoSteiner, Erich. "Ideational grammatical metaphor". Languages in Contrast 4, n.º 1 (14 de abril de 2004): 137–64. http://dx.doi.org/10.1075/lic.4.1.07ste.
Texto completoPal, Amit Kumar, Philipp Schindler, Alexander Erhard, Ángel Rivas, Miguel-Angel Martin-Delgado, Rainer Blatt, Thomas Monz y Markus Müller. "Relaxation times do not capture logical qubit dynamics". Quantum 6 (24 de enero de 2022): 632. http://dx.doi.org/10.22331/q-2022-01-24-632.
Texto completoScala, Enrico, Miquel Ramírez, Patrik Haslum y Sylvie Thiebaux. "Numeric Planning with Disjunctive Global Constraints via SMT". Proceedings of the International Conference on Automated Planning and Scheduling 26 (30 de marzo de 2016): 276–84. http://dx.doi.org/10.1609/icaps.v26i1.13766.
Texto completoCAVE, ANDREW y BRIGITTE PIENTKA. "Mechanizing proofs with logical relations – Kripke-style". Mathematical Structures in Computer Science 28, n.º 9 (2 de agosto de 2018): 1606–38. http://dx.doi.org/10.1017/s0960129518000154.
Texto completoDennis, Louise A., Martin Mose Bentzen, Felix Lindner y Michael Fisher. "Verifiable Machine Ethics in Changing Contexts". Proceedings of the AAAI Conference on Artificial Intelligence 35, n.º 13 (18 de mayo de 2021): 11470–78. http://dx.doi.org/10.1609/aaai.v35i13.17366.
Texto completoRABE, FLORIAN. "A logical framework combining model and proof theory". Mathematical Structures in Computer Science 23, n.º 5 (1 de marzo de 2013): 945–1001. http://dx.doi.org/10.1017/s0960129512000424.
Texto completoLocher, David F., Lorenzo Cardarelli y Markus Müller. "Quantum Error Correction with Quantum Autoencoders". Quantum 7 (9 de marzo de 2023): 942. http://dx.doi.org/10.22331/q-2023-03-09-942.
Texto completoHardie, Andrew. "From legacy encodings to Unicode: the graphical and logical principles in the scripts of South Asia". Language Resources and Evaluation 41, n.º 1 (4 de abril de 2007): 1–25. http://dx.doi.org/10.1007/s10579-006-9003-7.
Texto completoTesis sobre el tema "Logical encodings"
Dubois, De Prisque Louise. "Prétraitement compositionnel en Coq". Electronic Thesis or Diss., université Paris-Saclay, 2024. https://theses.hal.science/tel-04696909.
Texto completoThis 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.
Texto completoMalik, 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.
Texto completoHamdaoui, Yann. "Concurrency, references and linear logic". Thesis, Sorbonne Paris Cité, 2018. http://www.theses.fr/2018USPCC190/document.
Texto completoThe 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.
Texto completoJohnson, 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.
Texto completoYuan, 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.
Texto completoMaster of Science
Mailly, Jean-Guy. "Dynamics of argumentation frameworks". Thesis, Artois, 2015. http://www.theses.fr/2015ARTO0402/document.
Texto completoThis 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.
Texto completoSastrawan, 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.
Texto completoCapítulos de libros sobre el tema "Logical encodings"
Smoryński, Craig. "Arithmetic Encoding". En Logical Number Theory I, 1–139. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-75462-3_1.
Texto completoSmoryński, Craig. "Diophantine Encoding". En Logical Number Theory I, 140–265. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-75462-3_2.
Texto completoEisenhofer, Clemens, Ruba Alassaf, Michael Rawson y Laura Kovács. "Non-Classical Logics in Satisfiability Modulo Theories". En Lecture Notes in Computer Science, 24–36. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-43513-3_2.
Texto completoSeiffertt, John. "Encoding Code". En Digital Logic for Computing, 135–48. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-56839-3_10.
Texto completoSasao, Tsutomu. "Encoding Method". En 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.
Texto completoHeuer, Jan y Christoph Wernhard. "Synthesizing Strongly Equivalent Logic Programs: Beth Definability for Answer Set Programs via Craig Interpolation in First-Order Logic". En Automated Reasoning, 172–93. Cham: Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-63498-7_11.
Texto completoPompe, Uroš. "Efficient proof encoding". En Inductive Logic Programming, 299–314. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-63494-0_62.
Texto completoSchürmann, Carsten. "Recursion for Higher-Order Encodings". En Computer Science Logic, 585–99. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44802-0_41.
Texto completoCortadella, J., M. Kishinevsky, A. Kondratyev, L. Lavagno y A. Yakovlev. "State Encoding". En 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.
Texto completoSaeedloei, Neda. "A Logical Encoding of Timed $$\pi $$ -Calculus". En 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.
Texto completoActas de conferencias sobre el tema "Logical encodings"
Bienvenu, Meghyn y Camille Bourgaux. "Querying Inconsistent Prioritized Data with ORBITS: Algorithms, Implementation, and Experiments". En 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.
Texto completoRoux, Johannes D. y F. Wilhelm Leuschner. "Polarization-based optical computing using liquid crystals." En Optical Computing. Washington, D.C.: Optica Publishing Group, 1989. http://dx.doi.org/10.1364/optcomp.1989.tui13.
Texto completoFeyzbakhsh Rankooh, Masood y Tomi Janhunen. "Capturing (Optimal) Relaxed Plans with Stable and Supported Models of Logic Programs (Extended Abstract)". En 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.
Texto completode Haan, Ronald y Marija Slavkovik. "Answer Set Programming for Judgment Aggregation". En 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.
Texto completoWagner, Kelvin, Robert T. Weverka y Demetri Psaltis. "Global Communication, Accuracy and Optical Threshold Device Tolerances in Digital Optical Matrix Multipliers". En Optical Bistability. Washington, D.C.: Optica Publishing Group, 1985. http://dx.doi.org/10.1364/obi.1985.ma5.
Texto completoJi, Zhang, Liu Weiwei, Zhong Licheng y Gou Yili. "Optical Space-variant Logic-gate Using a New Hybrid BSO Spatial Light Modulator". En Optical Computing. Washington, D.C.: Optica Publishing Group, 1989. http://dx.doi.org/10.1364/optcomp.1989.mg3.
Texto completoWan, Lingxiao, Hui Zhang, Huihui Zhu, Leong Chuan Kwek y Ai-Qun Liu. "Quantum Computing Chip with Error-Correction Encoding". En CLEO: QELS_Fundamental Science. Washington, D.C.: Optica Publishing Group, 2022. http://dx.doi.org/10.1364/cleo_qels.2022.ff2i.5.
Texto completoThomae, D. A. y D. E. Van den Bout. "Encoding logical constraints into neural network cost functions". En 1990 IJCNN International Joint Conference on Neural Networks. IEEE, 1990. http://dx.doi.org/10.1109/ijcnn.1990.137943.
Texto completoClaudette, Cayrol y Lagasquie-Schiex Marie-Christine. "Logical Encoding of Argumentation Frameworks with Higher-Order Attacks". En 2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI). IEEE, 2018. http://dx.doi.org/10.1109/ictai.2018.00106.
Texto completoBednarczyk, Bartosz y Sebastian Rudolph. "Worst-Case Optimal Querying of Very Expressive Description Logics with Path Expressions and Succinct Counting". En 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.
Texto completoInformes sobre el tema "Logical encodings"
Baader, Franz y Barbara Morawska. SAT Encoding of Unification in EL. Technische Universität Dresden, 2010. http://dx.doi.org/10.25368/2022.177.
Texto completoBaader, Franz, Stefan Borgwardt y 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.
Texto completoRuff, Grigory y Tatyana Sidorina. THE DEVELOPMENT MODEL OF ENGINEERING CREATIVITY IN STUDENTS OF MILITARY INSTITUTIONS. Science and Innovation Center Publishing House, diciembre de 2020. http://dx.doi.org/10.12731/model_of_engineering_creativity.
Texto completo