Advertisement

S-SLD-resolution — An operational semantics for logic programs with external procedures

  • Johan Boye
Session: Integration Of Programming Concepts II
Part of the Lecture Notes in Computer Science book series (LNCS, volume 528)

Abstract

This paper presents a new operational semantics for logic programs with external procedures, introduced in [BM88]. A new resolution procedure S-SLD-resolution is defined, in which each step of computation is characterized by a goal and a set of equational constraints, whose satisfiability cannot be decided with the information at hand. This approach improves the completeness of the resulting system, since further computation may result in the information needed to solve some earlier unsolved constraints. We also state a sufficient condition to distinguish a class of programs where no unsolved constraints will remain at the end of computation.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BM88]
    Bonnier, S. and J. Małuszyński. Towards a clean amalgamation of logic programs with external procedures. In 5th Int. conf. and symp. on logic programming, pp. 311–326, MIT Press, 1988.Google Scholar
  2. [Bon89]
    Bonnier, S. Horn clause logic with external procedures: towards a theoretical framework, Licenciate thesis, University of Linköping, Sweden, 1989.Google Scholar
  3. [Bon90]
    Bonnier, S. Horn clause logic with external procedures: towards a formal framework, Research report, University of Linköping, Sweden, 1990.Google Scholar
  4. [Bru87]
    Bruynooghe M. A framework for the abstract interpretation of logic programs. Report CW62, Katholieke Universiteit, Leuven, 1987.Google Scholar
  5. [DFT89]
    Deransart, P., G. Ferrand and M. Téguia. Une nouvelle construction de grammaires attribuées associées à un programme logique et application au problème du test d'occurrence, Research report 89-3, Laboratoire d'Informatique, University of Orléans, France, 1989.Google Scholar
  6. [DJL88]
    Deransart, P., M. Jourdan and B. Lorho. Attribute grammars. Definitions, systems and bibliography, LNCS 323, Springer-Verlag, 1988.Google Scholar
  7. [DM85]
    Deransart, P. and J. Małuszyński. Relating logic programs and attribute grammars. Journal of logic programming, 2(2), pp. 119–156, 1985.Google Scholar
  8. [DM91]
    Deransart, P. and J. Małuszyński. A grammatical view on logic programming, MIT Press. To appear.Google Scholar
  9. [Höl89]
    Hölldobler, S. Foundations of equational logic programming, Lecture notes in artificial intelligence 353, Springer Verlag, 1989.Google Scholar
  10. [JL87]
    Jaffar, J. and J-L. Lassez. Constraint logic programming. In 14th ACM POPL Conf., ACM, 1987.Google Scholar
  11. [JLM84]
    Jaffar, J., J-L. Lassez and M. Maher. A theory of complete logic programs with equality. Journal of logic programming, 1(3), pp. 211–223, 1984.Google Scholar
  12. [JS87]
    Jones, N.D. and H. Søndergaard. A semantics-based framework for the abstract interpretation of Prolog. In Abramsky and Hankin editors, Abstract interpretation of declarative languages, pp. 123–142, Ellis Horwood, 1987.Google Scholar
  13. [KK91]
    Kågedal, A and F. Kluźniak. Enriching Prolog with S-unification, Research report LiTH-IDA-R-91-12, University of Linköping, Sweden, 1991.Google Scholar
  14. [Mel87]
    Mellish C. Abstract interpretation of Prolog programs. In Abramsky and Hankin editors, Abstract interpretation of declarative languages, pp. 181–198, Ellis Horwood, 1987.Google Scholar
  15. [Nil90]
    Nilsson, U. Systematic semantic approximations of logic programs. In Deransart and Małuszyński editors, Proc. PLILP'90, pp. 293–306, Springer Verlag, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Johan Boye
    • 1
  1. 1.Dept. of Computer and Information ScienceUniversity of LinköpingLinköpingSweden

Personalised recommendations