Abstract
A new completion theory for logic programming called strong completion, is introduced. Similar to the Clark's completion, the strong completion can be interpreted either in two-valued or three-valued logic. We show that
-
⋆Two-valued strong completion specifies the stable semantics.
-
⋆Three-valued strong completion specifies the well-founded semantics.
Since the strong completion of a logic program P is also a circumscription of P, the open problem as whether or not there exists a circumscriptive specification of a logic program P which specifies the stable semantics as well as the well-founded semantics of P, is solved.
We show that the call-consistency condition is sufficient for a logic program to have a stable model. Further we prove that the stable semantics is equivalent to the well-founded semantics if the program is strict and call-consistent.
Keywords
Institute of Computer Science, National Center for Scientific Research of Vietnam, Lieugiai, Badinh, Hanoi, Vietnam.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Apt K.R., Blair H.A., Walker A., ‘Towards a Theory of Declarative Knowledge'. In ‘Foundations of Deductive Databases and Logic Programing’ J. Minker (ed.) 1988
Chang,C.L., Lee,R.C. 'symbolic Logic and Mechanical Theorem Proving’ Academic Press, 1973
Clark, K.L. ‘Negation as Failure'. In ‘Logic and Database', Gallaire H., Minker J. (eds), Plenum, New York, 1978
Cholak P., ‘Post Corresponding Problems and Prolog Programs'. Technical Report, University of Wisconsin, 1988
Fitting M. ‘A Kripke-Kleene semantics for logic programs’ J. Logic programming, 1985, 2, 295–312.
Van Gelder A., Ross K., Schlipf J.S. ‘Unfounded sets and well-founded semantics for general logic programs'. In PODS, 1988
Gelfond M.,Lifschitz V. ‘The stable model semantics for logic programs’ in Proc. of the 5th Int Conf/Sym on Logic Programming, MIT Press, 1988
Kunen K. 'signed data dependencies in logic programming’ J. of Logic Programming, 1989, 231–245
Lloyd J.W. ‘Foundations of Logic Programming', Second edition, Springer Verlag, 1987
Marek W., Truszczynski M. 'stable semantics for logic programs and default theories’ Proc. of NACLP89, Cleveland Ohio 1989, USA
Phan Minh Dung, ‘On first-order definability of stable semantics of logic programs'. Technical Report, March 1990, Division of Computer Science, Asian Institute of Technology.
Phan Minh Dung, 'strong Completion of Logic programs'. Technical report, April 1990, Division of Computer Science, Asian Institute of Technology
Phan Minh Dung, 'strong circumscription specifies the stable semantics of logic programs’ in Proc. of European Conference on Artificial Intelligence 90, Stockholm, August, 1990
Phan Minh Dung, Kanchana Kanchanasut, ‘A fixpoint approach to declarative semantics of logic programs'. In Proc. of North American Conference on Logic Programming Cleveland Ohio, 1989, MIT Press
Phan Minh Dung, Kanchana Kanchanasut, ‘A natural semantics of logic programs with negations'. In Proc of Conf on Foundations of Software Technology & Theoretical Computer Science 1989, India, Lecture Notes of Computer Science 405, Springer Verlag
Przymusinski T.C., ‘On the Declarative Semantics of Deductive Databases and Logic Programs’ in ‘Foundations of Deductive Databases & Logic Programming', J. Minker (ed.) 1988
Przymusinski T.C. ‘Perfect model semantics'. In Proc. of Fifth ICLP, USA
J. McCarthy, ‘Applications of Circumscription to Formalizing Common-Sense Knowledge’ Artificial Intelligence 28 (1986)
Ross K.A., ‘A procedural semantics for well-founded negation in logic programming', Technical report, Stan-CS-88-1213, Standford, Computer Science Department
Sato T., ‘On consistency of first order logic programs’ Technical report TR 87-12, Electrotechnical Laboratory
Shepherdson J.C., ‘Negation in logic programming’ In Foundations of Deductive Databases & Logic Programming, J. Minker (ed.) 1988
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dung, P.M. (1990). On the strong completion of logic programs. In: Kirchner, H., Wechler, W. (eds) Algebraic and Logic Programming. ALP 1990. Lecture Notes in Computer Science, vol 463. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53162-9_37
Download citation
DOI: https://doi.org/10.1007/3-540-53162-9_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53162-3
Online ISBN: 978-3-540-46738-0
eBook Packages: Springer Book Archive