Characterizing D-WFS: Confluence and iterated GCWA

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

Volumn 1126, Issue , 1996, Pages 268-283

  Brass, Stefan ^a   Dix, Jürgen ^b  

^a LEIBNIZ UNIVERSITY HANNOVER   (Germany)

^b Department of Computer Science ^*  (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; LOGIC PROGRAMMING; SEMANTICS;

DISJUNCTIVE LOGIC PROGRAMS; EFFICIENT IMPLEMENTATION; MINIMAL MODEL; MONOTONIC OPERATORS; NON-TRIVIAL; NORMAL FORM; RESIDUAL PROGRAMS; WELL FOUNDED SEMANTICS;

CALCULATIONS;

EID: 84955615311     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (25)

1. K. R. Apt and Roland N. Bot. Logic Programming and Negation: A Survey. Journal of Logic Programming, 19-20:9-71, 1994.
2. Stefan Brass and Jürgen Dix. Computing Disjunctive Stable Semantics based on Clark's Completed Database. In Proc. of the 6th GI-Workshop “Grundlagen yon Datenbanken”, Bad Helmstedt, September 1994, pages 30-34, 1994.
3. Stefan Brass and Jürgen Dix. A disjunctive semantics based on unfolding and bottom-up evaluation. In Bernd Wolfmger, editor, Innovationen bei Rechen- und Kommunikationssystemen, (IFIP '94-Congress, Workshop FG2: Disjunctive Logic Programming and Disjunctive Databases), pages 83-91, Berlin, 1994. Springer.
4. Stefan Brass and Jürgen Dix. A General Approach to Bottom-Up Computation of Disjunctive Semantics. In J. Dix, L. Pereira, and T. Przymusinski, editors, Nonmonotonic Extensions of Logic Programming, LNAI 927, pages 127-155. Springer, Berlin, 1995.
5. Stefan Brass and Jfirgen Dix. Characterizations of the Stable Semantics by Partial Evaluation. In A. Nerode, W. Marek, and M. Truszczyfiski, editors, Logic Programming and Non-Monotonic Reasoning, Proceedings of the Third International Conference, LNCS 928, pages 85-98, Berlin, June 1995. Springer.
6. Stefan Brass and Jurgen 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.
7. Nicole Bidoit and Richard Hull. Positivism vs. minimalism in deductive databases. In Proc. of the 5th ACM Symp. on Principles of Database Systems (PODS'86), pages 123-132, 1986.
8. C. Baral, J. Lobo, and J. Minker. Generalized Disjunctive Well-founded Semantics for Logic Programs: Declarative Semantics. In Z.W. Ras, M. Zemankova, and M.L Emrich, editors, Proceedings of the 5th Int. Symp. on Methodologies for Intelligent Systems, Knoxville, TN, October 1990, pages 465-473. North-Holland, 1990.
9. C. Baral, J. Lobo, and J. Minker. WF3: A Semantics for Negation in Normal Disjunctive Logic Programs. In Z.W. Ras and M. Zemankova, editors, Methodologies for Intelligent Systems, LNAI 542, pages 459-468, Berlin, 1991. Springer.
10. K. L. Clark. Negation as Failure. In H. Gallairc and J. Minker, editors, Logic and Data-Bases, pages 293-322. Plenum, New York, 1978.
11. Jürgen Dix. A Classification-Theory of Semantics of Normal Logic Programs: II. Weak Properties. Fundamenta Informaticae, XXII(3):257-288, 1995.
12. Jürgen Dix. Semantics of Logic Programs: Their Intuitions and Formal Properties. An Overview. In Andre Fuhrmann and Hans Rott, editors, Logic, Action and Information - Essays on Logic in Philosophy and Artificial Intelligence, pages 241-327. DeGruyter, 1995.
13. Michael Gelfond and Vladimir Lifechitz. Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing, 9:365-387, 1991. (Extended abstract appeared in: Logic Programs with Classical Negation. Proceedings of the 7-th International Logic Programming Confcrcnce, Jerusalem, pages 579-597, 1990. MIT Press.).
14. Jorge Lobo, Jack Minker, and Arcot Rajasekar. Foundations of Disjunctive Logic Programming. MIT-Press, 1992.
15. Jack Minker. On indefinite databases and the closed world assumption. In Proceedings of the 6th Conference on Automated Deduction, New York, pages 292-308, Berlin, 1982. Springer.
16. Jack Minker. An Overview of Nonmonotonic Reasoning and Logic Programming. Journal of Logic Programming, Special Issue, 17, 1993.
17. Teodor Przymusinski. Stable Semantics for Disjunctive Programs. New Generation Computing Journal, 9:401-424, 1991. (Extended abstract appeared in: Extended stable semantics for normal and disjunctive logic programs. Proceedings of the 7-th International Isogic Programming Conference, Jerusalem, pages 459-477, 1990. MIT Press, Cambridge, Mass.).
18. Teodor Przymusinski. Stationary Semantics for Normal and Disjunctive Logic Programs. In C. Delobel, M. Kifer, and Y. Masunaga, editors, DOOD’91, Proceedings of the 2nd International Conference, Berlin, December 1991. Muenchen, Springer. LNCS 566.
19. Teodor Przymusinski. Static Semantics For Normal and Disjunctive Logic Programs. Annnlis of Mathematics and Artificial Intelligence, Special Issue on Disjunctive Programs, 1995. to appear.
20. Arcot Rajasekar, Jorge Lobo, and Jack Minker. Weak Generalized Closed World Assumption. Journal of Automated Reasoning, 5:293-307, 1989.
21. Kenneth A. Ross. The well-founded semantics for disjunctive logic programs. In Proceedings of the first International Conference on Deductive and Object Oriented Databases, Kyoto, Japan, pages 1-22, 1989.
22. Kenneth A. Ross and Rodney A. Topor. Inferring negative Information from disjunctive Databases. Journal of Automated Reasoning, 4:397-424, 1988.
23. Chiaki Sakama and Hirohisa Seki. Partial Deduction of Disjunctive Logic Programs: A Declarative Approach. In Logic Program Synthesis and Transformation - Meta Programming in Logic, LNCS 883, pages 170-182, Berlin, 1995. Springer.
24. 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.
25. Jia-Huai You and Li-Yan Yuan. A three-valued semantics for deductive databases and logic programs. Journal of Computer and System Sciences, 49(2):334-361, 1994.