Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 28 for “"Propositional logic"”.
-
Algebraic aspects of propositional logic
… the connection between abstract algebra and propositional logic. We start by considering the category Bool of Boolean algebras, the algebraic counterpart of classical propositional logic. We provide an algebraic definition of theories and models of classical logic and provide algebraic …
-
Generalized Satisfiability Problems
… problem is the satisfiability problem of propositional formulas (SAT). Here we get a propositional formula as an input and it must be decided whether an assignment for the propositional variables exists, such that this assignment satisfies the given formula. The intensive study of NP led …
-
ENHANCING DEEP LEARNING WITH SYMBOLIC DOMAIN KNOWLEDGE
… symbolic domain knowledge. We propose logic graph embedding frameworks, Logic Embedding Network with Semantic Regularization (LENSR) and Temporal-Logic Embedded Automata Framework (T-LEAF), which take propositional logic and linear temporal logic as inputs, respectively. Secondly, …
-
Power constructs and propositional systems
Propositional systems are deductively closed sets of sentences phrased in the language of some propositional logic. The set of systems of a given logic is turned into an algebra by endowing it with a number of operations, and into a relational structure by endowing it with a number of relations. …
-
TRACTABLE DEPTH-BOUNDED APPROXIMATIONS TO SOME PROPOSITIONAL LOGICS. TOWARDS MORE REALISTIC MODELS OF LOGICAL AGENTS.
… of reasoners. Recognizing that most useful logics are idealizations in that they are either undecidable or likely to be intractable, the approach accounts for how they can be approximated in practice by resource-bounded agents. The approach has been applied to Classical Propositional Logic …
-
A new algorithm for the quantified satisfiability problem, based on zero-suppressed binary decision diagrams and memoization
… in theoretical computer science. QBF extends propositional logic in such a way that many advanced forms of reasoning can be easily formulated and evaluated. In this dissertation we present our ZQSAT, which is an algorithm for evaluating quantified Boolean formulas. ZQSAT is based on ZBDD: …
-
Formulas of first-order logic in distributive normal form
… Jaakko Hintikka that every formula of first-order logic can be written as a disjunction of formulas called constituents. Such a disjunction is called a distributive normal form of the formula. It is a generalization of the disjunctive normal form for propositional logic. However, there are some …
-
Algebraic and Logic Solving Methods for Cryptanalysis
… of polynomial systems and satisfiability of propositional logic formulas are not two completely separate research areas, as it may appear at first sight. In fact, many problems coming from cryptanalysis, such as algebraic fault attacks, can be rephrased as solving a set of Boolean polynomials …
-
Hybrid solvers for the Boolean Satisfiability problem: an exploration
… problem. A SAT problem instance is a formula in propositional logic. A SAT solver attempts to find a solution for the formula. Our research focuses on a newer solver paradigm, hybrid solvers, where two solvers are combined in order to gain the benefits from both solvers in the search for a …
-
Modal and Relevance Logics for Qualitative Spatial Reasoning
… mereology. (b) the second aspect focuses on topological nature, i.e., whether they are in ”contact” without having a common part. Mereotopology is a mathematical theory that covers these two aspects. The theoretical aspect of this thesis is to use classical propositional logic with non-classical …
-
Inference and Task Planning over Spatially Complex Problems
… To achieve this goal, we introduce a propositional logic framework to encode spatial relationships between objects and an inference scheme to identify important relationships between defined object classes. Finally, we present a search-based algorithm to synthesize required class …
-
Qualitative Spatial Reasoning With Super-Intuitionistic Logics
… mereotopology, encodings based on non-classical logics are some of the possible answers that have emerged in connection with this problem. The present analysis is based on the well-known topological semantics of intuitionistic logic. That semantics is considered here from the point of view of the …
-
Decolonizing visualities: changing cultural paradigms, freeing ourselves from Western-centric epistemes.
… It seems to me, that the dominant methodological frameworks as I know them now, tacitly follow this scientific, quantitative, material, mechanical, positivist paradigm that draws from Western philosophical development and positions, pervasively held as the only basis for knowledge …
-
Defeasible justification for the KLM Framework
… (AI) as they allow AI systems to conduct logical reasoning. Most classical logics, such as Propositional Logic (PL), are monotonic, which means that adding new knowledge to a knowledge base cannot cause the retraction of a previously drawn conclusion. These classical logics cannot easily …
-
Enriching deontic logic with typicality
… the legal rules to be enforced within it. Formal logic has long been used for reasoning tasks in many domains. Deontic logic is a logic which is often used to formalise legal scenarios with its built-in notions of obligation, permission and prohibition. Within the legal domain, it is important to …
-
Complexity and Partitions
… such as Graph Embedding or Entailment (for propositional logic), this thesis systematically develops tools, in shape of the boolean hierarchy of NP-partitions and its refinements, for the qualitative analysis of the complexity of partitions generated by NP-relations. The Boolean hierarchy of …
-
Efficient Automated Planning with New Formulations
… by STRIPS formulation, a simple model based on propositional logic. In the recently introduced SAS+ formulation, the multi-valued variables naturally depict certain invariants that are missed in STRIPS, make SAS+ have many favorable features. Because of its rich structural information SAS+ …
-
Verificación formal en acl2 de polinomios de múltiples variables y su aplicación al problema de la decisión en la lógica proposicional clásica
… the framework provided by the ACL2 computational logic. Since ACL2 integrates a pure functional programming language and an automated reasoning system, these libraries can be used for both computation and formal reasoning on polynomial objects. The development of different variants of these …
-
An overview of KLM-style defeasible entailment
The usage of formal logic to solve problems in artificial intelligence has a long history in the field. Information is represented in a formal language, which facilitates algorithmic reasoning about some domain knowledge. Traditionally, the algorithms used for the reasoning services are monotonic, …
Page 1 of 2