Abstract
The paper presents a new approach to the problem of completeness of the SLDNF-resolution. We propose a different reference theory that we call strict completion. This new concept of completion (comp*(P)) is based on a program transformation that given any program transforms it into a strict one (with the same computational behaviour) and the usual notion of program completion. We consider it a reasonable reference theory to discuss program semantics and completeness results. The standard 2-valued logic is used. The new comp*(P) is always consistent and the completeness of all allowed programs and goals w.r.t. comp*(P) is proved.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aquilano, C., Barbuti, R., Bocchetti, P., and Martelli, M., “Negation as Failure: Completeness of the Query Evaluation Process for Horn Clause Programs with Recursive Definitions,”Journal of Automated Reasoning, 2, pp. 155–170, 1986.
Apt, K. R., “Introduction to Logic Programming,”Handbook of Theoretical Computer Science (J. van Leeuwen ed.), Elsevier Sc. Pub., pp. 493–574, 1990.
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 Kaufmann, Los Altos, pp. 89–148, 1988.
Barbuti, R. and Martelli, M., “Completeness of the SLDNF-resolution for a Class of Logic Programs,”Proc. 3rd Int. Conf. on Logic Programming, LNCS 225, Springer Verlag, pp. 600–614, 1986.
Barbuti, R. and Martelli, M., “Programming in a Generally Functional Style to Design Logic Databases,”Int. Rep. of CASE Center, Syracuse University, 1985. AlsoProc. Workshop on Foundations of Deductive Databases and Logic Programming, Washington, 1986.
Barbuti, R. and Martelli, M., “Recognizing Non-floundering Logic Programs and Goals,”Int. Journal of Foundations of Computer Science, 1, 2, pp. 151–163, 1990.
Cavedon, L. and Lloyd, J. W., “A Completeness Theorem for SLDNF-resolution,”J. Logic Programming, 7, 4, pp. 177–193, 1989.
Clark, K. L., “Negation as Failure,”Logic and Data Bases (H. Gallaire and J. Minker eds.), Plenum Press, New York, pp. 293–322, 1978.
Fitting, M., “A Kripke-Kleene Semantics for Logic Programs,”J. Logic Programming, 2, 4, pp. 295–312, 1985.
Jaffar, J., Lassez, J-L., and Lloyd J. W., “Completeness of the Negation as Failure Rule,”IJCAI 83, Karlsruhe, pp. 500–506, 1983.
Kunen, K., “Negation in Logic Programming,”J. Logic Programming, 4, 4, pp. 289–308, 1987.
Kunen, K., “Signed Data Dependencies in Logic Programs,”J. Logic Programming, 7, 4, pp. 231–245, 1989.
Lloyd, J. W.,Foundations of Logic Programming, Second Edition, Symbolic Computation Series, Springer-Verlag, 1987.
Lloyd, J. W. and Topor, R. W., “A Basis for Deductive Database Systems II,”J. Logic Programming, 3, 1, pp. 55–67, 1986.
Shepherdson, J. C., “Negation as Failure: A Comparison of Clark’s Completed Data Base and Reiter’s Closed Word Assumption,”J. Logic Programming, 1, 1, pp. 51–79, 1984.
Shepherdson, J. C., “Negation as Failure II,”J. Logic Programming, 2, 3, pp. 185–202, 1985.
Shepherdson, J. C., “Negation in Logic Programming,”Foundations of Deductive Databases and Logic Programming (J. Minker ed.), Morgan Kaufmann, Los Altos, pp. 19–88, 1988.
Author information
Authors and Affiliations
About this article
Cite this article
Drabent, W., Martelli, M. Strict completion of Logic Programs. New Gener Comput 9, 69–79 (1991). https://doi.org/10.1007/BF03037151
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF03037151