Skip to main content

Resolution, inverse method and the sequent calculus

  • Invited Papers
  • Conference paper
  • First Online:
Computational Logic and Proof Theory (KGC 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1289))

Included in the following conference series:

Abstract

We discuss the general scheme of building resolution calculi (also called the inverse method) originating from S. Maslov and G. Mints. A survey of resolution calculi for various nonclassical logic is presented, along with several common properties these calculi possess.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Baaz, C. Fermüller. Resolution-Based Theorem Proving for Many-Valued Logics. Journal of Symbolic Logic, 19, 353–391 (1995).

    Google Scholar 

  2. C.L. Chang, R.C.T. Lee. Symbolic Logic and Mechanical Theorem Proving. Academic Press, (1973).

    Google Scholar 

  3. C. Fermiiller, A. Leitsch, T. Tammet, N. Zamov. Resolution methods for decision problems. LNCS 679, Springer Verlag, (1993).

    Google Scholar 

  4. M. Fitting. Resolution for Intuitionistic Logic. Paper presented at ISMIS '87, Charlotte, NC. 1987.

    Google Scholar 

  5. J.-Y. Girard. Linear Logic. Theoretical Computer Science 50, 1–102 (1987).

    Google Scholar 

  6. S.Ju. Maslov. An inverse method of establishing deducibility in the classical predicate calculus. Dokl. Akad. Nauk. SSSR 159 (1964) 17-20=Soviet Math. Dokl. 5 (1964) 1420, MR 30 #3005.

    Google Scholar 

  7. G. Mints. Gentzen-type Systems and Resolution Rules. Part I. Propositional Logic. In COLOG-88, pages 198–231, LNCS 417, Springer-Verlag, 1990.

    Google Scholar 

  8. G. Mints. Resolution Calculus for The First Order Linear Logic. Journal of Logic, Language and Information, 2, 58–93 (1993).

    Google Scholar 

  9. G. Mints. Resolution Strategies for the Intuitionistic Logic. In Constraint Programming, NATO ASI Series F, v. 131, pp. 289–311, Springer Verlag, (1994).

    Google Scholar 

  10. G. Mints, V. Orevkov, T. Tammet. Transfer of Sequent Calculus Strategies to Resolution. In Proof Theory of Modal Logic, Studies in Pure and Applied Logic 2, Kluwer Academic Publishers, 1996.

    Google Scholar 

  11. J.A. Robinson. A Machine-oriented Logic Based on the Resolution Principle. Journal of the ACM 12, 23–41 (1965).

    Google Scholar 

  12. N. Shankar. Proof Search in the Intuitionistic Sequent Calculus. In CADE-11, pages 522–536, LNCS 607, Springer Verlag, (1992).

    Google Scholar 

  13. T. Tammet. Proof Strategies in Linear Logic. Journal of Automated Reasoning 12(3), 273–304 (1994).

    Google Scholar 

  14. T. Tammet. Resolution Theorem Prover for Intuitionistic Logic. In CADE-13, pages 2–16, LNCS 1104, Springer Verlag, (1996).

    Google Scholar 

  15. A. Voronkov. Theorem proving in non-standard logics based on the inverse method. In CADE-11, pages 648–662, LNCS 607, Springer Verlag, (1992).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Georg Gottlob Alexander Leitsch Daniele Mundici

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tammet, T. (1997). Resolution, inverse method and the sequent calculus. In: Gottlob, G., Leitsch, A., Mundici, D. (eds) Computational Logic and Proof Theory. KGC 1997. Lecture Notes in Computer Science, vol 1289. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63385-5_33

Download citation

  • DOI: https://doi.org/10.1007/3-540-63385-5_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63385-3

  • Online ISBN: 978-3-540-69806-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics