{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:40:01Z","timestamp":1762101601591,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319115573"},{"type":"electronic","value":"9783319115580"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11558-0_32","type":"book-chapter","created":{"date-parts":[[2014,9,16]],"date-time":"2014-09-16T02:22:39Z","timestamp":1410834159000},"page":"457-471","source":"Crossref","is-referenced-by-count":4,"title":["Modular Paracoherent Answer Sets"],"prefix":"10.1007","author":[{"given":"Giovanni","family":"Amendola","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Eiter","sequence":"additional","affiliation":[]},{"given":"Nicola","family":"Leone","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","unstructured":"Alc\u00e2ntara, J., Dam\u00e1sio, C.V., Pereira, L.M.: A declarative characterization of disjunctive paraconsistent answer sets. In: Proc. ECAI 2004, pp. 951\u2013952. IOS Press (2004)"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Apt, K., Blair, H., Walker, A.: Towards a theory of declarative knowledge. In: Minker (ed.) [16], pp. 89\u2013148","DOI":"10.1016\/B978-0-934613-40-8.50006-3"},{"key":"32_CR3","unstructured":"Balduccini, M., Gelfond, M.: Logic programs with consistency-restoring rules. In: McCarthy, J., Williams, M.A. (eds.) Int\u2019l Symp. Logical Formalization of Commonsense Reasoning. AAAI 2003 Spring Symp. Series, pp. 9\u201318 (2003)"},{"key":"32_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01530761","volume":"12","author":"R. Ben-Eliyahu","year":"1994","unstructured":"Ben-Eliyahu, R., Dechter, R.: Propositional semantics for disjunctive logic programs. Ann. Math. & Artif. Intell.\u00a012, 53\u201387 (1994)","journal-title":"Ann. Math. & Artif. Intell."},{"issue":"2","key":"32_CR5","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0304-3975(89)90126-6","volume":"68","author":"H.A. Blair","year":"1989","unstructured":"Blair, H.A., Subrahmanian, V.S.: Paraconsistent logic programming. Theor. Comput. Sci.\u00a068(2), 135\u2013154 (1989)","journal-title":"Theor. Comput. Sci."},{"key":"32_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-642-02846-5_16","volume-title":"Logic Programming","author":"M. Dao-Tran","year":"2009","unstructured":"Dao-Tran, M., Eiter, T., Fink, M., Krennwallner, T.: Modular nonmonotonic logic programming revisited. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol.\u00a05649, pp. 145\u2013159. Springer, Heidelberg (2009)"},{"issue":"3\/4","key":"32_CR7","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF01536399","volume":"15","author":"T. Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: On the computational cost of disjunctive logic programming: Propositional case. Ann. Math. & Artif. Intell.\u00a015(3\/4), 289\u2013323 (1995)","journal-title":"Ann. Math. & Artif. Intell."},{"key":"32_CR8","first-page":"486","volume-title":"Proc. KR 2010","author":"T. Eiter","year":"2010","unstructured":"Eiter, T., Fink, M., Moura, J.: Paracoherent answer set programming. In: Lin, F., Sattler, U., Truszcy\u0144ski, M. (eds.) Proc. KR 2010, pp. 486\u2013496. AAAI Press, Toronto (2010)"},{"issue":"1\/2","key":"32_CR9","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/A:1018947420290","volume":"19","author":"T. Eiter","year":"1997","unstructured":"Eiter, T., Leone, N., Sacc\u00e0, D.: On the partial semantics for disjunctive deductive databases. Ann. Math. & Artif. Intell.\u00a019(1\/2), 59\u201396 (1997)","journal-title":"Ann. Math. & Artif. Intell."},{"issue":"4","key":"32_CR10","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1016\/j.jcss.2006.10.012","volume":"73","author":"W. Faber","year":"2007","unstructured":"Faber, W., Greco, G., Leone, N.: Magic sets and their application to data integration. J. Comput. Syst. Sci.\u00a073(4), 584\u2013609 (2007)","journal-title":"J. Comput. Syst. Sci."},{"key":"32_CR11","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"},{"issue":"1","key":"32_CR12","first-page":"42","volume":"16","author":"A. Heyting","year":"1930","unstructured":"Heyting, A.: Die formalen Regeln der intuitionistischen Logik. Sitzungsberichte der Preussischen Akademie der Wissenschaften\u00a016(1), 42\u201356 (1930)","journal-title":"Sitzungsberichte der Preussischen Akademie der Wissenschaften"},{"issue":"2","key":"32_CR13","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1093\/jigpal\/jzs043","volume":"21","author":"S. Huang","year":"2013","unstructured":"Huang, S., Li, Q., Hitzler, P.: Reasoning with inconsistencies in hybrid MKNF knowledge bases. Logic Journal of the IGPL\u00a021(2), 263\u2013290 (2013)","journal-title":"Logic Journal of the IGPL"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Janhunen, T., Oikarinen, E., Tompits, H., Woltran, S.: Modularity aspects of disjunctive stable models. J. Artif. Intell. Res. (JAIR)\u00a035, 813\u2013857 (2009)","DOI":"10.1613\/jair.2810"},{"key":"32_CR15","unstructured":"Lifschitz, V., Turner, H.: Splitting a logic program. In: Proc. ICLP 1994, pp. 23\u201338. MIT-Press (1994)"},{"volume-title":"Foundations of Deductive Databases and Logic Programming","year":"1988","key":"32_CR16","unstructured":"Minker, J. (ed.): Foundations of Deductive Databases and Logic Programming. Morgan Kaufman, Washington, DC (1988)"},{"key":"32_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/11546207_27","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"S. Odintsov","year":"2005","unstructured":"Odintsov, S., Pearce, D.J.: Routley semantics for answer sets. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol.\u00a03662, pp. 343\u2013355. Springer, Heidelberg (2005)"},{"issue":"6","key":"32_CR18","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1093\/logcom\/exn015","volume":"18","author":"M. Osorio","year":"2008","unstructured":"Osorio, M., Ram\u00edrez, J.R.A., Carballido, J.L.: Logical weak completions of paraconsistent logics. J. Log. Comput.\u00a018(6), 913\u2013940 (2008)","journal-title":"J. Log. Comput."},{"issue":"1-2","key":"32_CR19","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. Ann. Math. & Artif. Intell.\u00a047(1-2), 3\u201341 (2006)","journal-title":"Ann. Math. & Artif. Intell."},{"key":"32_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/978-3-540-89982-2_46","volume-title":"Logic Programming","author":"D.J. Pearce","year":"2008","unstructured":"Pearce, D.J., Valverde, A.: Quantified equilibrium logic and foundations for answer set programs. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol.\u00a05366, pp. 546\u2013560. Springer, Heidelberg (2008)"},{"key":"32_CR21","doi-asserted-by":"crossref","unstructured":"Pereira, L.M., Alferes, J.J., Apar\u00edcio, J.N.: Contradiction removal semantics with explicit negation. In: Masuch, M., P\u00f3los, L. (eds.) Logic at Work 1992. LNCS, vol.\u00a0808, pp. 91\u2013105. Springer (1992)","DOI":"10.1007\/3-540-58095-6_7"},{"key":"32_CR22","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.M. Pereira","year":"2005","unstructured":"Pereira, L.M., Pinto, A.M.: Revised stable models - 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":"32_CR23","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-540-75560-9_33","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"L.M. Pereira","year":"2007","unstructured":"Pereira, L.M., Pinto, A.M.: Approved models for normal logic programs. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol.\u00a04790, pp. 454\u2013468. Springer, Heidelberg (2007)"},{"key":"32_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-540-92995-6_18","volume-title":"Practical Aspects of Declarative Languages","author":"L.M. Pereira","year":"2008","unstructured":"Pereira, L.M., Pinto, A.M.: Layered models top-down querying of normal logic programs. In: Gill, A., Swift, T. (eds.) PADL 2009. LNCS, vol.\u00a05418, pp. 254\u2013268. Springer, Heidelberg (2008)"},{"key":"32_CR25","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF03037171","volume":"9","author":"T. Przymusinski","year":"1991","unstructured":"Przymusinski, T.: Stable semantics for disjunctive programs. New Generation Computing\u00a09, 401\u2013424 (1991)","journal-title":"New Generation Computing"},{"key":"32_CR26","doi-asserted-by":"crossref","unstructured":"Przymusinski, T.C.: On the declarative semantics of deductive databases and logic programs. In: Minker (ed.) [16], pp. 193\u2013216","DOI":"10.1016\/B978-0-934613-40-8.50009-9"},{"key":"32_CR27","unstructured":"Sacc\u00e0, D., Zaniolo, C.: Partial models and three-valued stable models in logic programs with negation. In: Subrahmanian, V., et al. (eds.) Proc. LPNMR 1991, pp. 87\u2013101. MIT Press (1991)"},{"key":"32_CR28","doi-asserted-by":"crossref","unstructured":"Sakama, C., Inoue, K.: Paraconsistent stable semantics for extended disjunctive programs. J. Log. Comput. 5(3), 265\u2013285 (1995)","DOI":"10.1093\/logcom\/5.3.265"},{"key":"32_CR29","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/BFb0054790","volume-title":"Logic Programming and Knowledge Representation","author":"D. Seipel","year":"1998","unstructured":"Seipel, D.: Partial evidential stable models for disjunctive deductive databases. In: Dix, J., Moniz Pereira, L., Przymusinski, T.C. (eds.) LPKR 1997. LNCS (LNAI), vol.\u00a01471, pp. 66\u201384. Springer, Heidelberg (1998)"},{"issue":"2","key":"32_CR30","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R.E. Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM J. Comput.\u00a01(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"32_CR31","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A. van Gelder","year":"1991","unstructured":"van Gelder, A., Ross, K., Schlipf, J.: The well-founded semantics for general logic programs. J. ACM\u00a038(3), 620\u2013650 (1991)","journal-title":"J. ACM"},{"key":"32_CR32","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/S0022-0000(05)80053-4","volume":"49","author":"J.H. You","year":"1994","unstructured":"You, J.H., Yuan, L.: A three-valued semantics for deductive databases and logic programs. J. Comput. Syst. Sci.\u00a049, 334\u2013361 (1994)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11558-0_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T10:16:40Z","timestamp":1674814600000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-11558-0_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319115573","9783319115580"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11558-0_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}