On solving the equality problem in theories defined by Horn clauses
Theoretical Computer Science
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
Journal of Symbolic Computation
Simplifying conditional term rewriting systems: Unification, termination and confluence
Journal of Symbolic Computation
A completion procedure for conditional equations
1st international workshop on Conditional Term Rewriting Systems
On word problems in Horn theories
1st international workshop on Conditional Term Rewriting Systems
Automatic demonstration: rewriting techniques (French)
Automatic demonstration: rewriting techniques (French)
Satisfiability of systems of ordinal notations with the subterm property is decidable
Proceedings of the 18th international colloquium on Automata, languages and programming
Handbook of theoretical computer science (vol. B)
Unit Refutations and Horn Sets
Journal of the ACM (JACM)
Proving termination with multiset orderings
Communications of the ACM
Completion-Time Optimization of Rewrite-Time Goal Solving
RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
Oldy but Goody Paramodulation Revisited
GWAI '87 Proceedings of the 11th German Workshop on Artificial Intelligence
First-Order Theorem Proving Using Conditional Rewrite Rules
Proceedings of the 9th International Conference on Automated Deduction
Proceedings of the 2nd International CTRS Workshop on Conditional and Typed Rewriting Systems
Completion of First-Order Clauses with Equality by Strict Superposition (Extended Abstract)
Proceedings of the 2nd International CTRS Workshop on Conditional and Typed Rewriting Systems
A Maximal-Literal Unit Strategy for Horn Clauses
Proceedings of the 2nd International CTRS Workshop on Conditional and Typed Rewriting Systems
Knuth-Bendix Completion of Horn Clause Programs for Restricted Linear Resolution and Paramodulation
Proceedings of the 2nd International CTRS Workshop on Conditional and Typed Rewriting Systems
| Hi-index | 0.00 |
Two new theorem-proving procedures for equational Horn clauses are presented. The largest literal is selected for paramodulation in both strategies, except that one method treats positive literals as larger than negative ones and results in a unit strategy. Both use term orderings to restrict paramodulation to potentially maximal sides of equations and to increase the amount of allowable simplification (demodulation). Completeness is shown using proof orderings.