{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:15:01Z","timestamp":1742976901502,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319147253"},{"type":"electronic","value":"9783319147260"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-14726-0_7","type":"book-chapter","created":{"date-parts":[[2015,1,6]],"date-time":"2015-01-06T22:37:32Z","timestamp":1420583852000},"page":"96-111","source":"Crossref","is-referenced-by-count":0,"title":["Cumulativity Tailored for Nonmonotonic Reasoning"],"prefix":"10.1007","author":[{"given":"Tomi","family":"Janhunen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilkka","family":"Niemel\u00e4","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"7_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0004-3702(91)90099-6","volume":"50","author":"G. Brewka","year":"1991","unstructured":"Brewka, G.: Cumulative default logic: In defense of nonmonotonic inference rules. Artificial Intelligence\u00a050(2), 183\u2013205 (1991)","journal-title":"Artificial Intelligence"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0023314","volume-title":"Nonmonotonic and Inductive Logic","author":"G. Brewka","year":"1991","unstructured":"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.\u00a0543, pp. 1\u201312. Springer, Heidelberg (1991)"},{"key":"7_CR3","unstructured":"Dix, J.: Default theories of poole-type and a method for constructing cumulative versions of default logic. In: Proceedings of ECAI 1992, pp. 289\u2013293 (1992)"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BFb0023315","volume-title":"Nonmonotonic and Inductive Logic","author":"J. Dix","year":"1991","unstructured":"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.\u00a0543, pp. 13\u201337. Springer, Heidelberg (1991)"},{"key":"7_CR5","unstructured":"Dix, J.: Classifying semantics of disjunctive logic programs. In: Proceedings of JICSLP 1992, pp. 798\u2013812. MIT Press (1992)"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/11799573_4","volume-title":"Logic Programming","author":"M. Gebser","year":"2006","unstructured":"Gebser, M., Schaub, T.: Tableau calculi for answer set programming. In: Etalle, S., Truszczy\u0144ski, M. (eds.) ICLP 2006. LNCS, vol.\u00a04079, pp. 11\u201325. Springer, Heidelberg (2006)"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-540-74610-2_9","volume-title":"Logic Programming","author":"M. Gebser","year":"2007","unstructured":"Gebser, M., Schaub, T.: Generic tableaux for answer set programming. In: Dahl, V., Niemel\u00e4, I. (eds.) ICLP 2007. LNCS, vol.\u00a04670, pp. 119\u2013133. Springer, Heidelberg (2007)"},{"issue":"3","key":"7_CR8","first-page":"620","volume":"38","author":"A.V. Gelder","year":"1991","unstructured":"Gelder, A.V., Ross, K., Schlipf, J.: The well-founded semantics for general logic programs. Journal of the ACM\u00a038(3), 620\u2013650 (1991)","journal-title":"Journal of the ACM"},{"key":"7_CR9","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of ICLP 1988, pp. 1070\u20131080 (1988)"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M. Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing\u00a09, 365\u2013385 (1991)","journal-title":"New Generation Computing"},{"key":"7_CR11","unstructured":"Gelfond, M., Przymusinska, H., Lifschitz, V., Truszczynski, M.: Disjunctive defaults. In: Proceedings of KR 1991, pp. 230\u2013237. Morgan Kaufmann (1991)"},{"issue":"1-2","key":"7_CR12","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0004-3702(94)90086-8","volume":"69","author":"G. Gottlob","year":"1994","unstructured":"Gottlob, G., Mingyi, Z.: Cumulative default logic: Finite characterization, algorithms, and complexity. Artificial Intelligence\u00a069(1-2), 329\u2013345 (1994)","journal-title":"Artificial Intelligence"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/978-3-540-89982-2_66","volume-title":"Logic Programming","author":"T. Janhunen","year":"2008","unstructured":"Janhunen, T.: Removing redundancy from answer set programs. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol.\u00a05366, pp. 729\u2013733. Springer, Heidelberg (2008)"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BFb0022570","volume-title":"Computational Logic and Proof Theory","author":"T. Janhunen","year":"1993","unstructured":"Janhunen, T., Niemel\u00e4, I.: A scheme for weakened negative introspection in autoepistemic reasoning. In: Mundici, D., Gottlob, G., Leitsch, A. (eds.) KGC 1993. LNCS, vol.\u00a0713, pp. 211\u2013222. Springer, Heidelberg (1993)"},{"issue":"1-2","key":"7_CR15","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0004-3702(90)90101-5","volume":"44","author":"S. Kraus","year":"1990","unstructured":"Kraus, S., Lehmann, D., Magidor, M.: Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence\u00a044(1-2), 167\u2013207 (1990)","journal-title":"Artificial Intelligence"},{"issue":"4","key":"7_CR16","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1145\/383779.383783","volume":"2","author":"V. Lifschitz","year":"2001","unstructured":"Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Transactions on Computational Logic\u00a02(4), 526\u2013541 (2001)","journal-title":"ACM Transactions on Computational Logic"},{"issue":"3-4","key":"7_CR17","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1023\/A:1018978005636","volume":"25","author":"V. Lifschitz","year":"1999","unstructured":"Lifschitz, V., Tang, L., Turner, H.: Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence\u00a025(3-4), 369\u2013389 (1999)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"7_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02906-0","volume-title":"Nonmonotonic Logic: Context-Dependent Reasoning","author":"W. Marek","year":"1993","unstructured":"Marek, W., Truszczy\u0144ski, M.: Nonmonotonic Logic: Context-Dependent Reasoning. Springer, Berlin (1993)"},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0004-3702(86)90032-9","volume":"28","author":"J. McCarthy","year":"1986","unstructured":"McCarthy, J.: Applications of circumscription to formalizing commonsense knowledge. Artificial Intelligence\u00a028, 89\u2013116 (1986)","journal-title":"Artificial Intelligence"},{"key":"7_CR20","unstructured":"Mikitiuk, A., Truszczynski, M.: Constrained and rational default logics. In: Proceedings of IJCAI 1995, pp. 1509\u20131517. Morgan Kaufmann (1995)"},{"issue":"1","key":"7_CR21","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/0004-3702(85)90042-6","volume":"25","author":"R. Moore","year":"1985","unstructured":"Moore, R.: Semantical consideration on nonmonotonic logic. Artificial Intelligence\u00a025(1), 234\u2013252 (1985)","journal-title":"Artificial Intelligence"},{"issue":"1-2","key":"7_CR22","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10472-006-9028-z","volume":"47","author":"D. Pearce","year":"2006","unstructured":"Pearce, D.: Equilibrium logic. Annals of Mathematics and Artificial Intelligence\u00a047(1-2), 3\u201341 (2006)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"7_CR23","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/11595014_4","volume-title":"Progress in Artificial Intelligence","author":"L. Moniz Pereira","year":"2005","unstructured":"Moniz Pereira, L., Pinto, A.M.: Revised stable models \u2013 A semantics for logic programs. In: Bento, C., Cardoso, A., Dias, G. (eds.) EPIA 2005. LNCS (LNAI), vol.\u00a03808, pp. 29\u201342. Springer, Heidelberg (2005)"},{"key":"7_CR24","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R. Reiter","year":"1980","unstructured":"Reiter, R.: A logic for default reasoning. Artificial Intelligence\u00a013, 81\u2013132 (1980)","journal-title":"Artificial Intelligence"},{"key":"7_CR25","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/3-540-46767-X_22","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"P. Simons","year":"1999","unstructured":"Simons, P.: Extending the stable model semantics with more expressive rules. In: Gelfond, M., Leone, N., Pfeifer, G. (eds.) LPNMR 1999. LNCS (LNAI), vol.\u00a01730, pp. 305\u2013316. Springer, Heidelberg (1999)"},{"issue":"1-2","key":"7_CR26","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0004-3702(02)00187-X","volume":"138","author":"P. Simons","year":"2002","unstructured":"Simons, P., Niemel\u00e4, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence\u00a0138(1-2), 181\u2013234 (2002)","journal-title":"Artificial Intelligence"},{"key":"7_CR27","series-title":"Lecture Notes in Artificial Intelligence","first-page":"81","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"H. Turner","year":"2001","unstructured":"Turner, H.: Strong equivalence for logic programs and default theories (Made easy). In: Eiter, T., Faber, W., Truszczy\u0144ski, M. (eds.) LPNMR 2001. LNCS (LNAI), vol.\u00a02173, pp. 81\u201392. Springer, Heidelberg (2001)"},{"issue":"4-5","key":"7_CR28","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1017\/S1471068403001819","volume":"3","author":"H. Turner","year":"2003","unstructured":"Turner, H.: Strong equivalence made easy: nested expressions and weight constraints. Theory and Practice of Logic Programming\u00a03(4-5), 609\u2013622 (2003)","journal-title":"Theory and Practice of Logic Programming"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14726-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T23:39:32Z","timestamp":1558309172000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14726-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319147253","9783319147260"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14726-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}