Abstract
The three most well-known semantics for negation in the logic programming framework are Clark’s completion [Cla78], the stable semantics [GL88], and the well-founded semantics [vGRS91]. Clark’s completion (COMP) was the first proposal to give a formal meaning to negation as failure. However, it is now accepted that COMP does not always captures the meaning of a logic program. Despite its computational and structural advantages, the well-founded semantics (WFS) is considered much too weak for real applications. The stable semantics (STABLE), on the other hand, is so strong that many programs become inconsistent. We present in this paper examples to support these claims, and we introduce a new semantics, called CWFS, which is as powerful as COMP in inferring positive literals and as powerful as WFS in inferring negative literals. Due to its particular construction, CWFS helps to understand the relationship among COMP, WFS, and STABLE. We also discuss some implementation issues of CWFS.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
ABW88. Krzysztof R. Apt, Howard A. Blair, and Adrian Walker. Towards a theory of declarative knowledge. In Jack Minker, editor, Foundations of Deductive Databases, chapter 2, pages 89–148. Morgan Kaufmann, 1988. 234
AB94. Krzysztof R. Apt, and Roland N. Bol Logic Programming and Negation: A Survey. Journal of Logic Programming, 19,20:9–71, 1994 231, 234
BD95. Stefan Brass and Jürgen Dix. Disjunctive Semantics based upon Partial and Bottom-Up Evaluation. In Leon Sterling, editor, Proceedings of the 12th Int. Conf. on Logic Programming, Tokyo, pages 199–213. MIT Press, June 1995. 239
BD97. Stefan Brass and Jürgen Dix. Characterizations of the Disjunctive Stable Semantics by Partial Evaluation. Journal of Logic Programming, 32(3):207–228, 1997. (Extended abstract appeared in: Characterizations of the Stable Semantics by Partial Evaluation LPNMR, Proceedings of the Third International Conference, Kentucky, pages 85–98, 1995. LNCS 928, Springer.). 236
BD96b. Gerhard Brewka and Jürgen Dix. Knowledge representation with logic programs. Technical report, Tutorial Notes of the 12th European Conference on Artificial Intelligence (ECAI’ 96), 1996. Also appeared as Technical Report 15/96, Dept. of CS of the University of Koblenz-Landau. Will appear as Chapter 6 in Handbook of Philosophical Logic, 2nd edition (1998), Volume 6, Methodologies. 230, 235
BNNS93. C. Bell, A. Nerode R. Ng, and V.S. Subrahamanian Implementing Stable Semantics by Linear Programming. in L. M. Pereida and A. Nerode editors Logic Programming and Nonmonotonic Reasoning, pages 23–42, MIT Press 1993. 239
BG94. Chitta Baral and Michael Gelfond. Logic Programming and Knowlege Representation. Journal of Logic Programming, 19–20, 1994. 230, 234, 235
BZF97. Stefan Brass, Ulrich Zukowski, and Burkhardt Freitag. Transformation Based Bottom-Up Computation of the Well-Founded Model. In J. Dix, L. Pereira, and T. Przymusinski, editors, Nonmonotonic Extensions of Logic Programming, LNAI 1216, pages 171–201. Springer, Berlin, 1997. 236, 237, 239
BZF97a. Stefan Brass, Ulrich Zukowski, and Burkhardt Freitag. Improving the Alternating Fixpoint: The Transformation Approach. In J. Dix, U. Furbach, and A. Nerode, editors, Logic Programming and Nonmonotonic Reasoning, LNAI 1265, pages 40–59. Springer, Berlin, 1997. 239
Cla78. Keith L. Clark. Negation as Failure. In H. Gallaire and J. Minker, editors, Logic and Data-Bases, pages 293–322. Plenum, New York, 1978. 230, 237
BLM90. Chitta Baral, Jorge Lobo, and Jack Minker. Genelalized Well-founded Semantics for Logic Programs. In M. E. Stickel. editor. 10th International Conference on Automated Deduction, LNAI 449, subseries LNCS, pages1102–116. Springer, J. Siekmann, July 1990. 231
Dix95a. Jürgen Dix. A Classification-Theory of Semantics of Normal Logic Programs: I. Strong Properties. Fundamenta Informaticae, XXII(3):227–255, 1995. 231, 232, 235, 236
DO97b. Jürgen Dix and Mauricio Osorio Provability Closures in Logic Programming. Proc. of the International Symposium of Computer Science in Mexico, Instituto Politecnico Nacional editors, 1997. 235
DO97c. Jose Arrazola, Jürgen Dix and Mauricio Osorio Confluence Rewriting Systems for Logic Programming Semantics. Research Report 27-97. University of Koblenz, Germany. 235
Dun95. P. M. Dung. An Argumentation-theoric Foundation for Logic Progamming The Journal of Logic Programing, 151–177, 1995. 231, 232
GL88. Michael Gelfond and Vladimir Lifschitz. The Stable Model Semantics for Logic Programming. In R. Kowalski and K. Bowen, editors, 5th Conference on Logic Programming, pages 1070–1080. MIT Press, 1988. 230, 231, 234
HL94. P. M. Hill and J. W. Lloyd The Gödel Programming Language. MIT Press, 1994. 235
JOM95. B. Jayaraman, M. Osorio and K. Moon, “Partial Order Programming (revisited)”, Proc. AMAST, LNCS 936, pages 561–575. Springer-Verlag, July 1995. 232
Llo87. John W. Lloyd. Foundations of Logic Programming. Springer, Berlin, 1987. 2nd edition. 230, 233, 235, 239
Nai86. L. Naish. Negation and Quantifiers in NU-Prolog. in Proc. of the Third Int. Conf. on Logic Programming, LNCS 225, pages 624–634. Springer-Verlag, 1986. 235
OJ96. Mauricio Osorio and Bharat Jayaraman. Towards a Broader Basis for Logic Programming Memorias de IBERAMIA 96, Cholula, Mexico, 1996. 232
OJ97. Mauricio Osorio and Bharat Jayaraman. Aggregation and WFS+. In J. Dix, L. Pereira, and T. Przymusinski, editors, Nonmonotonic Extensions of Logic Programming, LNAI 1216, pages 71–90. Springer, Berlin, 1997. 232, 239
Pet97. Vyacheslav Petukhin Programs with Universally Quantified Embedded Implications. In J. Dix, U. Furbach, and A. Nerode, editors, Logic Programming and Nonmonotonic Reasoning, LNAI 1265, pages 309–323. Springer, Berlin, 1997. 235
Sch92. John S. Schlipf. Formalizing a Logic for Logic Programming. Annals of Mathematics and Artificial Intelligence, 5:279–302, 1992. 231, 232
Sch92a. John S. Schlipf. Logics for Negation as Failure. Logic for Computer Science, MSRI Publications 21, Springer-Verlag 1992. 233
vGRS91. Allen van Gelder, Kenneth A. Ross, and John S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38:620–650, 1991. 230, 231, 234, 235
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Osorio, M., Jayaraman, B. (1998). Integrating the Completion and the Well Founded Semantics. In: Coelho, H. (eds) Progress in Artificial Intelligence — IBERAMIA 98. IBERAMIA 1998. Lecture Notes in Computer Science(), vol 1484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49795-1_20
Download citation
DOI: https://doi.org/10.1007/3-540-49795-1_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64992-2
Online ISBN: 978-3-540-49795-0
eBook Packages: Springer Book Archive