168 research outputs found

    A Calculus for Generating Ground Explanations

    No full text
    Full Paper: Applications II: Mathematical Structures, Explanation Generation, SecurityInternational audienceWe present a modification of the superposition calculus that is meant to generate explanations why a set of clauses is satisfiable. This process is related to abductive reasoning, and the explanations generated are clauses constructed over so-called abductive constants. We prove the correctness and completeness of the calculus in the presence of redundancy elimination rules, and develop a sufficient condition guaranteeing its termination; this sufficient condition is then used to prove that all possible explanations can be generated in finite time for several classes of clause sets, including many of interest to the SMT community. We propose a procedure that generates a set of explanations that should be useful to a human user and conclude by suggesting several extensions to this novel approach

    Prime Implicate Generation in Equational Logic

    Get PDF
    International audienceA procedure is proposed to efficiently generate sets of ground implicates of first-order formulas with equality. It is based on a tuning of the superposition calculus [Nieuwenhuis and Rubio, 2001], enriched with rules that add new hypotheses on demand during the proof search. Experimental results are presented , showing that the proposed approach is more efficient than state-of-the-art systems

    An Approach to Abductive Reasoning in Equational Logic

    No full text
    http://ijcai.org/papers13/contents.php - Posters: Constraints, Satisfiability, and Search (ijcai13.org)International audienceAbduction has been extensively studied in propositional logic because of its many applications in artificial intelligence. However, its intrinsic complexity has been a limitation to the implementation of abductive reasoning tools in more expressive logics. We have devised such a tool in ground flat equational logic, in which literals are equations or disequations between constants. Our tool is based on the computation of prime implicates. It uses a relaxed paramodulation calculus, designed to generate all prime implicates of a formula, together with a carefully defined data structure storing the implicates and able to efficiently detect, and remove, redundancies. In addition to a detailed description of this method, we present an analysis of some experimental results

    A Generic Framework for Implicate Generation Modulo Theories

    Get PDF
    International audienceThe clausal logical consequences of a formula are called its implicates. The generation of these implicates has several applications, such as the identification of missing hypotheses in a logical specification. We present a procedure that generates the implicates of a quantifier-free formula modulo a theory. No assumption is made on the considered theory, other than the existence of a decision procedure. The algorithm has been implemented (using the solvers MiniSAT, CVC4 and Z3) and experimental results show evidence of the practical relevance of the proposed approach

    Primacy of Quantum Logic in the Natural World

    Get PDF
    This paper presents evidence from the fields of cognitive science and quantum information theory suggesting quantum theory to be the dominant fundamental logic in the natural world, in direct challenge to the long-held assumption that quantum logic only need be considered ‘in the quantum realm.' A summary of the evolution of quantum logic and quantum theory is presented, along with an overview for the necessity of incomplete quantum knowledge, and some representative aspects of quantum logic. A case can be made that classical logic and theory is a subset of quantum logic and theory, given that elements of quantum physics exist that can never admit classical understanding, including: Bell's theorem, Hardy's theorem, and the Pusey-Barrett-Rudolph theorem. Support can be found for the primacy of quantum logic in the natural world in the cognitive sciences, where recent research studies recognize quantum logic in studies of: the subconscious, decisions involving unknown interconnected variables, memory, and question sequencing

    Progress Report : 1991 - 1994

    Get PDF

    Connectionist Inference Models

    Get PDF
    The performance of symbolic inference tasks has long been a challenge to connectionists. In this paper, we present an extended survey of this area. Existing connectionist inference systems are reviewed, with particular reference to how they perform variable binding and rule-based reasoning, and whether they involve distributed or localist representations. The benefits and disadvantages of different representations and systems are outlined, and conclusions drawn regarding the capabilities of connectionist inference systems when compared with symbolic inference systems or when used for cognitive modeling
    • …
    corecore