论文信息 - Consolution as a Framework for Comparing Calculi

Consolution as a Framework for Comparing Calculi

In this paper, stepwise and nearly stepwise simulation results for a number of first-order proof calculi are presented and an overview is given that illustrates the r elations between these calculi. For this purpose, we modify the consolution calculus in such a way that it can be instantiated to resolution, tableaux model elimination, a connection methodand Loveland’s model elimination.

Peter Baumgartner | Ulrich Furbach

[1] Lawrence J. Henschen,et al. What Is Automated Theorem Proving? , 1985, J. Autom. Reason..

[2] Mark E. Stickel,et al. A Prolog Technology Theorem Prover: A New Exposition and Implementation in Prolog , 1990, Theor. Comput. Sci..

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

[4] Peter Baumgartner. A Model Elimination Calculus with Built-in Theories , 1992, GWAI.

[5] Elmar Eder. Consolution and its Relation with Resolution , 1991, IJCAI.

[6] Wolfgang Bibel. A Comparative Study of Several Proof Procedures , 1982, Artif. Intell..

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

[8] Donald W. Loveland,et al. A Unifying View of Some Linear Herbrand Procedures , 1972, J. ACM.

[9] E. Beth,et al. The Foundations of Mathematics , 1961 .

[10] Dag Prawitz,et al. A proof procedure with matrix reduction , 1970 .

[11] Jean H. Gallier,et al. Logic for Computer Science: Foundations of Automatic Theorem Proving , 1985 .

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

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

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