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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Apt K.R. Introduction to Logic Programming. To appear in: Handbook of Theoretical Computer Science (J. van Leeuwen Ed.), North Holland.
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.
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.
Barbuti R. and Martelli M. A characterization of non-floundering logic programs and goals based on abstract interpretation techniques. Submitted for publication.
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.
Cavedon L. and Lloyd J.W. A Completeness Theorem for SLDNF-resolution. Report CS-87-06 University of Bristol, 1987.
Clark K.L. Negation as Failure. Logic and Data Bases. (H. Gallaire and J. Minker Eds.), Plenum Press, New York, 1978, 293–322.
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.
Debray S.K. Efficient Dataflow Analysis of Logic Programs. Fifteenth ACM Symp. on Principles of Programming Languages, San Diego, 1988, 260–273.
Deransart P. and Maluszynski J. Modelling Data Dependencies in Logic Programming by Attribute Schemata. INRIA Internal Report, 1984.
Jaffar J. Lassez J-L. and Lloyd J.W. Completeness of the Negation as Failure Rule. IJCAI 83, Karlsruhe, 1983, 500–506.
Kunen K. Negation in Logic Programming. J. Logic Programming 4, 4 (1987), 289–308.
Kunen K. Signed Data Dependencies in Logic Programs. University of Wisconsin. To appear.
Lloyd J.W. Foundations of Logic Programming. Second Edition, Springer-Verlag, Symbolic Computation Series, 1987.
Lloyd J.W. and Topor R.W. A Basis for Deductive Database Systems II. J. Logic Programming 3, 1 (1986), 55–67.
Mannila H. and Ukkonen E. Flow Analysis of Prolog Programs. 4th Int. Symp. on Logic Programming, San Francisco, 1987, 205–214.
Mellish C.S. Abstract Interpretation of Prolog Programs. Third Int. Conf. on Logic Programming, London, 1986, 463–474.
Shepherdson J.C. Negation in Logic Programming. Foundations of Deductive Databases and Logic Programming (J. Minker Ed.), Morgan Kaufman, Los Altos, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barbuti, R., Martelli, M. (1989). A tool to check the non-floundering logic programs and goals. In: Deransart, P., Lorho, B., Małuszyński, J. (eds) Programming Languages Implementation and Logic Programming. PLILP 1988. Lecture Notes in Computer Science, vol 348. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50820-1_40
Download citation
DOI: https://doi.org/10.1007/3-540-50820-1_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50820-5
Online ISBN: 978-3-540-46092-3
eBook Packages: Springer Book Archive