Advertisement

A tool to check the non-floundering logic programs and goals

  • Roberto Barbuti
  • Maurizio Martelli
Abstract Interpretation In Logic Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 348)

Abstract

A complete implementation of the negation as failure rule in a logic programming system requires that only ground negative literals are selected during the evaluation. Obviously there is the possibility to have only non-ground negative literals in the goal (the floundering of the goal). A powerful logic programming environment should provide a tool that is able to recognize programs that, with a given goal, could result in a floundering. In this paper we present such a tool based on an abstract interpretation algorithm.

Keywords

Logic Program Logic Programming Abstract Interpretation Predicate Symbol Domain Result 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Apt K.R. Introduction to Logic Programming. To appear in: Handbook of Theoretical Computer Science (J. van Leeuwen Ed.), North Holland.Google Scholar
  2. [2]
    Apt K.R. Blair H.A. and Walker A. Towards a Theory of Declarative Knowledge. Foundations of Deductive Databases and Logic Programming (J. Minker Ed.), Morgan Kaufman, Los Altos, 1987.Google Scholar
  3. [3]
    Barbuti R. and Martelli M. Completeness of the SLDNF-resolution for a Class of Logic Programs. Third Int. Conf. on Logic Programming, London, 1986, 600–614.Google Scholar
  4. [4]
    Barbuti R. and Martelli M. A characterization of non-floundering logic programs and goals based on abstract interpretation techniques. Submitted for publication.Google Scholar
  5. [5]
    Bruynooghe M., Janssens G., Callebaut, A. and Demoen B. Abstract Interpretation: Towards the Global Optimization of Prolog Programs. 4th Int. Symp. on Logic Programming, San Francisco, 1987, 192–204.Google Scholar
  6. [6]
    Cavedon L. and Lloyd J.W. A Completeness Theorem for SLDNF-resolution. Report CS-87-06 University of Bristol, 1987.Google Scholar
  7. [7]
    Clark K.L. Negation as Failure. Logic and Data Bases. (H. Gallaire and J. Minker Eds.), Plenum Press, New York, 1978, 293–322.Google Scholar
  8. [8]
    Debray S.K. and Warren D.S. Automatic Mode Inference for Prolog Programs. Third Int. Symp. on Logic Programming, Salt Lake City, 1986, 78–88.Google Scholar
  9. [9]
    Debray S.K. Efficient Dataflow Analysis of Logic Programs. Fifteenth ACM Symp. on Principles of Programming Languages, San Diego, 1988, 260–273.Google Scholar
  10. [10]
    Deransart P. and Maluszynski J. Modelling Data Dependencies in Logic Programming by Attribute Schemata. INRIA Internal Report, 1984.Google Scholar
  11. [11]
    Jaffar J. Lassez J-L. and Lloyd J.W. Completeness of the Negation as Failure Rule. IJCAI 83, Karlsruhe, 1983, 500–506.Google Scholar
  12. [12]
    Kunen K. Negation in Logic Programming. J. Logic Programming 4, 4 (1987), 289–308.Google Scholar
  13. [13]
    Kunen K. Signed Data Dependencies in Logic Programs. University of Wisconsin. To appear.Google Scholar
  14. [14]
    Lloyd J.W. Foundations of Logic Programming. Second Edition, Springer-Verlag, Symbolic Computation Series, 1987.Google Scholar
  15. [15]
    Lloyd J.W. and Topor R.W. A Basis for Deductive Database Systems II. J. Logic Programming 3, 1 (1986), 55–67.Google Scholar
  16. [16]
    Mannila H. and Ukkonen E. Flow Analysis of Prolog Programs. 4th Int. Symp. on Logic Programming, San Francisco, 1987, 205–214.Google Scholar
  17. [17]
    Mellish C.S. Abstract Interpretation of Prolog Programs. Third Int. Conf. on Logic Programming, London, 1986, 463–474.Google Scholar
  18. [18]
    Shepherdson J.C. Negation in Logic Programming. Foundations of Deductive Databases and Logic Programming (J. Minker Ed.), Morgan Kaufman, Los Altos, 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Roberto Barbuti
    • 1
  • Maurizio Martelli
    • 2
  1. 1.Dipartimento di InformaticaPisaItaly
  2. 2.Cnuce-CnrPisaItaly

Personalised recommendations