Resolution for logic programming with universal quantifiers

  • Antony F. Bowers
  • Patricia M. Hill
  • Francisco Ibañez
Language Constructs
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1292)


It is clearly desirable that logical specifications and the programs that implement them should be as close as possible. Such a claim is often made in support of the logic programming paradigm. However, SLD-resolution, the basic procedural semantics for logic programming, is only defined for programs whose statements are Horn clauses. Most research for extending the Horn clause framework has been concerned with allowing negative literals in the bodies of the statements where SLD-resolution is extended with negation-as-failure. However, one of the main components of first order logic not allowed in clauses is (explicit) quantification. This paper addresses this problem by showing how SLD-resolution can be extended to allow for universally quantified implication formulas as conjuncts in the body of the statements. It will be shown that this technique includes negation-as-failure as a degenerate case.


Universal quantifiers implication logic programming resolution programming languages specification 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    K.R. Apt. Arrays, bounded quantification and iteration in logic and constraint programming. In Proc. of GULP-PRODE'95 Salerno, Italy, 1995.Google Scholar
  2. 2.
    K.R. Apt and H.C. Doets. A new definition of SLDNF-resolution. Journal of Logic Programming, 18(2):177–190, 1992.Google Scholar
  3. 3.
    H. Arro, J. Barklund, and J. Bevemyr. Parallel bounded quantification-preliminary results. ACM SIGPLAN Notices, 28(5):117–124, August 1993.Google Scholar
  4. 4.
    J. Barklund. Bounded quantifications for iterations and concurrency in logic programming. New Generation Computing, 12(2), 1994.Google Scholar
  5. 5.
    J. Barklund and J. Bevemyr. Prolog with arrays and bounded quantification. In Logic Programming and Automated Reasoning (LPAR'93). Springer-Verlag, 1993.Google Scholar
  6. 6.
    J. Barklund and J. Bevemyr. Executing bounded quantifications on shared memory multiprocessors. PLILP, LNCS 714, pages 302–317, 1993. Springer-Verlag.Google Scholar
  7. 7.
    M. Carlsson and J. Widén. SICStus Prolog user's manual. Technical Report 6R88007C, Swedish Institute of Computer Science, 1991.Google Scholar
  8. 8.
    K.L. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 293–322. Plenum Press, 1978.Google Scholar
  9. 9.
    P.M. Hill and J.W. Lloyd. The Gödel Programming Language. MIT Press, 1994.Google Scholar
  10. 10.
    J.W. Lloyd and R.W. Topor. Making Prolog more expressive. Journal of Logic Programming, 1(3):225–240, 1984.Google Scholar
  11. 11.
    J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 2nd ed., 1987.Google Scholar
  12. 12.
    J.W. Lloyd and J.C. Shepherdson. Partial evaluation in logic programming. The Journal of Logic Programming, 11(3&4):217–242, 1991.Google Scholar
  13. 13.
    J.W. Lloyd. Programming in an integrated functional and logic language. Journal of Functional and Logic Programming, 1997. To appear.Google Scholar
  14. 14.
    G. Nadathur. A proof procedure for the logic of hereditary harrop formulas. Journal of Automated Reasoning, 11:115–145, 1993.Google Scholar
  15. 15.
    T. Sato and H. Tamaki. First order compiler: A deterministic logic program synthesis algorithm. Journal of Symbolic Computation, 8:605–627, 1988.Google Scholar
  16. 16.
    R. D. Tennent. Semantics of Programming Languages. Prentice-Hall, 1991.Google Scholar
  17. 17.
    A. Voronkov. Logic programming with bounded quantifiers. In A. Voronkov, editor, Logic Programming — 2nd Russian Conf. on Logic Programming, pages 486–514. Springer-Verlag, 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Antony F. Bowers
    • 1
  • Patricia M. Hill
    • 2
  • Francisco Ibañez
    • 3
  1. 1.University of BristolUK
  2. 2.University of LeedsUK
  3. 3.Universidad Nacional de San JuanArgentina

Personalised recommendations