Logic knowledge bases with two default rules

Annals of Mathematics and Artificial Intelligence

Volumn 22, Issue 3-4, 1998, Pages 333-361

  Ruiz, Carolina ^a   Minker, Jack ^b  

^a Worcester Polytechnic Institute   (United States)

^b University of Maryland ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 27144465540     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1018951805211     Document Type: Article

References (27)

1. J.J. Alferes and L.M. Pereira, On logic program semantics with two kinds of negation, in: Proceedings of the Joint International Conference and Symposium on Logic Programming, Washington, DC, November 1992, ed. K. Apt (MIT Press, Cambridge, MA, 1992) pp. 574-588.
2. 3: A logic programming language with multiple default negations, in: Proceedings of the Fifth International Symposium on AI (December 1992).
3. C. Baral, J. Lobo and J. Minker, Generalized disjunctive well-founded semantics: Declarative semantics, in: Proceedings of the Fifth International Symposium on Methodologies for Intelligent Systems, Knoxville, TN (1990) pp. 465-473.
4. N. Bidoit, Negation in rule-based data languages: A survey, Theoretical Computer Science 78 (1991).
5. J. Dix, A classification theory of semantics of normal logic programs: I. Strong properties, Fundamenta Informaticae 22(3) (1995) 227-255.
6. J Dix, A classification theory of semantics of normal logic programs: II. Weak properties, Fundamenta Informaticae 22(3) (1995) 257-288.
7. J. Dix, Disjunctive deductive databases: theoretical foundations and operational semantics, Habilitation thesis, Institut für Informationssysteme Abteilung Wissensbasierte Systeme, Technische Universität Wien (1995).
8. J. Dix, Semantics of logic programs: Their intuitions and formal properties, An overview, in: Logic, Action and Information - Essays on Logic in Philosophy and Artificial Intelligence, eds. A. Fuhrmann and H. Rott (DeGruyter, 1995) pp. 241-327.
9. M. Gelfond, Logic programming and reasoning with incomplete information, Annals of Mathematics and Artificial Intelligence 12(1,2) (1994) 89-116.
10. M. Gelfond and V. Lifschitz, The stable model semantics for logic programming, in: Proceedings of the Fifth International Conference and Symposium on Logic Programming, Seattle, WA, August 1988, eds. R. Kowalski and K. Bowen (MIT Press, Cambridge, MA, 1988) pp. 1070-1080.
11. M. Gelfond and V. Lifschitz, Classical negation in logic programs and disjunctive databases, New Generation Computing 9 (1991) 365-385.
12. S. Kraus, D. Lehmann and M. Magidor, Nonmonotonic reasoning, preferential models and cumulative logics, Artificial Intelligence 44(1) (1990) 167-207.
13. V.W. Marek and Truszczyński, Autoepistemic logic, Journal of the ACM 38(3) (1991) 588-619.
14. J. Minker, An overview of nonmonotonic reasoning and logic programming, Journal of Logic Programming 17(2-1) (1993) 95-126.
15. J. Minker and C. Ruiz, On extended disjunctive logic programs, in: Proceedings of the Seventh International Symposium on Methodologies for Intelligent Systems, ISMIS '93, eds. J. Komorowski and Z.W. Raś, Lecture Notes in Artifical Intelligence (Springer, 1993) pp. 1-18.
16. J. Minker and C. Ruiz, Semantics for disjunctive logic programs with explicit and default negation, Fundamenta Informaticae 20(3/4) (1994) 145-192.
17. P. Pearce and G. Wagner, Logic programming with strong negation, in: Proceedings of the International Workshop on Extensions of Logic Programming, Tübingen, Germany, December 1989, ed. P. Schroeder-Heister, Lecture Notes in Artificial Intelligence (Springer, 1989) pp. 311-326.
18. T.C. Przymusinski, Stable semantics for disjunctive programs, New Generation Computing 9 (1991) 401-424.
19. T.C. Przymusinski, A knowledge representation framework based on autoepistemic logic of minimal beliefs, in: Proceedings of AAAI '94 (1994).
20. K.A. Ross, Well-founded semantics for disjunctive logic programs, in: Proceedings of the First International Conference on Deductive and Object Oriented Databases, Kyoto, Japan (1989) pp. 352-369.
21. C. Ruiz, Semantics of Knowledge Based Systems with Multiple Forms of Negation, Ph.D. thesis, Department of Computer Science, University of Maryland, College Park, MD (1996).
22. C. Ruiz and J. Minker, Computing stable and partial stable models of extended disjunctive logic programs, in: Nonmonotonic Extensions of Logic Programming, eds. J. Dix, L.M. Pereira and T.C. Przymusinski, Lecture Notes in Computer Science 927 (Springer, 1995) pp. 205-22.
23. C. Ruiz and J. Minker, Combining closed world assumptions with stable negation, Fundamenta Informaticae 32(2) (1997) 163-181.
24. J.S. Schlipf, A survey of complexity and undecidability results in logic programming, in: Informal Proceedings of the Worshop on Structural Complexity and Recursion-Theoretic Methods in Logic Programming, eds. H. Blair, V.W. Marek, A. Nerode and J. Remmel, Washington, DC (November 1992) pp. 143-164.
25. D. Seipel, J. Minker and C. Ruiz, A characterization of the partial stable models for disjunctive databases, in: Proceedings of the Fourteenth International Logic Programming Symposium (ILPS '97), ed. J. Maluszynski (MIT Press, Cambridge, MA, 1997) pp. 245-259.
26. A. Van Gelder, K.A. Ross and J.S. Schlipf, Unfounded sets and well-founded semantics for general logic programs, in: Proceedings of the Seventh ACM Symposium on Principles of Database Systems (1988) pp. 221-230.
27. A. Van Gelder, K.A. Ross and J.S. Schlipf, The well-founded semantics for general logic programs, Journal of the ACM 38(3) (1991) 620-650.