Computation of the semantics of autoepistemic belief theories

Artificial Intelligence

Volumn 112, Issue 1, 1999, Pages 233-250

  Brass, Stefan ^a   Jürgen, Dix ^b   Przymusinski, Teodor C ^c  

^a UNIVERSITY OF PITTSBURGH   (United States)

^b University of Maryland ^*  (United States)

^c University of California Riverside   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; DATABASE SYSTEMS; FORMAL LOGIC; ITERATIVE METHODS; THEOREM PROVING;

AUTOEPISTEMIC BELIEF THEORY; STATIC SEMANTICS;

KNOWLEDGE REPRESENTATION;

EID: 0033170360     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(99)00043-0     Document Type: Article

References (31)

1. S. Brass, J. Dix, A general approach to bottom-up computation of disjunctive semantics, in: J. Dix, L. Pereira, T. Przymusinski (Eds.), Nonmonotonic Extensions of Logic Programming, Lecture Notes in Artificial Intelligence, Vol. 927, Springer, Berlin, 1995, pp. 127-155.
2. S. Brass, J. Dix, Characterizations of the disjunctive stable semantics by partial evaluation, J. Logic Programming 32 (3) (1997) 207-228.
3. S. Brass, J. Dix, Characterizations of the disjunctive well-founded semantics: Confluent calculi and iterated GCWA, J. Automat. Reason. 20 (1) (1998) 143-165.
4. S. Brass, J. Dix, Semantics of (disjunctive) logic programs based on partial evaluation, J. Logic Programming 38 (3) (1999) 167-213.
5. S. Brass, J. Dix, T.C. Przymusinski, Super logic programs, in: L.C. Aiello, J. Doyle, S.C. Shapiro (Eds.), Proc. 5th International Conference on The Principles of Knowledge Representation and Reasoning (kR-96), Cambridge, MA, Morgan Kaufmann, San Francisco, CA, 1996, pp. 529-541.
6. F. Bry, Logic programming as constructivism: A formalization and its application to databases, in: Proc. 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS-89), 1989, pp. 34-50.
7. F. Bry, Negation in logic programming: A formalization in constructive logic, in: D. Karagiannis (Ed.), Information Systems and Artificial Intelligence: Integration Aspects, Berlin, Springer, 1990, pp. 30-46.
8. K.L. Clark, Negation as failure, in: H. Gallaire, J. Minker (Eds.), Logic and Data-Bases, Plenum, New York, 1978, pp. 293-322.
9. Y. Dimopoulos, B. Nebel, J. Koehler, Encoding planning problems in non-monotonic logic programs, in: Proc. 4th European Conference on Planning, Toulouse, France, September 1997, Springer, Berlin, to appear.
10. J. Dix, V.S. Subrahmanian, G. Pick, Meta-agent programs, J. Logic Programming, to appear.
11. P.M. Dung, K. Kanchansut, A fixpoint approach to declarative semantics of logic programs, in: E.L. Lusk, R.A. Overbeek (Eds.), Proc. North American Conference, Cleveland, OH, USA, MIT Press, Cambridge, MA, 1989.
12. P.M. Dung, K. Kanchansut, A natural semantics for logic programs with negation, in: E.L. Lusk, R.A. Overbeek (Eds.), Proc. 9th Conference on Foundations of Software Technology and Theoretical Computer Science, Springer, Berlin, 1989.
13. T. Eiter, V.S. Subrahmanian, G. Pick, Heterogeneous active agents, I: Semantics, Artificial Intelligence 108 (1-2) (1999) 179-255.
14. T. Eiter, V.S. Subrahmanian, Heterogeneous active agents, II: Algorithms and complexity, Artificial Intelligence 108 (1-2) (1999) 257-307.
15. M. Gelfond, V. Lifschitz, The stable model semantics for logic programming, in: R. Kowalski, K. Bowen (Eds.), Proc. 5th Conference on Logic Programming, MIT Press, Cambridge, MA, 1988, pp. 1070-1080.
16. M. Gelfond, H. Przymusinska, T. Przymusinski, On the relationship between circumscription and negation as failure, Artificial Intelligence 38 (1989) 75-94.
17. R.A. Kowalski, Predicate logic as a programming language, in: Proc. IFIP-74, North Holland, Amsterdam, 1974, pp. 569-574.
18. J. McCarthy, Circumscription: A form of nonmonotonic reasoning, Artificial Intelligence 13 (1980) 27-39.
19. J. Minker, On indefinite databases and the closed world assumption, in: Proc. 6th Conference on Automated Deduction, New York, Springer, Berlin, 1982, pp. 292-308.
20. R.C. Moore, Semantical considerations on nonmonotonic logic, Artificial Intelligence 25 (1985) 75-94.
21. I. Niemelä, P. Simons, Efficient implementation of the well-founded and stable model semantics, in: M. Maher (Ed.), Proc. Joint International Conference and Symposium on Logic Programming, Bonn, Germany, MIT Press, Cambridge, MA, 1996, pp. 289-303.
22. T.C. Przymusinski, Static semantics for normal and disjunctive logic programs, Ann. Math. Artificial Intelligence 14 (1995) 323-357. (Special Issue on Disjunctive Programs.)
23. T.C. Przymusinski, Autoepistemic logic of knowledge and beliefs, Artificial Intelligence 95 (1998) 115-154.
24. P. Rao, K. Sagonas, T. Swift, D.S. Warren, J. Freire, XSB: A system for efficiently computing well-founded semantics, in: J. Dix, U. Furbach, A. Nerode (Eds.), Logic Programming and Non-Monotonic Reasoning, Proc. 4th International Conference, Lecture Notes in Artificial Intelligence, Vol. 1265, Springer, Berlin, 1997, pp. 430-440.
25. R. Reiter, On closed-world databases, in: H. Gallaire, J. Minker (Eds.), Logic and Data Bases, Plenum Press, New York, 1978, pp. 55-76.
26. R. Reiter, Deductive question-answering on relational data bases, in: H. Gallaire, J. Minker (Eds.), Logic and Data Bases, New York, Plenum, 1978, pp. 149-177.
27. C. Sakama, H. Seki, Partial deduction of disjunctive logic programs: A declarative approach, in: Logic Program Synthesis and Transformation - Meta Programming in Logic, Lecture Notes in Computer Science, Vol. 883, Springer, Berlin, 1994, pp. 170-182.
28. Y. Shoham, Agent oriented programming, Artificial Intelligence 60 (1993) 51-92.
29. V.S. Subrahmanian, P. Bonatti, J. Dix, T. Eiter, S. Kraus, F. Özean, R. Ross, Heterogenous Active Agents, MIT Press, Cambridge, MA, 1999.
30. T. Swift, Using tabling for nonmonotonic programming, Ann. Math. Artificial Intelligence, to appear. (Special Issue on Logics in Artificial Intelligence, edited by J. Dix, J. Lobo.)
31. A. Van Gelder, K.A. Ross, J.S. Schlipf, Unfounded sets and well-founded semantics for general logic programs, in: Proc. 7th Symposium on Principles of Database Systems, 1988, pp. 221-230.