Multi-valued autoepistemic logic

Springer Science and Business Media LLC - Tập 18 Số 2 - Trang 159-174 - 1996
Robert F. Stärk1
1Institut für Informatik, Universität Freiburg, Fribourg, Switzerland

Tóm tắt

Từ khóa


Tài liệu tham khảo

K.R. Apt, H.A. Blair and A. Walker, Towards a theory of declarative knowledge, in:Foundations of Deductive Databases and Logic Programming, ed. J. Minker (Morgan-Kaufmann, Los Altos, 1987) pp. 89–148.

W.A. Carnielli, Systematization of finite many-valued logics through the method of tableaux,Journal of Symbolic Logic 52(2) (1987) 473–493.

M. Fitting, Many-valued non-monotonic modal logics, in:Logical Foundations of Computer Science — Tver '92, Springer, Lecture Notes in Computer Science 620 (1992) pp. 139–150.

M. Gelfond, On stratified autoepistemic theories, in:Proceedings of the Sixth National Conference on Artificial Intelligence, AAAI 87 (1987) pp. 207–219.

M.L. Ginsberg, Bilattices and modal operators,J. of Logic and Computation 1(1) (1990) 41–69.

G. Gottlob, Complexity results for nonmonotonic logics,J. of Logic and Computation 2(3) (1992) 397–425.

R. Hähnle, Towards an efficient tableau proof procedure for multiple-valued logics, in:Computer Science Logic, CSL '90, Lecture Notes in Computer Science 533, eds. E. Börger, H. Kleine Büning, M.M. Richter and W. Schönfeld (Springer-Verlag, 1991) pp. 248–260.

G. Jäger and R.F. Stärk, The defining power of stratified and hierarchical logic programs,J. of Logic Programming 15(1&2) (1993) 55–77.

K. Konolige, On the relation between default and autoepistemic logic,Artificial Intelligence 35 (1988) 343–382.

H.J. Levesque, All I know: A study in autoepistemic logic, Technical Report KRR-TR-89-3, University of Toronto (1989).

W. Marek, Stable theories in autoepistemic logic,Fundamenta Informaticae 12 (1989) 243–254.

W. Marek, G.F. Shvarts and M. Truszczyński, Modal nonmonotonic logics: ranges, characterization, computation, in:Principles of Knowledge Representation and Reasoning: Proceedings of the Second International Conference (KR '91), eds. J. Allen et al. (Morgan-Kaufmann, 1991) pp. 395–404.

R.C. Moore, Possible-world semantics for autoepistemic logic, in:Proceedings 1984 Nonmonotonic Reasoning Workshop (New Paltz, NY, 1984) pp. 344–354.

R.C. Moore, Semantical considerations on nonmonotonic logic,Artificial Intelligence 25 (1985) 75–94.

I. Niemelä, Decision procedure for autoepistemic logic, in:9th International Conference on Automated Deduction, Lecture Notes in Computer Science 310, eds. E. Lusk and R. Overbeek (Springer, 1988) pp. 675–684.

T.C. Przymusinski, Three-valued nonmonotonic formalisms and semantics of logic programs,Artificial Intelligence 49 (1991) 309–343.

R.F. Stärk, On the existence of fixpoints in Moore's autoepistemic logic and the nonmonotonic logic of McDermott and Doyle, in:Computer Science Logic, CSL '90, Lecture Notes in Computer Science 533, eds. E. Börger, H. Kleine Büning, M.M. Richter and W. Schönfeld (Springer-Verlag, 1991) pp. 354–365.

S.J. Surma, An algorithm for axiomatizing every finite logic, in:Computer Science and Multiple-Valued Logic, ed. D.C. Rine (North-Holland, 1984) pp. 143–149.