Abstract
An extension of the class of logic programs for which the Negation as Failure rule is equivalent to the Closed World Assumption is presented. This extension includes programs on infinite domains and with recursive definitions. For this class of programs with ground (positive or negative) queries the Query Evaluation Process is complete. A characterization of this class of programs is given, and a decision algorithm, which recognizes a subclass of these programs, is presented. The algorithm is based on showing the correspondence between a program and a primitive recursive function.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aquilano, C. and Bocchetti, P., ‘Caratterizzazione di una teoria in clausole Horn per una deduzione completa di informazioni negative’, Master's Thesis, Dept. of Comp. Science, University of Pisa, (1985).
Asirelli, P., Barbuti, R., and Levi, G., ‘Types and declarative static type checking in logic programming’, Proc. Programming '84, Primorsko, Bulgary (1984).
Barbuti, R. and Martelli, M., ‘Programming in a generally functional style to design logic databases’, CASE Center Technical Report No. 8602, Syracuse University (1986).
ClarkK. L., Negation as Failure, inLogic and Data Bases (eds. H.Gallaire, and J.Minker), Plenum, New York, pp. 293–322 (1978).
Jaffar, J., Lassez, J.-L., and Lloyd, J. W., ‘Completeness of the Negation-as-Failure Rule’,Proc. 8th IJCAI, Karlsruhe (1983), pp. 500–506.
LassezJ.-L. and MaherM. J., Closures and fairness in the semantics of programming logic’,Theoretical Computer Science,29, 167–184, (1984).
Lloyd, J. W.,Foundations of Logic Programming, Springer-Verlag, Symbolic Computation Series, (1984).
LloydJ. W. and ToporR. W., ‘A basis for deductive data base systems’,J. Logic Programming 2, 93–109, (1985).
Mycroft, A. and O'Keefe, R., ‘A polymorphic type system for PROLOG’,Proc. Logic Programming Workshop, Portugal (1983) pp. 107–122.
ReiterR., ‘On closed world data bases’, inLogic and Data Bases, (eds. H.Gallaire, and J.Minker), Plenum, New York, 55–76, (1978).
ShepherdsonJ. C., ‘Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption.J. Logic Programming 1, 51–79, (1984).
Author information
Authors and Affiliations
Additional information
Work partially supported by Esprit Project 530 (Epsilon).
Rights and permissions
About this article
Cite this article
Aquilano, C., Barbuti, R., Bocchetti, P. et al. Negation as Failure. Completeness of the Query Evaluation Process for horn clause programs with recursive definitions. J Autom Reasoning 2, 155–170 (1986). https://doi.org/10.1007/BF02432149
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02432149