Abstract
In nonmonotonic reasoning, conclusions can be retracted when new pieces of information are incorporated into premises. This contrasts with classical reasoning which is monotonic, i.e., new premises can only increase the set of conclusions that can be drawn. Slightly weaker properties, such as cumulativity and rationality, seem reasonable counterparts of such a monotonicity property for nonmonotonic reasoning but intriguingly it turned out that some major nonmonotonic logics failed to be cumulative. These observations led to the study of variants in hope of restoring cumulativity but not losing other essential properties. In this paper, we take a fresh view on cumulativity by starting from a notion of rule entailment in the context of answer set programs. It turns out that cumulativity can be revived if the expressive precision of rules subject to answer set semantics is fully exploited when new premises are being incorporated. Even stronger properties can be established and we illustrate how the approach can be generalized for major nonmonotonic logics.
The support from the Finnish Centre of Excellence in Computational Inference Research (COIN) funded by the Academy of Finland (under grant #251170) is gratefully acknowledged.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brewka, G.: Cumulative default logic: In defense of nonmonotonic inference rules. Artificial Intelligence 50(2), 183–205 (1991)
Brewka, G., Makinson, D., Schlechta, K.: Cumulative inference relations for JTMS and logic programming. In: Dix, J., Schmitt, P.H., Jantke, K.P. (eds.) NIL 1990. LNCS, vol. 543, pp. 1–12. Springer, Heidelberg (1991)
Dix, J.: Default theories of poole-type and a method for constructing cumulative versions of default logic. In: Proceedings of ECAI 1992, pp. 289–293 (1992)
Dix, J.: Cumulativity and rationality in semantics of normal logic programs. In: Dix, J., Schmitt, P.H., Jantke, K.P. (eds.) NIL 1990. LNCS, vol. 543, pp. 13–37. Springer, Heidelberg (1991)
Dix, J.: Classifying semantics of disjunctive logic programs. In: Proceedings of JICSLP 1992, pp. 798–812. MIT Press (1992)
Gebser, M., Schaub, T.: Tableau calculi for answer set programming. In: Etalle, S., Truszczyński, M. (eds.) ICLP 2006. LNCS, vol. 4079, pp. 11–25. Springer, Heidelberg (2006)
Gebser, M., Schaub, T.: Generic tableaux for answer set programming. In: Dahl, V., Niemelä, I. (eds.) ICLP 2007. LNCS, vol. 4670, pp. 119–133. Springer, Heidelberg (2007)
Gelder, A.V., Ross, K., Schlipf, J.: The well-founded semantics for general logic programs. Journal of the ACM 38(3), 620–650 (1991)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of ICLP 1988, pp. 1070–1080 (1988)
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365–385 (1991)
Gelfond, M., Przymusinska, H., Lifschitz, V., Truszczynski, M.: Disjunctive defaults. In: Proceedings of KR 1991, pp. 230–237. Morgan Kaufmann (1991)
Gottlob, G., Mingyi, Z.: Cumulative default logic: Finite characterization, algorithms, and complexity. Artificial Intelligence 69(1-2), 329–345 (1994)
Janhunen, T.: Removing redundancy from answer set programs. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 729–733. Springer, Heidelberg (2008)
Janhunen, T., Niemelä, I.: A scheme for weakened negative introspection in autoepistemic reasoning. In: Mundici, D., Gottlob, G., Leitsch, A. (eds.) KGC 1993. LNCS, vol. 713, pp. 211–222. Springer, Heidelberg (1993)
Kraus, S., Lehmann, D., Magidor, M.: Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence 44(1-2), 167–207 (1990)
Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Transactions on Computational Logic 2(4), 526–541 (2001)
Lifschitz, V., Tang, L., Turner, H.: Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence 25(3-4), 369–389 (1999)
Marek, W., Truszczyński, M.: Nonmonotonic Logic: Context-Dependent Reasoning. Springer, Berlin (1993)
McCarthy, J.: Applications of circumscription to formalizing commonsense knowledge. Artificial Intelligence 28, 89–116 (1986)
Mikitiuk, A., Truszczynski, M.: Constrained and rational default logics. In: Proceedings of IJCAI 1995, pp. 1509–1517. Morgan Kaufmann (1995)
Moore, R.: Semantical consideration on nonmonotonic logic. Artificial Intelligence 25(1), 234–252 (1985)
Pearce, D.: Equilibrium logic. Annals of Mathematics and Artificial Intelligence 47(1-2), 3–41 (2006)
Moniz Pereira, L., Pinto, A.M.: Revised stable models – A semantics for logic programs. In: Bento, C., Cardoso, A., Dias, G. (eds.) EPIA 2005. LNCS (LNAI), vol. 3808, pp. 29–42. Springer, Heidelberg (2005)
Reiter, R.: A logic for default reasoning. Artificial Intelligence 13, 81–132 (1980)
Simons, P.: Extending the stable model semantics with more expressive rules. In: Gelfond, M., Leone, N., Pfeifer, G. (eds.) LPNMR 1999. LNCS (LNAI), vol. 1730, pp. 305–316. Springer, Heidelberg (1999)
Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138(1-2), 181–234 (2002)
Turner, H.: Strong equivalence for logic programs and default theories (Made easy). In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 81–92. Springer, Heidelberg (2001)
Turner, H.: Strong equivalence made easy: nested expressions and weight constraints. Theory and Practice of Logic Programming 3(4-5), 609–622 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Janhunen, T., Niemelä, I. (2015). Cumulativity Tailored for Nonmonotonic Reasoning. In: Eiter, T., Strass, H., Truszczyński, M., Woltran, S. (eds) Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation. Lecture Notes in Computer Science(), vol 9060. Springer, Cham. https://doi.org/10.1007/978-3-319-14726-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-14726-0_7
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-14725-3
Online ISBN: 978-3-319-14726-0
eBook Packages: Computer ScienceComputer Science (R0)