{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:42:35Z","timestamp":1742985755113,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208317"},{"type":"electronic","value":"9783642208324"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20832-4_10","type":"book-chapter","created":{"date-parts":[[2011,4,27]],"date-time":"2011-04-27T22:59:49Z","timestamp":1303945189000},"page":"148-163","source":"Crossref","is-referenced-by-count":3,"title":["Inspecting Side-Effects of Abduction in Logic Programs"],"prefix":"10.1007","author":[{"given":"Lu\u00eds","family":"Moniz Pereira","sequence":"first","affiliation":[]},{"given":"Alexandre Miguel","family":"Pinto","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"10_CR1","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1017\/S1471068403001960","volume":"4","author":"J.J. Alferes","year":"2004","unstructured":"Alferes, J.J., Pereira, L.M., Swift, T.: Abduction in well-founded semantics and generalized stable models via tabled dual programs. Theory and Practice of Logic Programming\u00a04(4), 383\u2013428 (2004)","journal-title":"Theory and Practice of Logic Programming"},{"issue":"5","key":"10_CR2","first-page":"497","volume":"1","author":"S. Brass","year":"2001","unstructured":"Brass, S., Dix, J., Freitag, B., Zukowski, U.: Transformation-based bottom-up computation of the well-founded model. TPLP\u00a01(5), 497\u2013538 (2001)","journal-title":"TPLP"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/11562931_14","volume-title":"Logic Programming","author":"H. Christiansen","year":"2005","unstructured":"Christiansen, H., Dahl, V.: HyProlog: A new logic programming language with assumptions and abduction. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol.\u00a03668, pp. 159\u2013173. Springer, Heidelberg (2005)"},{"key":"10_CR4","unstructured":"Citrigno, S., Eiter, T., Faber, W., Gottlob, G., Koch, C., Leone, N., Mateis, C., Pfeifer, G., Scarcello, F.: The dlv system: Model generator and advanced frontends (system description). In: 12th Workshop on Logic Programming (1997)"},{"key":"10_CR5","first-page":"686","volume-title":"Proceedings of the Joint International Conference and Symposium on Logic Programming","author":"M. Denecker","year":"1992","unstructured":"Denecker, M., De Schreye, D.: SLDNFA: An abductive procedure for normal abductive programs. In: Apt, K. (ed.) Proceedings of the Joint International Conference and Symposium on Logic Programming, Washington, USA, pp. 686\u2013700. The MIT Press, Cambridge (1992)"},{"issue":"1-2","key":"10_CR6","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0304-3975(96)00179-X","volume":"189","author":"T. Eiter","year":"1997","unstructured":"Eiter, T., Gottlob, G., Leone, N.: Abduction from logic programs: semantics and complexity. Theoretical Computer Science\u00a0189(1-2), 129\u2013177 (1997)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"10_CR7","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0743-1066(97)00026-5","volume":"33","author":"T.H. Fung","year":"1997","unstructured":"Fung, T.H., Kowalski, R.: The IFF proof procedure for abductive logic programming. J. Log. Prog.\u00a033(2), 151\u2013165 (1997)","journal-title":"J. Log. Prog."},{"issue":"3","key":"10_CR8","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A. Gelder Van","year":"1991","unstructured":"Van Gelder, A., Ross, K.A., Schlipf, J.S.: The well-founded semantics for general logic programs. J. of ACM\u00a038(3), 620\u2013650 (1991)","journal-title":"J. of ACM"},{"key":"10_CR9","first-page":"1070","volume-title":"ICLP\/SLP","author":"M. Gelfond","year":"1988","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: ICLP\/SLP, pp. 1070\u20131080. MIT Press, Cambridge (1988)"},{"issue":"2","key":"10_CR10","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0743-1066(95)00119-0","volume":"27","author":"K. Inoue","year":"1996","unstructured":"Inoue, K., Sakama, C.: A fixpoint characterization of abductive logic programs. Journal of Logic Programming\u00a027(2), 107\u2013136 (1996)","journal-title":"Journal of Logic Programming"},{"key":"10_CR11","first-page":"235","volume-title":"Handbook of Logic in AI and LP","author":"A. Kakas","year":"1998","unstructured":"Kakas, A., Kowalski, R., Toni, F.: The role of abduction in logic programming. In: Handbook of Logic in AI and LP, vol.\u00a05, pp. 235\u2013324. Oxford University Press, Oxford (1998)"},{"key":"10_CR12","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-63255-7_32","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"I. Niemel\u00e4","year":"1997","unstructured":"Niemel\u00e4, I., Simons, P.: Smodels - an implementation of the stable model and well-founded semantics for normal logic programs. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS (LNAI), vol.\u00a01265, pp. 420\u2013429. Springer, Heidelberg (1997)"},{"key":"10_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/3-540-46238-4_5","volume-title":"AI*IA 99:Advances in Artificial Intelligence","author":"F. Sadri","year":"2000","unstructured":"Sadri, F., Toni, F.: Abduction with negation as failure for active and reactive rules. In: Lamma, E., Mello, P. (eds.) AI*IA 1999. LNCS (LNAI), vol.\u00a01792, pp. 49\u201360. Springer, Heidelberg (2000)"},{"issue":"3-4","key":"10_CR14","first-page":"201","volume":"25","author":"T. Swift","year":"1999","unstructured":"Swift, T.: Tabling for non-monotonic programming. AMAI\u00a025(3-4), 201\u2013240 (1999)","journal-title":"AMAI"},{"key":"10_CR15","first-page":"633","volume-title":"Procedings of the 1994 International Symposium on Logic Programming, ILPS 1994","author":"T. Swift","year":"1994","unstructured":"Swift, T., Warren, D.S.: An abstract machine for SLG resolution: definite programs. In: Procedings of the 1994 International Symposium on Logic Programming, ILPS 1994, Symposia, Melbourne, pp. 633\u2013652. MIT Press, Cambridge (1994) ISBN 0-262-52191-1"}],"container-title":["Lecture Notes in Computer Science","Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20832-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T01:09:37Z","timestamp":1558573777000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20832-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208317","9783642208324"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20832-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}