Abstract
Default logic is computationally expensive. One of the most promising ways of easing this problem and developing powerful implementations is to split a default theory into smaller parts and compute extensions in a modular, “local” way. This paper compares two recent approaches, Turner's splitting and Cholewinski's stratification. It shows that the approaches are closely related – in fact the former can be viewed as a special case of the latter.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Antoniou, G., 1997, Nonmonotonic Reasoning, Cambridge, MA: MIT Press.
Apt, K.R. and Bol, R.N., 1994, “Logic programming and negation: A survey,” Journal of Logic Programming 19/20, 9–72.
Cholewinski, P., 1994, “Stratified default logic,” pp. 456–470 in Proc. Computer Science Logic 1994, L. Pacholski and J. Tiuryn, eds., Lecture Notes in Computer Science, Vol. 933, Berlin: Springer-Verlag.
Cholewinski, P., 1995a, “Reasoning with stratified default theories,” in Proc. 3rd International Conference on Logic Programming and Nonmonotonic Reasoning, V.W. Marek, A. Nerode, and M. Truszczynski, eds., Berlin: Springer-Verlag.
Cholewinski, P., 1995b, “Seminormal stratified default theories,” Annals of Mathematics and Artificial Intelligence.
Cholewinski, P., Marek, W., and Truszczynski, M., 1996, “Default reasoning system DeReS,” in Proc. 5th International Conference on Principles of Knowledge Representation and Reasoning, San Mateo, CA: Morgan Kaufmann.
Delgrande, J.P., Schaub, T., and Jackson, W.K., 1994, “Alternative approaches to default logic,” Artificial Intelligence 70, 167–237.
Etherington, D.W. and Crawford, J.M., 1996, “Towards efficient default reasoning,” pp. 627–632 in Proc. AAAI-96, Menlo Park, CA: AAAI Press.
Gottlob, G., 1992, “Complexity results for nonmonotonic logics,” Journal of Logic and Computation 2, 397–425.
Lifschitz, V. and Turner, H., 1994, “Splitting a logic program,” pp. 230–237 in Proc. 11th International Conference on Logic Programming (ICLP'94), Cambridge, MA: MIT Press.
Lukaszewicz, W., 1988, “Considerations on default logic,” Computational Intelligence 4, 1–16.
Marek, W. and Truszczynski, M., 1993, Nonmonotonic Logic, Berlin: Springer-Verlag.
Mikitiuk, A. and Truszczynski, M., 1995, “Constrained and rational default logics,” pp. 1509–1515 in Proc. International Joint Conference on Artificial Intelligence, San Mateo, CA: Morgan Kaufmann.
Reiter, R., 1980, “A logic for default reasoning,” Artificial Intelligence 13, 81–132.
Turner, H., 1996, “Splitting a default theory,” pp. 645–651 in Proc. AAAI-96, Menlo Park, CA: AAAI Press.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Antoniou, G. Splitting Finite Default Theories: A Comparison of Two Approaches. Journal of Logic, Language and Information 8, 205–216 (1999). https://doi.org/10.1023/A:1008251012187
Issue Date:
DOI: https://doi.org/10.1023/A:1008251012187