Linear-Input Subset Analysis

There are syntactically identifiable situations in which reduction does not occur in chain format linear deduction systems, i.e. situations in which linear-input subdeductions are performed. Three methods of detecting these situations are described in this paper. The first method (Horn subset analysis) focuses on Horn input chains while the second (LISS analysis) and third (LISL analysis) are successive generalisations of the first method. A significant benefit that may be derived from detecting linear-input subdeductions is the applicability of a truth value deletion strategy in such subdeductions. The completeness of the deletion strategy is proved, and its efficacy indicated.

[1]  Mark Tarver.  An Examination of the Prolog Technology Theorem-Prover , 1990, CADE.

[2]  J. A. Robinson,et al.  Automatic Deduction with Hyper-Resolution , 1983 .

[3]  Thomas H. Payne,et al.  Case-Free Programs: An Abstraction of Definite Horn Programs , 1990, CADE.

[4]  Alan Bundy.  Proceedings of the 12th International Conference on Automated Deduction , 1994 .

[5]  Geoff Sutcliffe.  A General Clause Theorem Prover , 1990, CADE.

[6]  Bernard Meltzer.  Theorem-Proving for Computers: Some Results on Resolution and Renaming , 1966, Comput. J..

[7]  D. Loveland.  A Linear Format for Resolution , 1970 .

[8]  Robert E. Shostak.  Refutation Graphs , 1976, Artif. Intell..

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

[10]  Michael A. McRobbie,et al.  Towards Efficient "Knowledge-Based" Automated Theorem Proving for Non-Standard Logics , 1988, CADE.

[11]  Peter B. Andrews.  Resolution With Merging , 1968, JACM.

[12]  Geoff Sutcliffe.  The Semantically Guided Linear Deduction System , 1992, CADE.

[13]  Mark E. Stickel.  A prolog Technology Theorem Prover: Implementation by an Extended Prolog Compiler , 1986, CADE.

[14]  James R. Slagle,et al.  Automatic Theorem Proving With Renamable and Semantic Resolution , 1967, JACM.

[15]  R. Kowalski,et al.  Linear Resolution with Selection Function , 1971 .

[16]  Donald W. Loveland,et al.  A Simplified Format for the Model Elimination Theorem-Proving Procedure , 1969, J. ACM.

[17]  Graem A. Ringwood.  SLD: a folk acronym? , 1989, SIGP.

[18]  Jack Minker,et al.  An Extension to Linear Resolution with Selection Function , 1982, Inf. Process. Lett..

[19]  D. Luckham.  Refinement Theorems in Resolution Theory , 1970 .

[20]  Chin-Liang Chang.  The Unit Proof and the Input Proof in Theorem Proving , 1970, JACM.

[21]  K. Devlin.  THE COMPUTER MODELLING OF MATHEMATICAL REASONING , 1986 .

[22]  Larry Wos,et al.  Automated reasoning - 33 basic research problems , 1988 .

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

[24]  Donald W. Loveland,et al.  An Implementation of the Model Elimination Proof Procedure , 1974, JACM.