Semantics of disjunctive logic programs and deductive databases

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

Volumn 566 LNCS, Issue , 1991, Pages 85-107

  Przymusinski, Teodor C ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; INTELLIGENT DATABASES; LOGIC PROGRAMMING; SEMANTICS;

DISJUNCTIVE LOGIC PROGRAMS; FIRST ORDER; FIXED POINTS; LOGIC PROGRAMS; MINIMAL MODEL; MINIMAL MODEL SEMANTICS; PERFECT MODEL; WELL FOUNDED SEMANTICS;

OBJECT-ORIENTED DATABASES;

EID: 84959448553     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-55015-1_5     Document Type: Conference Paper

References (29)

1. K. Apt, H. Blair, and A. Walker. Towards a theory of declarative knowledge. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 89-142, Morgan Kaufmann, Los Altos, CA., 1988.
2. C. Baral, J. Lobo, and J. Minker. Generalized Disjunctive Well-Founded Semantics for Logic Programs: Declarative Semantics. Research report UMIACS TR 90-39, CS TR 2436, University of Maryland, College Park, Maryland 20742, 1989.
3. C. Baral, J. Lobo, and J. Minker. Generalized well-founded semantics for logic programs. In 10th International Conference on Automated Deduction, West Germany, 1990.
4. M. Gelfond. On stratified autoepistemic theories. In Proceedings AAAI-87, pages 207-211, American Association for Artificial Intelligence, Morgan Kaufmann, Los Altos, CA, 1987.
5. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R. Kowalski and K. Bowen, editors, Proceedings of the Fifth Logic Programming Symposium, pages 1070-1080, Association for Logic Programming, MIT Press, Cambridge, Mass., 1988.
6. M. Gelfond and V. Lifschitz. Logic Programs with Classical Negation. Research report, UT El Paso and Stanford University, 1989.
7. M. Gelfond, H. Przymusinska, and T. Przymusinski. On the relationship between circumscription and negation as failure. Journal of Artificial Intelligence, 38:75-94, 1989.
8. J. Horty, R. Thomason, and D. Touretzky. A skeptical theory of inheritance in nonmonotonic semantic nets. In Proceedings AAAI-87, page , American Association for Artificial Intelligence, Morgan Kaufmann, Los Altos, CA, 1987.
9. M. Keifer, G. Lausen, and J. Wu. Logical Foundations of Object-Oriented and Frame-Based Languages. Research report, SUNY at Stony Brook, 1990.
10. V. Lifschitz. Computing circumscription. In Proceedings IJCAI-85, pages 121-127, American Association for Artificial Intelligence, Morgan Kaufmann, Los Altos, CA, 1985.
11. J. McCarthy. Circumscription - a form of non-monotonic reasoning. Journal of Artificial Intelligence, 13:27-39, 1980.
12. J. Minker. On indefinite data bases and the closed world assumption. In Proc. 6-th Conference on Automated Deduction, pages 292-308, Springer Verlag, New York, 1982.
13. R.C. Moore. Semantic considerations on non-monotonic logic. Journal of Artificial Intelligence, 25:75-94, 1985.
14. H. Przymusinska and T. C. Przymusinski. Semantic issues in deductive databases and logic programs. In R. Banerji, editor, Formal Techniques in Artificial Intelligence, pages 321-367, North-Holland, Amsterdam, 1990.
15. T. C. Przymusinski. On the declarative semantics of stratified deductive databases and logic programs. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 193-216, Morgan Kaufmann, Los Altos, CA., 1988.
16. T. C. Przymusinski. Stationary semantics for disjunctive logic programs and deductive databases. In Proceedings of the North American Logic Programming Conference, Austin, Texas, October 1990, pages 40-59, Association for Logic Programming, MIT Press, Cambridge, Mass., 1990.
17. T. C. Przymusinski. The well-founded semantics coincides with the three-valued stable semantics. Fundamenta Informaticae, 13(4):445-464, 1990.
18. T. C. Przymusinski. Autoepistemic logics of closed beliefs and logic programming. In A. Nerode, W. Marek, and V.S. Subrahmanian, editors, Proceedings of the First International Workshop on Logic Programming and Non-monotonic Reasoning, Washington, D.C., July 1991, pages 3-20, MIT Press, Cambridge, Mass., 1991.
19. T. C. Przymusinski. Stable semantics for disjunctive programs. New Generation Computing Journal, 9, 1991.
20. October’91 issue. Abstract appeared in: T. C. Przymusinski. Extended stable semantics for normal and disjunctive logic programs. Proceedings of the 7-th International Logic Programming Conference, Jerusalem, pages 459-477, 1990. MIT Press.
21. T. C. Przymusinski. Well-founded completions of logic programs. In Proceedings of the Eigth International Logic Programming Conference, Paris, France, pages 726-744, Association for Logic Programming, MIT Press, Cambridge, Mass., 1991.
22. T. C. Przymusinski and D. S. Warren. Well-founded Semantics: Theory and Implementation. Research report, UT El Paso and SUNY at Stony Brook, 1991. (in preparation).
23. R. Reiter. On closed-world data bases. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 55-76, Plenum Press, New York, 1978.
24. A. Rajasekar, J. Lobo, and J. Minker. Weak generalized closed world assumption. Journal of Automated Reasoning, 5:293-307, 1989.
25. K. Ross. The well founded semantics for disjunctive logic programs. In Proceedings of the First International Conference on Deductive and Object Oriented Databases, pages 352-369, 1989.
26. K. Ross and R. Topor. Inferring negative information from disjunctive databases. Journal of Automated Reasoning, 4:397-424, 1988.
27. A. Van Gelder. Negation as failure using tight derivations for general logic programs. Journal of Logic Programming, 6(1):109-133, 1989.
28. Preliminary versions appeared in Third IEEE Symp. on Logic Programming (1986), and Foundations of Deductive Databases and Logic Programming, J. Minker, ed., Morgan Kaufmann, 1988.
29. A. Van Gelder, K. A. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 1990. (to appear). Preliminary abstract appeared in Seventh ACM Symposium on Principles of Database Systems, March 1988, pp. 221-230.