Hierarchical deduction

This paper describes an hierarchical deduction proof procedure. This procedure proves a theorem by searching for a proof acceptable to an hierarchical deduction structire; those derivations which are irrelevant to this proof are limited by means of a set of completeness-preserving refinements of the basic procedure, such as constraints on framed literals and on common tails, a proper reduction refinement, a global subsumption constraint, and a level subgoal reordering refinement, etc. In addition to this basic algorithm, we will present a partial set of support strategy and a semantically guided hierarchical deduction for the incorporation of semantics and human factors. The paper concludes with proofs concerning the completeness of the basic algorithm and the results of a computer implementation applied to some nontrivial problems.

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

[2]  Robert S. Boyer,et al.  A computational logic handbook , 1979, Perspectives in computing.

[3]  Larry Wos,et al.  Problems and Experiments for and with Automated Theorem-Proving Programs , 1976, IEEE Transactions on Computers.

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

[5]  Christoph Walther.  A Mechanical Solution of Schubert's Steamroller by Many-Sorted Resolution , 1984, AAAI.

[6]  Ross A. Overbeek.  A New Class of Automated Theorem-Proving Algorithms , 1974, JACM.

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

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

[9]  Donald W. Loveland,et al.  Mechanical Theorem-Proving by Model Elimination , 1968, JACM.

[10]  W. W. Bledsoe,et al.  A Linear Format for Resolution With Merging and a New Technique for Establishing Completeness , 1970, JACM.

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

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

[13]  Tie-Cheng Wang.  Designing Examples for Semantically Guided Hierarchical Deduction , 1985, IJCAI.

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

[15]  W. Tyson.  Aprvr: a priority-ordered agenda theorem prover , 1981 .