论文信息 - A New Interpretation of the Resolution Principle

A New Interpretation of the Resolution Principle

We show in this paper that the application of the resolution principle to a set of clauses can be regarded as the construction of a term rewriting system confluent on valid formulas. This result allows the extension of standard properties and methods of equational theories (such as Birkhoff’s theorem and Knuth and Bendix completion algorithm) to quantifier-free first order predicate calculus.

Etienne Paul | E. Paul

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

[2] Charisma Lee. A completeness theorem and a computer program for finding theorems derivable from given axioms , 1967 .

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

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

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

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

[7] Nachum Dershowitz,et al. Rewrite Methods for Clausal and Non-Clausal Theorem Proving , 1983, ICALP.

[8] G. Birkhoff,et al. On the Structure of Abstract Algebras , 1935 .

[9] Donald E. Knuth,et al. Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research. , 1970 .

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

[11] Jean-Pierre Jouannaud,et al. Confluent and Coherent Equational Term Rewriting Systems: Application to Proofs in Abstract Data Types , 1983, CAAP.