{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:38:36Z","timestamp":1725748716575},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642408847"},{"type":"electronic","value":"9783642408854"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40885-4_8","type":"book-chapter","created":{"date-parts":[[2013,9,11]],"date-time":"2013-09-11T11:20:19Z","timestamp":1378898419000},"page":"103-119","source":"Crossref","is-referenced-by-count":5,"title":["Abduction in Logic Programming as Second-Order Quantifier Elimination"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Wernhard","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"8_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 Pract. Log. Program.\u00a04(4), 383\u2013428 (2004)","journal-title":"Theory and Pract. Log. Program."},{"issue":"3","key":"8_CR2","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.tcs.2006.11.006","volume":"371","author":"D. Calvanese","year":"2007","unstructured":"Calvanese, D., Giacomo, G.D., Lenzerini, M., Vardi, M.Y.: View-based query processing: On the relationship between rewriting, answering and losslessness. Theor. Comp. Sci.\u00a0371(3), 169\u2013182 (2007)","journal-title":"Theor. Comp. Sci."},{"key":"8_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/3-540-45628-7_16","volume-title":"Computational Logic: Logic Programming and Beyond","author":"M. Denecker","year":"2002","unstructured":"Denecker, M., Kakas, A.C.: Abduction in logic programming. In: Kakas, A.C., Sadri, F. (eds.) Computat. Logic (Kowalski Festschrift). LNCS (LNAI), vol.\u00a02407, pp. 402\u2013436. Springer, Heidelberg (2002)"},{"issue":"3","key":"8_CR4","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1023\/A:1005722130532","volume":"18","author":"P. Doherty","year":"1997","unstructured":"Doherty, P., \u0141ukaszewicz, W., Sza\u0142as, A.: Computing circumscription revisited: A reduction algorithm. J. Autom. Reasoning\u00a018(3), 297\u2013338 (1997)","journal-title":"J. Autom. Reasoning"},{"key":"8_CR5","unstructured":"Doherty, P., \u0141ukaszewicz, W., Sza\u0142as, A.: Computing strongest necessary and weakest sufficient conditions of first-order formulas. In: IJCAI 2001, pp. 145\u2013151. Morgan Kaufmann (2001)"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/11499107_5","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2005","unstructured":"E\u00e9n, N., Biere, A.: Effective preprocessing in SAT through variable and clause elimination. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol.\u00a03569, pp. 61\u201375. Springer, Heidelberg (2005)"},{"key":"8_CR7","unstructured":"Egly, U., Eiter, T., Tompits, H., Woltran, S.: Solving advanced reasoning tasks using quantified Boolean formulas. In: AAAI 2000, pp. 417\u2013422. AAAI Press (2000)"},{"issue":"1-2","key":"8_CR8","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. Theor. Comp. Sci.\u00a0189(1-2), 129\u2013177 (1997)","journal-title":"Theor. Comp. Sci."},{"issue":"14","key":"8_CR9","doi-asserted-by":"publisher","first-page":"1644","DOI":"10.1016\/j.artint.2008.05.002","volume":"172","author":"T. Eiter","year":"2008","unstructured":"Eiter, T., Wang, K.: Semantic forgetting in answer set programming. Artif. Intell.\u00a0172(14), 1644\u20131672 (2008)","journal-title":"Artif. Intell."},{"issue":"1","key":"8_CR10","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.artint.2010.04.011","volume":"175","author":"P. Ferraris","year":"2011","unstructured":"Ferraris, P., Lee, J., Lifschitz, V.: Stable models and circumscription. Artif. Intell.\u00a0175(1), 236\u2013263 (2011)","journal-title":"Artif. Intell."},{"key":"8_CR11","unstructured":"Gabbay, D.M., Schmidt, R.A., Sza\u0142as, A.: Second-Order Quantifier Elimination: Foundations, Computational Aspects and Applications. College Publications (2008)"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-01929-6_7","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"M. Gebser","year":"2009","unstructured":"Gebser, M., Kaufmann, B., Schaub, T.: Solution enumeration for projected boolean search problems. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol.\u00a05547, pp. 71\u201386. Springer, Heidelberg (2009)"},{"issue":"2-3","key":"8_CR13","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0004-3702(92)90030-2","volume":"56","author":"K. Inoue","year":"1992","unstructured":"Inoue, K.: Linear resolution for consequence finding. Artif. Intell.\u00a056(2-3), 301\u2013353 (1992)","journal-title":"Artif. Intell."},{"issue":"1","key":"8_CR14","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0743-1066(97)10001-2","volume":"35","author":"K. Inoue","year":"1998","unstructured":"Inoue, K., Sakama, C.: Negation as failure in the head. J. Log. Program.\u00a035(1), 39\u201378 (1998)","journal-title":"J. Log. Program."},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0743-1066(99)00076-X","volume":"44","author":"N. Iwayama","year":"2000","unstructured":"Iwayama, N., Satoh, K.: Computing abduction by using TMS with top-down expectation. J. Log. Program.\u00a044, 179\u2013206 (2000)","journal-title":"J. Log. Program."},{"issue":"1","key":"8_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1119439.1119440","volume":"7","author":"T. Janhunen","year":"2006","unstructured":"Janhunen, T., Niemel\u00e4, I., Seipel, D., Simons, P., You, J.H.: Unfolding partiality and disjunctions in stable model semantics. ACM Trans. Comput. Log.\u00a07(1), 1\u201337 (2006)","journal-title":"ACM Trans. Comput. Log."},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Kakas, A.C., Kowalski, R.A., Toni, F.: The role of abduction in logic programming. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A. (eds.) Handbook of Logic in Artifical Intelligence, vol.\u00a05, pp. 235\u2013324. Oxford University Press (1998)","DOI":"10.1093\/oso\/9780198537922.003.0007"},{"key":"8_CR18","unstructured":"Kakas, A.C., Mancarella, P.: Generalized stable models: A semantics for abduction. In: ECAI 1990, pp. 385\u2013391. Pitman (1990)"},{"key":"8_CR19","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1613\/jair.1113","volume":"18","author":"J. Lang","year":"2003","unstructured":"Lang, J., Liberatore, P., Marquis, P.: Propositional independence \u2013 formula-variable independence and forgetting. J. of Artif. Intell. Res.\u00a018, 391\u2013443 (2003)","journal-title":"J. of Artif. Intell. Res."},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-540-89982-2_8","volume-title":"Logic Programming","author":"V. Lifschitz","year":"2008","unstructured":"Lifschitz, V.: Twelve definitions of a stable model. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol.\u00a05366, pp. 37\u201351. Springer, Heidelberg (2008)"},{"key":"8_CR21","unstructured":"Lin, F.: A Study of Nonmonotonic Reasoning. Ph.D. thesis, Stanford Univ. (1991)"},{"issue":"1-2","key":"8_CR22","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0004-3702(01)00070-4","volume":"128","author":"F. Lin","year":"2001","unstructured":"Lin, F.: On strongest necessary and weakest sufficient conditions. Artif. Intell.\u00a0128(1-2), 143\u2013159 (2001)","journal-title":"Artif. Intell."},{"issue":"1\/2","key":"8_CR23","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0004-3702(02)00227-8","volume":"140","author":"F. Lin","year":"2002","unstructured":"Lin, F., You, J.H.: Abduction in logic programming: A new definition and an abductive procedure based on rewriting. Artif. Intell.\u00a0140(1\/2), 175\u2013205 (2002)","journal-title":"Artif. Intell."},{"issue":"4","key":"8_CR24","doi-asserted-by":"crossref","first-page":"445","DOI":"10.3233\/FI-1990-13404","volume":"13","author":"T. Przymusinski","year":"1990","unstructured":"Przymusinski, T.: Well-founded semantics coincides with three-valued stable semantics. Fundam. Inform.\u00a013(4), 445\u2013464 (1990)","journal-title":"Fundam. Inform."},{"issue":"3\/4","key":"8_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 Gen. Comput.\u00a09(3\/4), 401\u2013424 (1991)","journal-title":"New Gen. Comput."},{"issue":"5","key":"8_CR26","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1093\/logcom\/7.5.555","volume":"7","author":"D. Sacc\u00e1","year":"1997","unstructured":"Sacc\u00e1, D., Zaniolo, C.: Deterministic and non-deterministic stable models. J. Log. Comput.\u00a07(5), 555\u2013579 (1997)","journal-title":"J. Log. Comput."},{"issue":"3","key":"8_CR27","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1016\/j.jal.2008.10.006","volume":"7","author":"C. Sakama","year":"2009","unstructured":"Sakama, C., Inoue, K.: Equivalence issues in abduction and induction. J. Applied Logic\u00a07(3), 318\u2013328 (2009)","journal-title":"J. Applied Logic"},{"issue":"2","key":"8_CR28","first-page":"89","volume":"16","author":"H. Tompits","year":"2003","unstructured":"Tompits, H.: Expressing default abduction problems as quantified Boolean formulas. AI Commun.\u00a016(2), 89\u2013105 (2003)","journal-title":"AI Commun."},{"key":"8_CR29","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-540-87803-2_32","volume-title":"Logics in Artificial Intelligence","author":"C. Wernhard","year":"2008","unstructured":"Wernhard, C.: Literal projection for first-order logic. In: H\u00f6lldobler, S., Lutz, C., Wansing, H. (eds.) JELIA 2008. LNCS (LNAI), vol.\u00a05293, pp. 389\u2013402. Springer, Heidelberg (2008)"},{"key":"8_CR30","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-642-02716-1_24","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"C. Wernhard","year":"2009","unstructured":"Wernhard, C.: Tableaux for projection computation and knowledge compilation. In: Giese, M., Waaler, A. (eds.) TABLEAUX 2009. LNCS (LNAI), vol.\u00a05607, pp. 325\u2013340. Springer, Heidelberg (2009)"},{"key":"8_CR31","unstructured":"Wernhard, C.: Circumscription and projection as primitives of logic programming. In: Tech. Comm. ICLP 2010. LIPIcs, vol.\u00a07, pp. 202\u2013211 (2010)"},{"key":"8_CR32","unstructured":"Wernhard, C.: Computing with logic as operator elimination: The ToyElim system. In: WLP 2011, pp. 94\u201398. Infsys Res. Rep. 1843-11-06, TU Wien (2011)"},{"issue":"9","key":"8_CR33","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1016\/j.jsc.2011.12.034","volume":"47","author":"C. Wernhard","year":"2012","unstructured":"Wernhard, C.: Projection and scope-determined circumscription. J. Symb. Comput.\u00a047(9), 1089\u20131108 (2012)","journal-title":"J. Symb. Comput."},{"key":"8_CR34","doi-asserted-by":"crossref","unstructured":"Wernhard, C.: Abduction in logic programming as second-order quantifier elimination (extended version). Tech. Rep. KRR 13-05, TU Dresden (2013)","DOI":"10.1007\/978-3-642-40885-4_8"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40885-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,6]],"date-time":"2022-03-06T00:52:17Z","timestamp":1646527937000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40885-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642408847","9783642408854"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40885-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}