We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Skip to main content
SpringerLink
Log in

Model elimination without contrapositives and its application to PTTP

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

We give modifications of model elimination that do not necessitate the use of contrapositives. These restart model elimination calculi are proven sound and complete, and their implementation by PTTP is depicted. The corresponding proof procedures are evaluated by a number of runtime experiments, and they are compared to other well-known provers. We relate our results to other calculi, namely, the connection method, modified problem reduction format, and near-Horn Prolog.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Astrachan, Owen L. and Stickel, Mark E.: Caching and lemmaizing in model elimination theorem provers, in D. Kapur (ed.),Proc. 11th International Conference on Automated Deduction (CADE-11), Springer-Verlag, LNAI 607, 1992, pp. 224–238.

  • Baumgartner, P. and Furbach, U.: Consolution as a framework for comparing calculi,Journal of Symbolic Computation 16(5) (1993).

  • Baumgartner, P. and Furbach, U.: PROTEIN: APROver with aTheoryExtension/Interface, in A. Bundy (ed.),Proc. 12th International Conference on Automated Deduction (CADE-12), Lecture Notes in AI 814, Springer-Verlag, 1994, pp. 769–773.

  • Baumgartner, P.: A model elimination calculus with built-in theories, in H.-J. Ohlbach (ed.),Proc. 16-th German AI-Conference (GWAI-92), Lecture Notes in AI 671, Springer-Verlag, 1992, pp. 30–42.

  • Bibel, W.:Automated Theorem Proving, Vieweg, 2nd edn, 1987.

  • Bledsoe, W. W.: Challenge problems in elementary calculus,Journal of Automated Reasoning 6 (1990), 341–359.

    Google Scholar 

  • Chang, C. and Lee, R.:Symbolic Logic and Mechanical Theorem Proving, Academic Press, 1973.

  • Eder, E.: Consolution and Its Relation with Resolution, inProc. IJCAI'91, 1991.

  • Eder, E.:Relative Complexities of First Order Languages, Vieweg, 1992.

  • Fitting, M.:First-Order Logic and Automated Theorem Proving, Texts and Monographs in Computer Science, Springer, 1990.

  • Gabbay, D. M.: N-Prolog: An extension of Prolog with hypothetical implication II. Logical foundations, and negation as failure,Journal of Logic Programming 2(4) (1985), 251–284.

    Google Scholar 

  • Gallier, J.:Logic for Computer Science: Foundations of Automatic Theorem Proving, Wiley, 1987.

  • Letz, R., Schumann, J., Bayerl, S., and Bibel, W.: SETHEO: A high-performance theorem prover,Journal of Automated Reasoning 8(2) (1992), 183–212.

    Google Scholar 

  • Lloyd, J.:Foundations of Logic Programming, Symbolic Computation. Springer, second, extended edition, 1987.

  • Loveland, D. W. and Reed, D. W.:A Near-Horn Prolog for Compilation, Technical Report CS-1989-14, Duke University, 1989.

  • Loveland, D.: Mechanical theorem proving by model elimination,JACM 15(2) (1968).

  • Loveland, D.: Near-Horn Prolog and beyond,Journal of Automated Reasoning 7 (1991), 1–26.

    Google Scholar 

  • Manthey, R. and Bry, F.: SATCHMO: A theorem prover implemented in Prolog, inProc. 9th CADE, Illinois, Springer LNCS, 1988.

    Google Scholar 

  • Mellouli, Taīeb: A Tree Representation of the Modified Problem Reduction and Its Extension to Three-valued Logic. KI-NRW 90-19, Universität Duisburg, FB 11 — Praktische Informatik, 1990.

  • Pereira, Luis, Moniz, Caires, Luis, and Alferes, José:SLWV — A Theorem Prover for Logic Programming, AI Centre, Uninova, Monte da Caparica, Portugal, 1991.

    Google Scholar 

  • Plaisted, D.: Non-Horn clause logic programming without contrapositives,Journal of Automated Reasoning 4 (1988), 287–325.

    Google Scholar 

  • Plaisted, D.: A sequent-style model elimination strategy and a positive refinement,Journal of Automated Reasoning 4(6) (1990), 389–402.

    Google Scholar 

  • Reed, D. W. and Loveland, D. W.: A comparison of three Prolog extensions,Journal of Logic Programming 12 (1992), 25–50.

    Google Scholar 

  • Stickel, M.: A Prolog technology theorem prover: Implementation by an extended Prolog compiler,Journal of Automated Reasoning 4 (1988), 353–380.

    Google Scholar 

  • Stickel, M.: A Prolog technology theorem prover: A new exposition and implementation in Prolog. Technical note 464, SRI International, 1989.

  • Wos, L.:Automated Reasoning: 33 Basic Research Problems, Prentice-Hall, 1988.

Download references

Author information

Authors and Affiliations

  1. University of Koblenz, Rheinau 1, D 56075, Koblenz, Germany

    Peter Baumgartner & Ulrich Furbach

Authors
  1. Peter Baumgartner
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ulrich Furbach
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

A shorter version will appear under the title “Model Elimination Without Contrapositives” inProc. of the CADE'94.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baumgartner, P., Furbach, U. Model elimination without contrapositives and its application to PTTP. J Autom Reasoning 13, 339–359 (1994). https://doi.org/10.1007/BF00881948

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00881948

Key words

Search

Navigation