Skip to main content
SpringerLink
Log in
Book cover

Baltic Computer Science Conference

BCS 1991: Baltic Computer Science pp 33–64Cite as

Using resolution for deciding solvable classes and building finite models

  • Deductive Synthesis Of Programs
  • Conference paper
  • First Online:

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

Abstract

The paper consists of two parts. In the first part we briefly describe the resolution strategy devised by N.Zamov which decides a number of solvable classes, including Maslov's Class K (this class contains most well-known decidable classes like Gödel's Class, Skolem's Class, Monadic Class). We give a strategy close to Zamov's, deciding a a wide class with functional symbols. A short description of our theorem-prover implementing the decision strategies is given.

The second part presents the main result of the paper: a new, resolution-based method for showing the existence of finite models and an algorithm for building such models for several solvable classes. For small formulas our method often generates considerably smaller models than known methods of B.Dreben and W.D.Goldfarb, although it doesn't improve the known upper bounds on the size of the models.

The work described here has been guided by G.Mints. We would also like to thank N.Zamov for helpful discussions.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barendregt, H.P. The Lambda Calculus. (North Holland, Amsterdam, 1981).

    Google Scholar 

  2. Church, A. Introduction to mathematical logic I. (Princeton University Press, New Jersey, 1956).

    Google Scholar 

  3. Dreben, B., Goldfarb, W.D. The decision problem: solvable classes of quantificational formulas. (Addison-Wesley, Reading, 1979).

    Google Scholar 

  4. Joyner, W.H. Resolution strategies as decision procedures. J. ACM 23 (3) (1976), 396–417.

    Google Scholar 

  5. Leitsch, A. On different concepts of resolution. Zeitschr. f. math. Logik und Grundlagen d. Math. 35 (1989) 71–77.

    Google Scholar 

  6. Leitsch, A. Implication algorithms for classes of horn clauses. Statistik, Informatik und Ökonomie, hrsg. v. W.Janko. 172–189, Springer 1988.

    Google Scholar 

  7. Lewis, H.R. Complexity results for classes of quantificational formulas. J. Computer and System Sciences 21 (3) (1980) 317–353

    Article  Google Scholar 

  8. Maslov, S.Ju. 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 

  9. Maslov, S.Ju. The inverse method for establishing deducibility for logical calculi. Trudy Mat. Inst. Steklov 98 (1968) 26–87= Proc. Steklov. Inst. Math. 98 (1968) 25–96, MR 40 #5416; 43 #4620.

    Google Scholar 

  10. Maslov, S.Ju. Proof-search strategies for methods of the resolution type. Machine Intelligence 6 (American Elsevier, 1971) 77–90.

    Google Scholar 

  11. Mints, G.E, Tammet, T. Experiments in proving formulas of nonclassical logics with a resolution theorem-prover. To appear in the Journal of Automated Reasoning.

    Google Scholar 

  12. Slagle, J.R. Automated theorem-proving for theories with simplifiers, commutativity and associativity. J. ACM 21 (4) (1974), 622–642.

    Article  Google Scholar 

  13. Tammet, T. A resolution program, able to decide some solvable classes. Proceedings of Colog-88, LNCS 417, 300–312, Springer Verlag 1990.

    Google Scholar 

  14. Wos, L., Overbeek, R., Lusk, E. Boyle, J. Automated reasoning: introduction and applications. (Prentice-Hall, New Jersey, 1984).

    Google Scholar 

  15. Zamov, N.K., On a bound for the complexity of terms in the resolution method. Trudy Mat. Inst. Steklov 128 (1972), 5–13.

    Google Scholar 

  16. Zamov, N.K., Maslov's inverse method and decidable classes. Annals of Pure and Applied Logic 42 (1989), 165–194.

    Article  Google Scholar 

  17. Маслов С.Ю. Минц Г.Е. Теория поиска вывода и обратный метод. Доп. к русскому переводу: Чень, Ч., Ли, Р. Математическая лоогика и автоматическое доказательство теорем. (Наука, М., 1983) 291–314.

    Google Scholar 

  18. Оревков В.П. Один разрещимый класс формул классического исчисления предикатов с функциональными знаками. СБ: II симпозиум по кибернетике (тезисы), тбилиси 1965, 176.

    Google Scholar 

  19. Сочилина А.В. О программе, реализующей алгоритм установления выводимости формул классического исчисления предикатов. Семиотика и информатика 12 (1979).

    Google Scholar 

  20. Шаронов В.И. Анализ полноты стратегий в методе резолюций. Диссертация. Ленинград 1973.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Cybernetics, Akadeemia tee 21, 200108, Tallinn, Estonia

    Tanel Tammet

Authors
  1. Tanel Tammet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Janis Bārzdinš Dines Bjørner

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tammet, T. (1991). Using resolution for deciding solvable classes and building finite models. In: Bārzdinš, J., Bjørner, D. (eds) Baltic Computer Science. BCS 1991. Lecture Notes in Computer Science, vol 502. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019355

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54131-8

  • Online ISBN: 978-3-540-47427-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation