Journal ArticleDOI
Optimizing the clausal normal form transformation
Reads0
Chats0
TLDR
This paper presents an algorithm that is based on the generation of paths through a matrix and produces the set of prime implicants of the original formula.Abstract:
Resolution based theorem proving systems require the conversion of predicate logic formulae into clausal normal form. The multiplication from disjunctive into conjunctive forms in general produces a lot of tautologous and subsumed clauses, which is relatively hard to recognize in later stages of the proof. In this paper an algorithm is presented that avoids the generation of redundant clauses. It is based on the generation of paths through a matrix and produces the set of prime implicants of the original formula.read more
Citations
More filters
Logic in Computer Science.
TL;DR: The logic in computer science is one of the literary work in this world in suitable to be reading material and this book gives reference, but also it will show the amazing benefits of reading a book.
Book ChapterDOI
Consequence Finding Algorithms
TL;DR: In this section, the notion of consequence finding is introduced and motivated in informal terms and the scope of the chapter and its organization are successively pointed out.
Journal ArticleDOI
Geometric Constraint Solving in Parametric Computer-Aided Design
Proceedings Article
Compilation for critically constrained knowledge bases
TL;DR: An aggressive hybrid approach is developed which attempts to compile a KB exactly until a given resource limit is reached, then falls back to approximate compilation into unit clauses, with average savings of an order of magnitude over the brute-force approach.
Patent
Prime implicates and query optimization in relational databases
TL;DR: In this paper, an improved normalization methodology for SQL queries is described, which enables better optimization of the original query without the system overhead that would result from full normalization of the query.
References
More filters
Book
Elements of the Theory of Computation
TL;DR: Algorithms, complexity analysis, and algorithmic ideas are introduced informally in Chapter 1, and are pursued throughout the book, each section is followed by problems.
Journal ArticleDOI
The Problem of Simplifying Truth Functions
TL;DR: The Problem of Simplifying Truth Functions is concerned with the problem of reducing the number of operations on a graph to a simple number.
Book
Automated Theorem Proving
TL;DR: A comparison study of the connection method in propositional logic and its applications in first-order logic and in natural and formal logic.
Journal ArticleDOI
Theorem Proving via General Matings
TL;DR: It is shown that one may restrict quantifier duphcat, on to outermost quanUfiers without loss of completeness, though with possible loss of efficmncy.
Logic in Computer Science.
TL;DR: The logic in computer science is one of the literary work in this world in suitable to be reading material and this book gives reference, but also it will show the amazing benefits of reading a book.