Journal ArticleDOI
Prime implicants of first order formulas via transversal clauses
Manoj K. Raut,Arindama Singh +1 more
TLDR
The method of transversal clauses used earlier for computing prime implicants of a propositional formula in conjuctive normal form is adopted to the first order case via substitutions, and partial correctness of the algorithm is proved.Abstract:
Knowledge compilation techniques are usually applied for propositional knowledge bases. In this article, an extension of the notion of prime implicants of a knowledge base using first order formulas in Skolem conjunctive normal form is suggested. The method of transversal clauses used earlier for computing prime implicants of a propositional formula in conjuctive normal form is adopted to the first order case via substitutions. Partial correctness of the algorithm is proved. The algorithm is adopted heuristically for computing approximate prime implicants.read more
Citations
More filters
Proceedings ArticleDOI
Process SEER: A Tool for Semantic Effect Annotation of Business Process Models
TL;DR: The conceptual underpinnings, design, implementation and evaluation of the ProcessSEER tool is described that supports several strategies for obtaining semantic effect descriptions of BPMN process models, without imposing an overly onerous burden of using formal specification on the analyst.
Journal ArticleDOI
Prime implicate generation in equational logic
TL;DR: An algorithm for the generation of prime implicates in equational logic, of the most general consequences of formulae containing equations and disequations between first-order terms, is presented, defined by a calculus that is proved to be correct and complete.
Dissertation
Abduction in first order logic with equality
TL;DR: An experimental evaluation of the different prime implicate generation methods based on research prototypes written in Ocaml is conducted including a comparison with state-of-the-art prime implicates generation tools to identify the most efficient variants of the proposed algorithms.
Proceedings ArticleDOI
High dimension CNF to DNF conversion using grid computing in parallel
TL;DR: CNF to DNF Conversion is considered as vast area of research by scientists for PLA's, circuit designs, FPGA's, artificial intelligence, etc and must be considered to evaluate best performance for higher variable processing on high end systems.
References
More filters
Proceedings ArticleDOI
Implicit and incremental computation of primes and essential primes of Boolean functions
TL;DR: The authors show that implicit set manipulation techniques can also be used with success to compute and manipulate implicitly large sets of prime and of essential prime implicants of incompletely specified Boolean functions.
Book ChapterDOI
Tractable databases: how to make propositional unit resolution complete through compilation
TL;DR: The equivalence of unit-refutability with two restrictions of resolution is proved, and a new sufficient condition for unit refutation completeness is provided, thus identifying a new class of tractable theories, one which is of interest to abduction problems as well.
Proceedings Article
Knowledge compilation using theory prime implicates
TL;DR: A new approach to equivalence-preserving knowledge compilation based on a generalization of the standard notion of prime implicate, the theory prime implicates is proposed, which consists in taking advantage of tractable theories implied by the knowledge base Σ to make Σ local by computing the theoryprime implicates of Φ.
Journal ArticleDOI
Simplest Normal Truth Functions
TL;DR: This paper develops a method for both disjunctive and conjunctive normal truth functions which is in some respects similar to Quine's but which does not involve prior expansion of a formula into developed normal form.
Journal ArticleDOI
On strongest neccessary and weakest sufficient conditions
TL;DR: In this paper, a notion of strongest necessary and weakest sufficient conditions for propositional theory T and a proposition q is proposed, which can be naturally extended to arbitrary formulas and discuss some of their potential applications.