Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
Journal of the ACM (JACM)
The Unit Proof and the Input Proof in Theorem Proving
Journal of the ACM (JACM)
Completeness of Linear Refutation for Theories with Equality
Journal of the ACM (JACM)
Equality-based binary resolution
Journal of the ACM (JACM)
Theorem-proving with resolution and superposition
Journal of Symbolic Computation
Journal of the ACM (JACM)
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra
Journal of the ACM (JACM)
Knowledge compilation and theory approximation
Journal of the ACM (JACM)
Algorithms for propositional KB approximation
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Journal of the ACM (JACM)
Renaming a Set of Clauses as a Horn Set
Journal of the ACM (JACM)
Another Generalization of Resolution
Journal of the ACM (JACM)
Equality and Domain Closure in First-Order Databases
Journal of the ACM (JACM)
On the family of generalized dependency constraints
Journal of the ACM (JACM)
A theorem-proving language for experimentation
Communications of the ACM
Propositional lower bounds: Algorithms and complexity
Annals of Mathematics and Artificial Intelligence
The phase transition in random horn satisfiability and its algorithmic implications
Random Structures & Algorithms
Spatial Reasoning with Topological Information
Spatial Cognition, An Interdisciplinary Approach to Representing and Processing Spatial Knowledge
Finding Tractable Formulas in NNF
CL '00 Proceedings of the First International Conference on Computational Logic
Horn clauses and functional dependencies in complex-value databases
ADC '06 Proceedings of the 17th Australasian Database Conference - Volume 49
Semantic Resolution for Horn Sets
IEEE Transactions on Computers
Methods for Automated Theorem Proving in Nonclassical Logics
IEEE Transactions on Computers
What Is a Real-World SAT Instance?
Proceedings of the 2007 conference on Artificial Intelligence Research and Development
Combining a Logical and a Numerical Method for Data Reconciliation
Journal on Data Semantics XII
Measuring the hardness of SAT instances
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
On finding a solution in temporal constraint satisfaction problems
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Automatic synthesis of numerical computer programs
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 2
Semantic paramodulation for Horn sets
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
Semantic resolution for horn sets
IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
Ordering-based strategies for horn clauses
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Functional dependencies in a relational database and propositional logic
IBM Journal of Research and Development
Qualitative spatial reasoning with topological information
Qualitative spatial reasoning with topological information
Generalized conflict-clause strengthening for satisfiability solvers
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Generalising Unit-Refutation Completeness and SLUR via Nested Input Resolution
Journal of Automated Reasoning
Hi-index | 0.03 |
The key concepts for this automated theorem-proving paper are those of Horn set and strictly-unit refutation. A Horn set is a set of clauses such that none of its members contains more than one positive literal. A strictly-unit refutation is a proof by contradiction in which no step is justified by applying a rule of inference to a set of clauses all of which contain more than one literal. Horn sets occur in many fields of mathematics such as the theory of groups, rings, Moufang loops, and Henkin models. The usual translation into first-order predicate calculus of the axioms of these and many other fields yields a set of Horn clauses. The striking feature of the Horn property for finite sets of clauses is that its presence or absence can be determined by inspection. Thus, the determination of the applicability of the theorems and procedures of this paper is immediate.In Theorem 1 it is proved that, if S is an unsatisfiable Horn set, there exists a strictly-unit refutation of S employing binary resolution alone, thus eliminating the need for factoring; moreover, one of the immediate ancestors of each step of the refutation is in fact a positive unit clause. A theorem similar to Theorem 1 for paramodulation-based inference systems is proven in Theorem 3 but with the inclusion of factoring as an inference rule. In Section 3 two reduction procedures are discussed. For the first, Chang's splitting, a rule is provided to guide both the choice of clauses and the way in which to split. The second reduction procedure enables one to refute a Horn set by refuting but one of a corresponding family of simpler subproblems.