Abstract
We present a method of representing some classes of default theories as normal logic programs. The main point is that the standart semantics (i.e., SLDNF-resolution) computes answer substitutions that correspond exactly to the extensions of the represented default theory. This means that we give a correct implementation of default logic. We explain the steps of constructing a logic program LogProg(P, D) from a given default theory (P, D), give some examples, and derive soundness and completeness results.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Antoniou, G. and Sperschneider, V.: Computing extensions of nonmonotonic logics, in Proc. 4th Scandinavian Conference on Artificial Intelligence, IOS Press, 1993, pp. 20–29.
Antoniou, G. and Langetepe, E.: Soundness and completeness of a logic programming approach to default logic, in Proc. AAAI-94,AAAI Press, 1994, pp. 934–939.
Antoniou, G. and Langetepe, E.: Applying SLD-resolution to a class of non-Horn logic programs, J. IGPL2(2) (1994), 229–241.
Bidoit, N. and Froidevaux, C.: General logic databases and programs: Default logic semantics and stratification, J. Information and Computation 94(1991), 15–54.
Bidoit, N. and Froidevaux, C.: Negation by default and unstratifiable logic programs, Theoretical Computer Science 78(1991), 85–112.
Froidevaux, C.: Taxonomic default theory, in Proc. European Conference on Artificial Intelligence, Brighton, 1986.
Gelfond, M. and Lifschitz, V.: The stable model semantics for logic programming, in Proc. 5th Int. Conference/Symposium on Logic Programming, 1988, pp. 1070–1080.
Lloyd, J. W.: Foundations of Logic Programming, 2nd edn, Springer-Verlag, 1987.
Marek, W. and Subrahmanian, V. S.: The relationship between stable, supported, default and autoepistemic semantics for general logic programs, Theoretical Computer Science 103(1992), 365–386.
Marek, W. and Truszcynski, M.: Stable semantics for logic programs and default theories, in Proc. North American Conference on Logic Programming, 1989, pp. 243–256.
Pereira, L. M. and Nerode, A.: Logic programming and non-monotonic reasoning, Proceedings of the 2nd International Workshop, MIT Press, 1993.
Poole, D.: A logical framework for default reasoning, Artificial Intelligence 36(1988).
Przymusinski, T. C.: On the relationship between nonmonotonic reasoning and logic programming, Proc. AAAI-88, 1988.
Przymusinski, T. C.: Autoepistemic logic of closed beliefs and logic programming, Proc. 1st International Workshop on Logic Programming and Non-Monotonic Reasoning, 1991.
Reiter, R.: A logic for default reasoning, Artificial Intelligence 13, 1980.
Schlechta, K.: Directly sceptical inheritance cannot capture the intersection of extensions, Proc. GMD Workshop on Nonmonotonic Reasoning, GMD, 1989.
Sperschneider, V. and Antoniou, G.: Logic: A Foundation for Computer Science,Addison-Wesley, 1991.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Antoniou, G., Langetepe, E. A Correct Logic Programming Computation of Default Logic Extensions. Journal of Automated Reasoning 18, 25–46 (1997). https://doi.org/10.1023/A:1005771523328
Issue Date:
DOI: https://doi.org/10.1023/A:1005771523328