Skip to main content
SpringerLink
Log in

What is the inverse method?

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

Abstract

A large part of the work on automated reasoning done in the Soviet Union in the sixties and seventies was based on the inverse method proposed by Sergey Maslov. We review the basic ideas of the method in the form that stresses its connection with resolution.

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

  • A. Church (1956) Introduction to Mathematical Logic 1, Princeton.

  • G. V. Davydov (1968) A method for establishing deducibility in classical predicate calculus (Russian), Zapiski Nauchnykh Seminarov LOMI 8. [English translation in Seminars in Mathematics: Steklov Mathem. Inst. 4, Consultants Bureau, New York-London.]

  • G. V. Davydov (1971) The synthesis of the resolution method and the inverse method (Russian), Zapiski Nauchnykh Seminarov LOMI 20. [English translation in Journal of Soviet Mathematics 1 No. 1.]

  • G. V. Davydov, S. Yu. Maslov, G. E. Minc, V. P. Orevkov and A. O. Slisenko (1969) A machine algorithm for establishing deducibility on the basis of the inverse method (Russian), Zapiski Nauchnykh Seminarov LOMI 16. [English translation in Seminars in Mathematics: Steklov Mathem. Inst. 16, Consultants Bureau, New York-London, 1971; also in J. Siekmann and G. Wrightson (Eds.), Automation of Reasoning 2, Springer-Verlag, 1983.]

  • B. S. Dreben (1962) Solvable Surányi subclasses, Proc. Harvard Symp. Digital Computers and their Applications, Cambridge.

  • J. A. Friedman (1963) Semi-decision procedure for the functional calculus, Journal of ACM 10.

  • L. Henschen, E. Lusk, R. Overbeek, B. T. Smith, R. Veroff, S. Winker and L. Wos (1980) Challenge Problem 1, SIGART Newsletter # 72.

  • J. Herbrand (1930) Recherches sur la théorie de la demonstration, Travaux de la Societé des Sciences et des Lettres de Varsovie, Classe III, sciences mathématiques at physiques 33.

  • S. Kanger (1963) A simplified proof method for elementary logic, in Computer Programming and Formal Systems (P. Braffort, D. Hirschberg, eds.). North-Holland Publ., Amsterdam.

    Google Scholar 

  • S. C. Kleene (1952) Introduction to Metamathematics, Von Nostrand, New York-Toronto.

    Google Scholar 

  • D. Kuehner (1971) A note on the relation between resolution and Maslov's inverse method, Machine Intelligence 6.

  • M. R. Krom (1964) A decision procedure for a class of formulas of first-order predicate calculus, Pacific Journal of Mathematics 14.

  • V. Lifschitz (1986) Mechanical Theorem Proving in the USSR: The Leningrad School, Delphic Associates, Falls Church, VA.

    Google Scholar 

  • S. Yu. Maslov (1964) The inverse method for establishing deducibility in classical predicate calculus (Russian), Doklady AN SSSR 159. [English translation in Soviet Mathematics-Doklady 5.]

  • S. Yu. Maslov (1966) Application of the inverse method for establishing deducibility to the theory of decidable fragments of predicate calculus (Russian), Doklady AN SSSR 171. [English translation in Soviet Mathematics-Doklady 7.]

  • S. Yu. Maslov (1967) The inverse method for establishing deducibiliity of nonprenex formulas of predicate calculus (Russian), Doklady AN SSSR 172. [Engligh translation in Soviet Mathematics-Doklady 8.]

  • S. Yu. Maslov (1968) The inverse method for establishing deducibility for logical calculi (Russian), Trudy Matem. Inst. AN SSSR 98. [English translation in Proc. Steklov Inst. of Mathematics 98, American Math. Society, Providence, 1971.]

  • S. Yu Maslov (1969a) Relationship between the tactics of the inverse method and the resolution method (Russian), Zapiski Nauchnykh Seminarov LOMI 16. [English translation in Seminars in Mathematics: Steklov Mathem. Inst. 16, Consultants Bureau, New York-London, 1971; also in J. Siekmann and G. Wrightson (Eds.), Automation of Reasoning 2, Springer-Verlag, 1983.]

  • S. Yu. Maslov (1971) The generalization of the inverse method to predicate calculus with equality (Russian), Zapiski Nauchnykh Seminarov LOMI 20. [English translation in Journal of Soviet Mathematics 1 No. 1.]

  • S. Yu. Maslov (1971a) Proof-search strategies for methods of the resolution type, Machine Intelligence 6.

  • S. Yu. Maslov (1972) The inverse methods and tactics for establishing deducibility for a calculus with function symbols (Russian), Trudy Matem. Inst. AN SSSR 121. [English translation in Proc. Steklov Inst. of Mathematics 121, American Math. Society, Providence, 1974.]

  • S. Yu. Maslov (1986) The Theory of Deductive Systems and Its Applications (Russian), Radio i Svyaz, Moscow. [English translation published by MIT Press, 1987.]

    Google Scholar 

  • S. Yu. Maslov and G. E. Minc (1983) The theory of proof search and the inverse method (Russian), Appendix A to the Russian translation of: C.-L. Chang and R. C.-T. Lee, Symbolic Logic and Mechanical Theorem Proving, Nauka, Moscow.

    Google Scholar 

  • S. Yu. Maslov and V. P. Orevkov (1972) Decidable classes reducing to a one-quantifier class (Russian), Trudy Matem. Inst. AN SSSR 121. [English translation in Proc. Steklov Inst. of Mathematics 121, American Math. Society, Providence, 1974.]

  • G. E. Minc (1968) Review of (Maslov 1964), Zentralblatt für Mathematik 146.

  • S. A. Norgela (1986) One generalization of Maslov's decidable class (Russian), Primenenie Metodov Matematicheskoy Logiki (Abstracts of Papers Presented at the Fourth All-Union Conf. on the Application of Methods of Math. Logic), Tallinn.

  • V. P. Orevkov (1968) Two undecidable classes of formulas of classical predicate calculus (Russian), Zapiski Nauchnykh Seminarov LOMI 8. [English translation in Seminars in Mathematics: Steklov Mathem. Inst. 8, Consultants Bureau, New York-London, 1971.]

  • A. Yu. Plyushkevichene (1972) Extension of the inverse method to axiomatic theories with equality (Russian), Zapiski Nauchnykh Seminarov LOMI 32. [English translation in Journal of Soviet Mathematics 6 No. 1.]

  • D. Prawitz (1960) An improved proof procedure, Theoria 26.

  • J. A. Robinson (1965) A machine-oriented logic based on the resolution principle, Journal of ACM 12.

  • J. A. Robinson (1967) A review of automatic theorem proving, Annual Symp. in Applied Math. 19. American Mathematical Society, Providence.

    Google Scholar 

  • J. R. Slagle (1967) Automatic theorem proving with renamable and semantic resolution, Journal of ACM 14.

  • G. S. Tseytin (1968) On the complexity of derivation in propositional calculus (Russian), Zapiski Nauchnykh Seminarov LOMI 8. [English translation in Seminars in Mathematics: Steklov Mathem. Inst. 4, Consultants Bureau, New York-London.]

  • Hao Wang (1964) Dominoes and the AEA case of the decision problem, in Proc. Symp. Math. Theory Machines.

  • L. Wos (1987) Automated Reasoning: 33 Basic Research Problems, Prentice-Hall.

  • L. Wos, D. Carson and G. Robinson (1964) The unit preference strategy in theorem proving, Proc. Fall Joint Computer Conf., Thompson Book Company, New York.

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Stanford University, 94305, Stanford, CA, U.S.A.

    Vladimir Lifschitz

Authors
  1. Vladimir Lifschitz
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lifschitz, V. What is the inverse method?. J Autom Reasoning 5, 1–23 (1989). https://doi.org/10.1007/BF00245018

Download citation

  • Received:

  • Issue Date:

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

Key words

Search

Navigation