Refutational Theorem Proving Using Term-Rewriting Systems

Abstract In this paper we propose a new approach to theorem proving in first-order logic based on the term-rewriting method. First for propositional calculus, we introduce a canonical term-rewriting system for Boolean algebra. This system enables us to transform the first-order predicate calculus into a form of equational logic, and to develop several complete strategies (both clausal and nonclausal) for first-order theories based on the Knuth-Bendix Completion Procedure. More importantly, our strategies can deal with predicate logic and built-in (equational) theories in a uniform and effective way. We also describe an implementation and comparisons with some other first-order theorem-proving methods.

[1]  J. A. Robinson,et al.  The Generalized Resolution Principle , 1983 .

[2]  Daniel Brand,et al.  Proving Theorems with the Modification Method , 1975, SIAM J. Comput..

[3]  Gérard P. Huet,et al.  Proofs by induction in equational theories with constructors , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[4]  Jean-Pierre Jouannaud,et al.  Recursive Decomposition Ordering , 1982, Formal Description of Programming Concepts.

[5]  Gérard P. Huet,et al.  A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm , 1981, J. Comput. Syst. Sci..

[6]  N. S. Barnett,et al.  Private communication , 1969 .

[7]  David R. Musser,et al.  On proving inductive properties of abstract data types , 1980, POPL '80.

[8]  Jean-Marie Hullot,et al.  Canonical Forms and Unification , 1980, CADE.

[9]  Jack K. Cohen,et al.  Computer-Implemented Set Theory , 1980 .

[10]  Hélène Kirchner,et al.  Completion of a Set of Rules Modulo a Set of Equations , 1986, SIAM J. Comput..

[11]  Lewis M. Norton,et al.  Experiment with an automatic theorem-prover having partial ordering inference rules , 1973, CACM.

[12]  D. Knuth,et al.  Simple Word Problems in Universal Algebras , 1983 .

[13]  François Fages,et al.  Associative-Commutative Unification , 1984, CADE.

[14]  Robert A. Kowalski,et al.  Semantic Trees in Automatic Theorem-Proving , 1983 .

[15]  Nachum Dershowitz,et al.  Orderings for term-rewriting systems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[16]  Joseph A. Goguen,et al.  How to Prove Algebraic Inductive Hypotheses Without Induction , 1980, CADE.

[17]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[18]  Mark E. Stickel,et al.  Complete Sets of Reductions for Some Equational Theories , 1981, JACM.

[19]  Nachum Dershowitz.  Orderings for Term-Rewriting Systems , 1979, FOCS.

[20]  Alexander Herold.  Universal Unification and a Class of Equational Theories , 1982, GWAI.

[21]  G. Huet,et al.  Equations and rewrite rules: a survey , 1980 .

[22]  David A. Plaisted,et al.  A Simplified Problem Reduction Format , 1982, Artif. Intell..

[23]  J. Hullot.  A Catalogue of Canonical Term Rewriting Systems. , 1980 .

[24]  Bruno Buchberger,et al.  A criterion for eliminating unnecessary reductions in the Knuth-Bendix algorithm , 1983, SIGS.

[25]  W. W. Bledsoe,et al.  Non-Resolution Theorem Proving , 1977, Artif. Intell..

[26]  Pierre Lescanne,et al.  Computer experiments with the REVE term rewriting system generator , 1983, POPL '83.

[27]  M. Stone.  The theory of representations for Boolean algebras , 1936 .

[28]  Mark E. Stickel,et al.  A Unification Algorithm for Associative-Commutative Functions , 1981, JACM.

[29]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[30]  Jörg H. Siekmann,et al.  Universal Unification , 1982, GWAI.

[31]  J. A. Robinson,et al.  Theorem-Proving on the Computer , 1963, JACM.

[32]  Claude Kirchner,et al.  A New Equational Unification Method: A Generalization of Martelli-Montanari's Algorithm , 1984, CADE.

[33]  D. C. Cooper,et al.  THEOREM-PROVING IN COMPUTERS , 1966 .

[34]  David A. Plaisted,et al.  Comparison of Natural Deduction and Locking Resolution Implementations , 1982, CADE.

[35]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[36]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.

[37]  James R. Slagle,et al.  Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity , 1974, JACM.