On the intertranslatability of non-monotonic logics

Annals of Mathematics and Artificial Intelligence

Volumn 27, Issue 1-4, 1999, Pages 79-128

  Janhunen, Tomi ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033264886     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1018915113814     Document Type: Article

References (37)

1. P.A. Bonatti and T. Eiter, Querying disjunctive database through nonmonotonic logics, Theoretical Computer Science 160 (1996) 321-363.
2. M. Cadoli, F.M. Donini and M. Schaerf, Is intractability of nonmonotonic reasoning a real drawback, Artificial Intelligence 88 (1996) 215-251.
3. M. Cadoli and M. Lenzerini, The complexity of propositional closed world reasoning and circumscription, Journal of Computer and System Sciences 2 (1994) 255-310.
4. 2-complete, Theoretical Computer Science 114 (1993) 231-245.
5. J. Engelfriet, V. Marek, J. Treur and M. Truszczyński, Infinitary default logic for specification of nonmonotonic reasoning, in: Proceedings of the 5th European Workshop on Logics is Artificial Intelligence, eds. J. Alferes, L. Pereira and E. Orlowska, Lectures Notes in Artificial Intelligence, Vol. 1126 (Springer, 1996) pp. 224-236.
6. D.W. Etherington, Formalizing nonmonotonic reasoning systems, Artificial Intelligence 31 (1987) 41-85.
7. D.W. Etherington, Relating default logic and circumscription, in: Proceedings of the 10th International Joint Conference on Artificial Intelligence, Milan, Italy (Morgan Kaufmann, 1987) pp. 489-494.
8. G. Gogic, H. Kautz, C. Papadimitriou and B. Selman, The comparative linguistics of knowledge representation, in: Proceedings of the 14th International Joint Conference on Artificial Intelligence, Montreal, Canada, August 1995 (Morgan Kaufmann, 1995) pp. 862-869.
9. G. Gottlob, Complexity results for nonmonotonic logics, Journal of Logic and Computation 2(3) (1992) 397-425.
10. G. Gottlob, The complexity of default reasoning under the stationary fixed point semantics, Information and Computation 121 (1995) 81-92.
11. G. Gottlob, Translating default logic into standard autoepistemic logic, Journal of the Association for Computing Machinery 42(2) (1995) 711-740.
12. T. Imielinski, Results on translating defaults to circumscription, Artificial Intelligence 32 (1987) 131-146.
13. T. Janhunen, Representing autoepistemic introspection in terms of default rules, in: Proceedings of the European Conference on Artificial Intelligence, Budapest, Hungary, August 1996 (Wiley, 1996) pp. 70-74.
14. T. Janhunen, Separating disbeliefs from beliefs in autoepistemic reasoning, in: Proceedings of the 4th International Conference on Logic Programming and Non-Monotonic Reasoning, eds. J. Dix, U. Furbach and A. Nerode, Dagstuhl, Germany, July 1997, Lectures Notes in Artificial Intelligence, Vol. 1265 (Springer, 1997) pp. 132-151.
15. T. Janhunen, Non-monotonic systems: A framework for analyzing semantics and structural properties of non-monotonic reasoning, Doctoral dissertation, Research report A49, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland (March 1998).
16. T. Janhunen, On the intertranslatability of autoepistemic, default and priority logics and parallel circumscription, in: Proceedings of the 6th European Workshop on Logics in Artificial Intelligence, eds. J. Dix, L. Fariñas del Cerro and U. Furbach, Dagstuhl, Germany, October 1998, Lectures Notes in Artificial Intelligence, Vol. 1489 (Springer, 1998) pp. 216-232.
17. K. Konolige, On the relation between default and autoepistemic logic, Artificial Intelligence 35 (1988) pp. 343-382.
18. K. Konolige, On the relation between autoepistemic logic and circumscription, in: Proceedings of the 11th International Joint Conference on Artificial Intelligence, Detroit, MI, August 1989 (Morgan Kaufmann, 1989) pp. 1213-1218.
19. V. Lifschitz, Computing circumscription, in: Proceedings of the 9th International Joint Conference on Artificial Intelligence, Los Angeles, CA, August 1985 (Morgan Kaufmann, 1985) pp. 121-127.
20. V. Marek, J. Treur and M. Truszczyński, Representation theory for default logic, Annals of Mathematics in Artificial Intelligence 21 (1997) 343-358.
21. W. Marek, G.F. Shvarts and M. Truszczyński, Modal nonmonotonic logics: Ranges, characterization, computation, in: Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning, Cambridge, MA, April 1991 (Morgan Kaufmann, 1991) pp. 395-404.
22. W. Marek and M. Truszczyński, Modal logic for default reasoning, Annals of Mathematics and Artificial Intelligence 1 (1990) pp. 275-302.
23. W. Marek and M. Truszczyński, Nonmonotonic Logic: Context-Dependent Reasoning (Springer, Berlin, 1993).
24. J. McCarthy, Circumscription - a form of non-monotonic reasoning, Artificial Intelligence 13 (1980) 27-39.
25. R.C. Moore, Semantical considerations on nonmonotonic logic, in: Proceedings of the 8th International Joint Conference on Artificial Intelligence, Karlsruhe, FRG, August 1983 (Morgan Kaufmann, 1983) pp. 272-279.
26. I. Niemelä, Towards automatic autoepistemic reasoning, in: Proceedings of the European Workshop on Logics in Artificial Intelligence - JELIA'90, Amsterdam, The Netherlands, September 1990 (Springer, 1990) pp. 428-443.
27. I. Niemelä, On the decidability and complexity of autoepistemic reasoning, Fundamenta Informaticae 17(1,2) (1992) 117-155.
28. I. Niemelä, A unifying framework for nonmonotonic reasoning, in: Proceedings of the 10th European Conference on Artificial Intelligence, Vienna, Austria, August 1992 (Wiley, 1992) pp. 334-338.
29. I. Niemelä, Autoepistemic logic as a unified basis for nonmonotonic reasoning, Doctoral dissertation, Research report A24, Digital Systems Laboratory, Helsinki University of Technology, Espoo, Finland (August 1993).
30. I. Niemelä, Implementing circumscription using a tableau method, in: Proceedings of the European Conference on Artificial Intelligence, Budapest, Hungary, August 1996 (Wiley, 1996) pp. 80-84.
31. R. Reiter, A logic for default reasoning, Artificial Intelligence 13 (1980) 81-132.
32. G. Schwarz, On embedding default logic into Moore's autoepistemic logic, Artificial Intelligence 80 (1996) 349-359.
33. J. Stillman, It's not my default: the complexity of membership problems in restricted propositional default logics, in: Proceedings of the 8th National Conference on Artificial Intelligence, Boston, MA, July 1990 (MIT Press, Cambridge, MA, 1990) pp. 571-578.
34. L. Stockmeyer, The polynomial-time hierarchy, Theoretical Computer Science 3 (1977) 1-22.
35. L. Stockmeyer, Classifying the computational complexity of problems, Journal of Symbolic Logic 52(1) (1987) 1-43.
36. M. Truszczyński, Modal interpretations of default logic, in: Proceedings of the 12th International Joint Conference on Artificial Intelligence, Sydney, Australia, August 1991 (Morgan Kaufmann, 1991) pp. 393-398.
37. X. Wang, J.-H. You and L.Y. Yuan, Nonmonotonic reasoning by monotonic inferences with priority constraints, in: Proceedings of the 2nd International Workshop on Non-Monotonic Extensions of Logic Programming, Lecture Notes in Artificial Intelligence, Vol. 1216 (Springer, 1996) pp. 91-109.