Special relations in automated deduction

Two deduction rules are introduced to give streamlined treatment to relations of special importance in an automated theorem-proving system. These rules, the relation replacement and relation matching rules, generalize to an arbitrary binary relation the paramodulation and E-resolution rules, respectively, for equality, and may operate within a nonclausal or clausal system. The new rules depend on an extension of the notion of polarity to apply to subterms as well as to subsentences, with respect to a given binary relation. The rules allow us to eliminate troublesome axioms, such as transitivity and monotonicity, from the system; proofs are shorter and more comprehensible, and the search space is correspondingly deflated.

[1]  Journal of the Association for Computing Machinery , 1961, Nature.

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

[3]  James B. Morris,et al.  E-Resolution: Extension of Resolution to Include the Equality Relation , 1969, IJCAI.

[4]  Robert Anderson.  Completeness results for e-resolution , 1970, AFIPS '70 (Spring).

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

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

[7]  Donald W. Loveland,et al.  Automated theorem proving: a logical basis , 1978, Fundamental studies in computer science.

[8]  J. A. Robinson,et al.  Logic, form and function , 1979 .

[9]  Zohar Manna,et al.  A Deductive Approach to Program Synthesis , 1979, TOPL.

[10]  Zohar Manna,et al.  Deductive Synthesis of the Unification Algorithm , 1981, Sci. Comput. Program..

[11]  Neil V. Murray.  Completely Non-Clausal Theorem Proving , 1982, Artif. Intell..

[12]  Robert A. Kowalski,et al.  Logic for problem solving , 1982, The computer science library : Artificial intelligence series.

[13]  Mark E. Stickel,et al.  A Nonclausal Connection-Graph Resolution Theorem-Proving Program , 1982, AAAI.

[14]  R. Waldinger,et al.  Special Relations in Program-Synthetic Deduction, , 1982 .

[15]  L. Wos,et al.  Paramodulation and Theorem-Proving in First-Order Theories with Equality , 1983 .

[16]  Vincent J. Digricoli.  Resolution by unification and equality , 1983 .

[17]  Zohar Manna,et al.  The Origin of the Binary-Search Paradigm , 1985, IJCAI.

[18]  Zohar Manna,et al.  The logical basis for computer programming. Volume 1: deductive reasoning , 1985 .