Capturing stationary and regular extensions with reiter's extensions

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1919, Issue , 2000, Pages 102-117

  Janhunen, Tomi ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; FORMAL LOGIC; LOGIC PROGRAMMING; POLYNOMIALS;

DEFAULT LOGIC; EXPRESSIVE POWER; LOGIC PROGRAMS; NONMONOTONIC LOGIC; PARTIAL STABLE MODELS; STABLE MODEL; TRANSLATION FUNCTIONS;

PROGRAM TRANSLATORS;

EID: 84943172306     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-40006-0_8     Document Type: Conference Paper

References (26)

1. P.A.Bonatti and T.Eiter.Querying disjunctive database through nonmonotonic logics.Theoretical Computer Science, 160:321-363, 1996.
2. P.Cholewínski, V.W.Marek, A.Mikitiuk, and M.Truszczýnski.Computing with default logic.Artificial Intelligence, 112:105-146, 1999.
3. M.Denecker, W.Marek, and M.Truszczýnski.Uniform semantic treatment of default and autoepistemic logic.In Principles of Knowledge Representation and Reasoning: Proceedings of the 7th International Conference, pages 74-84, Breckenridge, Colorado, April 2000.Morgan Kaufmann.
4. J.Dix.Default theories of Poole-type and a method for constructing cumulative versions of default logic.In B.Neumann, editor, Proceedings of the 10th European Conference on AI, pages 289-293, Vienna, Austria, August 1992.Wiley.
5. M.Gelfond and V.Lifschitz.The stable model semantics for logic programming.In Proceedings of the 5th International Conference on Logic Programming, pages 1070-1080, Seattle, USA, August 1988.The MIT Press.
6. M.Gelfond and V.Lifschitz.Classical negation in logic programs and disjunctive databases.New Generation Computing, 9:365-385, 1991.
7. G.Gottlob.Complexity results for nonmonotonic logics.Journal of Logic and Computation, 2(3):397-425, June 1992.
8. G.Gottlob.The complexity of default reasoning under the stationary fixed point semantics.Information and Computation, 121:81-92, 1995.
9. G.Gottlob.Translating default logic into standard autoepistemic logic.Journal of the Association for Computing Machinery, 42(2):711-740, 1995.
10. T.Janhunen.Separating disbeliefs from beliefs in autoepistemic reasoning.In J.Dix, U.Furbach, and A.Nerode, editors, Proceedings of the 4th International Conference on Logic Programming and Non-Monotonic Reasoning, pages 132-151, Dagstuhl, Germany, July 1997.Springer-Verlag.LNAI 1265.
11. 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.211 p.
12. T.Janhunen.Classifying semi-normal default logic on the basis of its expressive power.In M.Gelfond, N.Leone, and G.Pfeifer, editors, Proceedings of the 5th International Conference on Logic Programming and Non-Monotonic Reasoning, LPNMR'99, pages 19-33, El Paso, Texas, December 1999.Springer-Verlag.LNAI.
13. T.Janhunen.On the intertranslatability of non-monotonic logics.Annals of Mathematics in Artificial Intelligence, 27(1-4):79-128, 1999.
14. T.Janhunen, I.Niemel, P.Simons, and J.-H.You.Unfolding partiality and disjunctions in stable model semantics.In Principles of Knowledge Representation and Reasoning: Proceedings of the 7th International Conference, pages 411-422, Breckenridge, Colorado, April 2000.Morgan Kaufmann.
15. V.Lifschitz, L.R.Tang, and H.Turner.Nested expressions in logic programs.Annals of Mathematics in Artificial Intelligence, 25:369-389, 1999.
16. W.Marek and M.Truszczýnski.Nonmonotonic Logic: Context-Dependent Reasoning.Springer-Verlag, Berlin, 1993.
17. J.McCarthy.Circumscription-a form of non-monotonic reasoning.Artificial Intelligence, 13:27-39, 1980.
18. R.C.Moore.Semantical considerations on nonmonotonic logic.Artificial Intelligence, 25:75-94, 1985.
19. H.Przymusinska and T.C.Przymusinski.Stationary default extensions.In Working Notes of the 4th International Workshop on on Nonmonotonic Reasoning, pages 179-193, Plymouth, Vermont, USA, May 1992.
20. T.Przymusinski.Extended stable semantics for normal and disjunctive logic programs.In Proceedings of the 7th International Conference on Logic Programming, pages 459-477.MIT Press, 1990.
21. R.Reiter.On closed world data bases.In H.Gallaire and J.Minker, editors, Logic and Data Bases, pages 55-76.Plenum Press, New York, 1978.
22. R.Reiter.A logic for default reasoning.Artificial Intelligence, 13:81-132, 1980.
23. A.Van Gelder.The alternating fixpoints of logic programs with negation.In ACM Symposium on Principles of Database Systems, pages 1-10, 1989.
24. A.Van Gelder, K.A.Ross, and J.S.Schlipf.Unfounded sets and the well-founded semantics for general logic programs, extended abstract.In Proceedings of the 7th Symposium on Principles of Database Systems, pages 221-230, Austin, Texas, March 1988.ACM Press.
25. A.Van Gelder, K.A.Ross, and J.S.Schlipf.The well-founded semantics for general logic programs.Journal of the ACM, 38(3):620-650, July 1991.
26. J.-H.You and L.Yuan.A three-valued semantics for deductive databases and logic programs.Journal of Computer and System Sciences, 49:334-361, 1994.