Completeness of resolution for definite answers with case analysis

  • Tanel Tammet
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 933)


We investigate the problem of finding a computable witness for the existential quantifier in a formula of the classical first-order predicate logic. The A-resolution calculus based on the program derivation algorithm A of C-L. Chang, R. C-T. Lee and R.Waldinger (a subsystem of the Manna-Waldinger calculus) is used for finding a definite substitution t for an existentially bound variable y in some formula F, such that F{t/y} is provable. The term t is built of the function and predicate symbols in F, plus Boolean functions and a case splitting function if, defined in the standard way: if(True,x,y) = x and if(False,x,y) = y. We prove that the A-resolution calculus is complete, i.e. if such a definite substitution exists, then the A-calculus derives a clause giving such a substitution. The result is strengthened by allowing the usage of liftable criterias R of a certain type, prohibiting the derivation of the substitution terms t for which R(t) fails. This enables us to specify, for example, that the substitution t must be in some special signature or must be type-correct, without losing completeness.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    C.L.Chang, R.C.T Lee. Symbolic Logic and Mechanical Theorem Proving. Academic Press, 1973.Google Scholar
  2. 2.
    C.L.Chang, R.C.T. Lee, R.Waldinger. An Improved Program-Synthesizing Algorithm and its Correctness. Comm. of ACM, (1974), V17, N4, 211–217.CrossRefGoogle Scholar
  3. 3.
    C.Fermüller, A.Leitsch, T.Tammet, N.Zamov. Resolution Methods for the Decision Problem. Lecture Notes in Artificial Intelligence 679, Springer Verlag, 1993.Google Scholar
  4. 4.
    C.Green. Application of theorem-proving to problem solving. In Proc. 1st Internat. Joint. Conf. Artificial Intelligence, pages 219–239, 1969.Google Scholar
  5. 5.
    S.C.Kleene. Introduction to Metamathematics. North-Holland, Amsterdam, 1952.Google Scholar
  6. 6.
    Z.Manna, R.Waldinger. A deductive approach to program synthesis. ACM Trans. Programming Languages and Systems, (1980), N2(1), 91–121.Google Scholar
  7. 7.
    Z.Manna, R.Waldinger. Fundamentals of Deductive Program Synthesis. IEEE Transactions on Software Engineering, (1992), V18, N8, 674–704.CrossRefGoogle Scholar
  8. 8.
    G.Mints, E.Tyugu. Justification of the structural synthesis of programs. Sci. of Comput. Program., (1982), N2, 215–240.CrossRefGoogle Scholar
  9. 9.
    G.Mints. Gentzen-type Systems and Resolution Rules. Part I. Prepositional Logic. In COLOG-88, pages 198–231. Lecture Notes in Computer Science vol. 417, Springer Verlag, 1990.Google Scholar
  10. 10.
    G.Mints. Gentzen-type Systems and Resolution Rules. Part II. Predicate Logic. In Logic Colloquium '90.Google Scholar
  11. 11.
    B.Nordström, K.Petersson, J.M.Smith. Programming in Martin-Löfs Type Theory. Clarendon Press, Oxford, 1990.Google Scholar
  12. 12.
    G.Peterson. A technique for establishing completeness results in theorem proving with equality. SIAM J. of Comput. (1983), N12, 82–100.CrossRefGoogle Scholar
  13. 13.
    J.A. Robinson. A Machine-oriented Logic Based on the Resolution Principle. Journal of the ACM 12, 1965, pp 23–41.CrossRefGoogle Scholar
  14. 14.
    U.R.Schmerl. A Resolution Calculus Giving Definite Answers. Report Nr 9108, July 1991, Fakultät für Informatik, Universität der Bundeswehr München.Google Scholar
  15. 15.
    N.Shankar. Proof Search in the Intuitionistic Sequent Calculus. In CADE-11, pages 522–536, Lecture Notes in Artificial Intelligence 607, Springer Verlag, 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Tanel Tammet
    • 1
  1. 1.Department of Computing ScienceChalmers University of Technology and Göteborg UniversityGöteborgSweden

Personalised recommendations