A new method for establishing refutational completeness in theorem proving
Proc. of the 8th international conference on Automated deduction
On word problems in equational theories
14th International Colloquium on Automata, languages and programming
On word problems in horn theories
Journal of Symbolic Computation
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
The Concept of Demodulation in Theorem Proving
Journal of the ACM (JACM)
Unit Refutations and Horn Sets
Journal of the ACM (JACM)
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
On Solving the Equality Problem in Theories Defined by Horn Clauses
EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2
A Confluence Criterion Based on the Generalised Neman Lemma
EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2
A Portable Environment for Research in Automated Reasoning
Proceedings of the 7th International Conference on Automated Deduction
Using forcing to prove completeness of resolution and paramodulation
Journal of Symbolic Computation
On word problems in horn theories
Journal of Symbolic Computation
Observational proofs by rewriting
Theoretical Computer Science
Cancellative abelian monoids and related structures in refutational theorem proving (Part I)
Journal of Symbolic Computation
Cancellative abelian monoids and related structures in refutational theorem proving (part II)
Journal of Symbolic Computation
Uniform Derivation of Decision Procedures by Superposition
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
A rewriting approach to satisfiability procedures
Information and Computation - RTA 2001
Abstract canonical presentations
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
ACM Transactions on Computational Logic (TOCL)
Building extended canonizers by graph-based deduction
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
A taxonomy of theorem-proving strategies
Artificial intelligence today
On theorem proving for program checking: historical perspective and recent developments
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
On Deciding Satisfiability by Theorem Proving with Speculative Inferences
Journal of Automated Reasoning
| Hi-index | 0.00 |
We present a refutationally complete set of inference rules for first-order logic with equality. Except for x = x, no equality axioms are needed. Equalities are oriented by a well-founded ordering and can be used safely for demodulation without losing completeness. When restricted to equational logic, this strategy reduces to a Knuth-Bendix procedure.