Autoepistemic logic of knowledge and beliefs

Artificial Intelligence

Volumn 95, Issue 1, 1997, Pages 115-154

  Przymusinski, Teodor C ^a  

^a University of California ^*  (United States)

Author keywords

Logics of knowledge and beliefs; Nonmonotonic reasoning; Semantics of logic programs and deductive databases

Indexed keywords

COMPUTER SOFTWARE; DATABASE SYSTEMS; MATHEMATICAL MODELS;

AUTOEPISTEMIC LOGIC; LOGIC OF KNOWLEDGE AND BELIEFS; NONMONOTOMIC REASONING; SEMANTICS OF LOGIC PROGRAMS;

KNOWLEDGE REPRESENTATION;

EID: 0031198621     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(97)00032-5     Document Type: Article

References (38)

1. J.J. Alferes and L.M. Pereira, On logic program semantics with two kinds of negation, in: K. Apt, ed., Proceedings International Joint Conference and Symposium on Logic Programming (MIT Press, Cambridge, MA, 1992) 574-588.
2. J.J. Alferes, L.M. Pereira and T.C. Przymusinski, Belief revision in logic programming and nonmonotonic reasoning, in: Progress in AI, Proceedings International Artificial Intelligence Conference (EPIA-95), Madeira, Portugal (1995) 41-56.
3. J.J. Alferes, L.M. Pereira and T.C. Przymusinski, Belief revision in logic programming and nonmonotonic reasoning, Fund. Inform. 28 (1-2) (1996) 1-2.
4. J.J. Alferes, L.M. Pereira and T.C. Przymusinski, 'Classical' negation in non-monotonic reasoning, J. Automated Reasoning, to appear.
5. J.J. Alferes, L.M. Pereira and T.C. Przymusinski, Symmetric negation in non-monotonic reasoning, in: Proceedings International Conference on Artificial Intelligence and Mathematics (AI&Math-96) (1996) 1-4.
6. J.J. Alferes, L.M. Pereira and T.C. Przymusinski, Strong and explicit negation in nonmonotonic reasoning and logic programming, in: J.J. Alferes, L.M. Pereira and E. Orlowska, eds., Logic in Artificial Intelligence: Proceedings European Workshop (JELIA-96), Lecture Notes in Artificial Intelligence, Vol. 1126 (Springer, Berlin, 1996) 143-163.
7. S. Brass and J. Dix, Disjunctive semantics based upon partial and bottom-up evaluation, in: L. Sterling, ed., Proceedings 12th International Conference on Logic Programming (MIT Press, Cambridge, MA, 1995).
8. S. Brass, J. Dix, I. Niemela and T.C. Przymusinski, A comparison of the static and disjunctive well-founded semantics, in: Proceedings International Logic Programming Symposium (ILPS-97), to appear.
9. S. Brass, J. Dix and T.C. Przymusinski, Super logic programs, in: Proceedings International Conference on Principles of Knowledge Representation and Reasoning (KR-96), Vancouver, BC (Morgan Kaufmann, San Mateo, CA, 1996) 529-541.
10. M. Gelfond, Logic programming and reasoning with incomplete information, Tech. Rept., University of Texas at El Paso, TX (1992).
11. M. Gelfond and V. Lifschitz, The stable model semantics for logic programming, in: R. Kowalski and K. Bowen, eds., Proceedings 5th Logic Programming Symposium (MIT Press, Cambridge, MA, 1988) 1070-1080.
12. M. Gelfond and V. Lifschitz, Logic programs with classical negation, in: Proceedings 7th International Logic Programming Conference, Jerusalem, Israel (MIT Press, Cambridge, MA, 1990) 579-597.
13. M. Gelfond, H. Przymusinski and T.C. Przymusinski, On the relationship between circumscription and negation as failure, Artificial Intelligence 38 (1989) 75-94.
14. J.F. Horty, R.H. Thomason and D.S. Touretzky, A skeptical theory of inheritance in non-monotonic semantic nets, in: Proceedings AAAI-87, Seattle, WA (Morgan Kaufmann, Los Altos, CA, 1987).
15. V. Lifschitz, Computing circumscription, in: Proceedings IJCAI-85, Los Angeles, CA (Morgan Kaufmann, Los Altos, CA, 1985) 121-127.
16. V. Lifschitz, Minimal belief and negation as failure, Artificial Intelligence 70 (1994) 53-72.
17. J. Lobo, J. Minker and A. Rajasekar, Foundations of Disjunctive Logic Programming (MIT Press, Cambridge, MA, 1992).
18. J. McCarthy, Circumscription - a form of non-monotonic reasoning, Artificial Intelligence 13 (1980) 27-39.
19. J. Minker, On indefinite data bases and the closed world assumption, in: Proceedings 6th Conference on Automated Deduction (Springer, New York, 1982) 292-308.
20. R.C. Moore, Semantic considerations on nonmonotonic logic, Artificial Intelligence 25 (1985) 75-94.
21. W. Marek, Stable theories in autoepistemtc logic, Fund. Inform. 12 (1989) 243-254.
22. W. Marek and M. Truszczynski, Non-Monotoniec Logic (Springer, Berlin, 1994).
23. H. Przymusinska and T.C. Przymusinski, Semantic issues in deductive databases and logic programs, in: R. Banerji, ed., Formal Techniques in Artificial Intelligence (North-Holland, Amsterdam, 1990) 321-367.
24. T.C. Przymusinski, On the declarative semantics of deductive databases and logic programs, in: J. Minker, ed., Foundations of Deductive Databases and Logic Programming (Morgan Kaufmann, Los Altos, CA, 1988) 193-216.
25. T.C. Przymusinski, Autoepistemic logics of closed beliefs and logic programming, in: A. Nerode, W. Marek and V.S. Subrahmanian, eds., Proceedings 1st International Workshop on Logic Programming and Non-Monotonic Reasoning, Washington, DC (MIT Press, Cambridge, MA, 1991) 3-20. ]
26. T.C. Przymusinski, Stable semantics for disjunctive programs, New Generation Computing J. 9 (1991) 401-424; extended abstract appeared as: Extended stable semantics for normal and disjunctive logic programs, in: Proceedings 7th International Logic Programming Conference, Jerusalem, Israel (MIT Press, Cambridge, MA, 1990) 459-477.
27. T.C. Przymusinski, Stable semantics for disjunctive programs, New Generation Computing J. 9 (1991) 401-424; extended abstract appeared as: Extended stable semantics for normal and disjunctive logic programs, in: Proceedings 7th International Logic Programming Conference, Jerusalem, Israel (MIT Press, Cambridge, MA, 1990) 459-477.
28. T.C. Przymusinski, Three-valued nonmonotonic formalisms and semantics of logic programs, Artificial Intelligence 49 (1991) 309-343; extended abstract appeared as: Three-valued non-monotonic formalisms and logic programming, in: Proceedings 1st International Conference on Principles of Knowledge Representation and Reasoning (KR-89), Toronto, Ont. (Morgan Kaufmann, Los Altos, CA, 1989) 341-348.
29. T.C. Przymusinski, Three-valued nonmonotonic formalisms and semantics of logic programs, Artificial Intelligence 49 (1991) 309-343; extended abstract appeared as: Three-valued non-monotonic formalisms and logic programming, in: Proceedings 1st International Conference on Principles of Knowledge Representation and Reasoning (KR-89), Toronto, Ont. (Morgan Kaufmann, Los Altos, CA, 1989) 341-348.
30. T.C. Przymusinski, Semantics of normal and disjunctive logic programs: a unifying framework, in: J. Dix, L.M. Pereira and T.C. Przymusinski, eds., Proceedings Workshop on Non-Monotonic Extensions of Logic Programming at the 11th International Logic Programming Conference (ICLP-95), Santa Margherita Ligure, Italy, 1994 (Springer, Berlin, 1995) 43-67.
31. T.C. Przymusinski, Static semantics for normal and disjunctive logic programs, Ann. Math. Artif. Intell. (Special Issue on Disjunctive Programs) 14 (1995) 323-357.
32. T.C. Przymusinski, Epistemic specifications as theories of knowledge and belief, University of California at Riverside, in preparation.
33. R. Reiter, On closed-world data bases, in: H. Gallaire and J. Minker, eds., Logic and Data Bases (Plenum Press, New York, 1978) 55-76.
34. A. Rajasekar, J. Lobo and J. Minker, Weak generalized closed world assumption, J. Automated Reasoning 5 (1989) 293-307.
35. K. Ross and R. Topor, Inferring negative information from disjunctive databases, J. Automated Reasoning 4 (1988) 397-424.
36. A. van Gelder, K.A. Ross and J.S. Schlipf, The well-founded semantics for general logic programs, J. ACM (1990) to appear; preliminary abstract appeared in: Proceedings 7th ACM Symposium on Principles of Database Systems (1988) 221-230.
37. A. van Gelder, K.A. Ross and J.S. Schlipf, The well-founded semantics for general logic programs, J. ACM (1990) to appear; preliminary abstract appeared in: Proceedings 7th ACM Symposium on Principles of Database Systems (1988) 221-230.
38. L. Yuan and J. You, Autoepistemic circumscription and logic programming, Tech. Rept. TR92-18, Department of Computing Science, University of Alberta, Edmonton, Alta. (1992); also: J. Automated Reasoning, to appear.