On the strong completion of logic programs
Conference paper
First Online:
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 twovalued or threevalued logic. We show that

⋆Twovalued strong completion specifies the stable semantics.

⋆Threevalued strong completion specifies the wellfounded 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 wellfounded semantics of P, is solved.
We show that the callconsistency condition is sufficient for a logic program to have a stable model. Further we prove that the stable semantics is equivalent to the wellfounded semantics if the program is strict and callconsistent.
Keywords
Logic programming negation predicate completion stable models wellfounded models circumscription twovalued logic threevalued logicPreview
Unable to display preview. Download preview PDF.
References
 [ABW]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.) 1988Google Scholar
 [CL]Chang,C.L., Lee,R.C. 'symbolic Logic and Mechanical Theorem Proving’ Academic Press, 1973Google Scholar
 [CK]Clark, K.L. ‘Negation as Failure'. In ‘Logic and Database', Gallaire H., Minker J. (eds), Plenum, New York, 1978Google Scholar
 [Ch]Cholak P., ‘Post Corresponding Problems and Prolog Programs'. Technical Report, University of Wisconsin, 1988Google Scholar
 [F]Fitting M. ‘A KripkeKleene semantics for logic programs’ J. Logic programming, 1985, 2, 295–312.Google Scholar
 [GRS]Van Gelder A., Ross K., Schlipf J.S. ‘Unfounded sets and wellfounded semantics for general logic programs'. In PODS, 1988Google Scholar
 [GL]Gelfond M.,Lifschitz V. ‘The stable model semantics for logic programs’ in Proc. of the 5th Int Conf/Sym on Logic Programming, MIT Press, 1988Google Scholar
 [K]Kunen K. 'signed data dependencies in logic programming’ J. of Logic Programming, 1989, 231–245Google Scholar
 [L]Lloyd J.W. ‘Foundations of Logic Programming', Second edition, Springer Verlag, 1987Google Scholar
 [MT]Marek W., Truszczynski M. 'stable semantics for logic programs and default theories’ Proc. of NACLP89, Cleveland Ohio 1989, USAGoogle Scholar
 [P1]Phan Minh Dung, ‘On firstorder definability of stable semantics of logic programs'. Technical Report, March 1990, Division of Computer Science, Asian Institute of Technology.Google Scholar
 [P2]Phan Minh Dung, 'strong Completion of Logic programs'. Technical report, April 1990, Division of Computer Science, Asian Institute of TechnologyGoogle Scholar
 [P3]Phan Minh Dung, 'strong circumscription specifies the stable semantics of logic programs’ in Proc. of European Conference on Artificial Intelligence 90, Stockholm, August, 1990Google Scholar
 [PK1]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 PressGoogle Scholar
 [PK2]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 VerlagGoogle Scholar
 [PT1]Przymusinski T.C., ‘On the Declarative Semantics of Deductive Databases and Logic Programs’ in ‘Foundations of Deductive Databases & Logic Programming', J. Minker (ed.) 1988Google Scholar
 [PT2]Przymusinski T.C. ‘Perfect model semantics'. In Proc. of Fifth ICLP, USAGoogle Scholar
 [M]J. McCarthy, ‘Applications of Circumscription to Formalizing CommonSense Knowledge’ Artificial Intelligence 28 (1986)Google Scholar
 [R]Ross K.A., ‘A procedural semantics for wellfounded negation in logic programming', Technical report, StanCS881213, Standford, Computer Science DepartmentGoogle Scholar
 [S]Sato T., ‘On consistency of first order logic programs’ Technical report TR 8712, Electrotechnical LaboratoryGoogle Scholar
 [SJ]Shepherdson J.C., ‘Negation in logic programming’ In Foundations of Deductive Databases & Logic Programming, J. Minker (ed.) 1988Google Scholar
Copyright information
© SpringerVerlag Berlin Heidelberg 1990