Integrating the completion and the well founded semantics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1484, Issue , 1998, Pages 230-241

  Osorio, Mauricio ^a   Jayaraman, Bharat ^b  

^a UNIVERSIDAD DE LAS AMÉRICAS PUEBLA   (Mexico)

^b the State University of New York   (United States)

Author keywords

Clark s completion; Knowledge representation; Logic programming; Non monotonic reasoning; Normal programs; Stable semantics; Well Founded semantics

Indexed keywords

COMPUTATION THEORY; COMPUTER CIRCUITS; KNOWLEDGE REPRESENTATION; LOGIC PROGRAMMING;

LOGIC PROGRAMS; NEGATION AS FAILURES; NEGATIVE LITERALS; NON-MONOTONIC REASONING; REAL APPLICATIONS; STABLE SEMANTICS; STRUCTURAL ADVANTAGE; WELL FOUNDED SEMANTICS;

SEMANTICS;

EID: 84948976896     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49795-1_20     Document Type: Conference Paper

References (26)

1. 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
2. Krzysztof R. Apt, and Roland N. Bol Logic Programming and Negation: A Survey. Journal of Logic Programming, 19,20:9-71, 1994 231, 234
3. Stefan Brass and Jürgen Dix. Disjunctive Semantics based upon Partial and Bottom-Up Evaluation. In Leon Sterling, editor, Proceedings of the12th Int. Conf. on Logic Programming, Tokyo, pages 199-213. MIT Press, June 1995. 239
4. 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
5. 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
6. 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
7. Chitta Baral and Michael Gelfond. Logic Programming and Knowlege Representation. Journal of Logic Programming, 19-20, 1994. 230, 234, 235
8. 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
9. 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
10. 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
11. 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
12. Jürgen Dix. A Classification-Theory of Semantics of Normal Logic Programs: I. Strong Properties. Fundamenta Informaticae, 22(3):227-255,1995. 231, 232, 235, 236
13. 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
14. Jose Arrazola, Jürgen Dix and Mauricio Osorio Confluence Rewriting Systems for Logic Programming Semantics. Research Report 27-97. Universityof Koblenz, Germany. 235
15. P. M. Dung. An Argumentation-theoric Foundation for Logic Progamming The Journal of Logic Programing, 151-177, 1995. 231, 232
16. 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
17. P. M. Hill and J. W. Lloyd. The Gödel Programming Language. MIT Press, 1994. 235
18. B. Jayaraman, M. Osorio and K. Moon, "Partial Order Programming (revisited)", Proc. AMAST, LNCS 936, pages 561-575. Springer-Verlag, July 1995. 232
19. John W. Lloyd. Foundations of Logic Programming. Springer, Berlin, 1987. 2nd edition. 230, 233, 235, 239
20. 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
21. Mauricio Osorio and Bharat Jayaraman. Towards a Broader Basis for Logic Programming Memorias de IBERAMIA 96, Cholula, Mexico, 1996. 232
22. 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
23. 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
24. John S. Schlipf. Formalizing a Logic for Logic Programming. Annals of Mathematics and Artificial Intelligence, 5:279-302, 1992. 231, 232
25. John S. Schlipf. Logics for Negation as Failure. Logic for Computer Science, MSRI Publications21, Springer-Verlag 1992. 233
26. 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