{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:39:07Z","timestamp":1742949547917,"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_51","type":"book-chapter","created":{"date-parts":[[2014,9,16]],"date-time":"2014-09-16T02:22:39Z","timestamp":1410834159000},"page":"674-683","source":"Crossref","is-referenced-by-count":0,"title":["Answer Set Solver Backdoors"],"prefix":"10.1007","author":[{"given":"Emilia","family":"Oikarinen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matti","family":"J\u00e4rvisalo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"51_CR1","series-title":"LNCS (LNAI)","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-40564-8_6","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M. Alviano","year":"2013","unstructured":"Alviano, M., Dodaro, C., Faber, W., Leone, N., Ricca, F.: WASP: A native ASP solver based on constraint learning. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS (LNAI), vol.\u00a08148, pp. 54\u201366. Springer, Heidelberg (2013)"},{"key":"51_CR2","series-title":"LNCS (LNAI)","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/11546207_39","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"C. Anger","year":"2005","unstructured":"Anger, C., Gebser, M., Linke, T., Neumann, A., Schaub, T.: The nomore++ system. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol.\u00a03662, pp. 422\u2013426. Springer, Heidelberg (2005)"},{"key":"51_CR3","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol.\u00a0185. IOS Press (2009)"},{"issue":"12","key":"51_CR4","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G. Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. Commun. ACM\u00a054(12), 92\u2013103 (2011)","journal-title":"Commun. ACM"},{"key":"51_CR5","unstructured":"Clark, K.: Negation as failure. In: Readings in Nonmonotonic Reasoning, pp. 311\u2013325. Morgan Kaufmann Publishers (1987)"},{"key":"51_CR6","unstructured":"Darwiche, A., Pipatsrisawat, K.: Complete algorithms. In: Biere et al [3], pp. 99\u2013130"},{"issue":"7","key":"51_CR7","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM\u00a05(7), 394\u2013397 (1962)","journal-title":"Communications of the ACM"},{"issue":"3","key":"51_CR8","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM\u00a07(3), 201\u2013215 (1960)","journal-title":"Journal of the ACM"},{"key":"51_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-642-01929-6_6","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"B.N. Dilkina","year":"2009","unstructured":"Dilkina, B.N., Gomes, C.P., Malitsky, Y., Sabharwal, A., Sellmann, M.: Backdoors to combinatorial optimization: Feasibility and optimality. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol.\u00a05547, pp. 56\u201370. Springer, Heidelberg (2009)"},{"issue":"4","key":"51_CR10","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s10472-014-9407-9","volume":"70","author":"B.N. Dilkina","year":"2014","unstructured":"Dilkina, B.N., Gomes, C.P., Sabharwal, A.: Tradeoffs in the complexity of backdoors to satisfiability: Dynamic sub-solvers and learning during search. Ann. Math. Artif. Intell.\u00a070(4), 399\u2013431 (2014)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"4-5","key":"51_CR11","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1017\/S1471068403001765","volume":"3","author":"E. Erdem","year":"2003","unstructured":"Erdem, E., Lifschitz, V.: Tight logic programs. Theory and Practice of Logic Programming\u00a03(4-5), 499\u2013518 (2003)","journal-title":"Theory and Practice of Logic Programming"},{"key":"51_CR12","first-page":"51","volume":"1","author":"F. Fages","year":"1994","unstructured":"Fages, F.: Consistency of Clark\u2019s completion and existence of stable models. Journal of Methods of Logic in Computer Science\u00a01, 51\u201360 (1994)","journal-title":"Journal of Methods of Logic in Computer Science"},{"key":"51_CR13","doi-asserted-by":"crossref","unstructured":"Fichte, J.K., Szeider, S.: Backdoors to normality for disjunctive logic programs. In: Proc. AAAI. AAAI Press (2013)","DOI":"10.1609\/aaai.v27i1.8624"},{"key":"51_CR14","unstructured":"Gebser, M., Schaub, T.: Characterizing ASP inferences by unit propagation. In: ICLP Workshop on Search and Logic: Answer Set Programming and SAT, Seattle, pp. 41\u201356 (August 16, 2006)"},{"key":"51_CR15","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.artint.2012.04.001","volume":"187","author":"M. Gebser","year":"2012","unstructured":"Gebser, M., Kaufmann, B., Schaub, T.: Conflict-driven answer set solving: From theory to practice. Artif. Intell.\u00a0187, 52\u201389 (2012)","journal-title":"Artif. Intell."},{"issue":"2","key":"51_CR16","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/2480759.2480767","volume":"14","author":"M. Gebser","year":"2013","unstructured":"Gebser, M., Schaub, T.: Tableau calculi for logic programs under answer set semantics. ACM Trans. Comput. Log.\u00a014(2), 15 (2013)","journal-title":"ACM Trans. Comput. Log."},{"key":"51_CR17","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proc. ICLP\/SLP 1988, pp. 1070\u20131080. MIT Press (1988)"},{"issue":"1-4","key":"51_CR18","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10472-009-9113-1","volume":"53","author":"E. Giunchiglia","year":"2008","unstructured":"Giunchiglia, E., Leone, N., Maratea, M.: On the relation among answer set solvers. Ann. Math. Artif. Intell.\u00a053(1-4), 169\u2013204 (2008)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"4","key":"51_CR19","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s10817-006-9033-2","volume":"36","author":"E. Giunchiglia","year":"2006","unstructured":"Giunchiglia, E., Lierler, Y., Maratea, M.: Answer set programming based on propositional satisfiability. Journal of Automated Reasoning\u00a036(4), 345\u2013377 (2006)","journal-title":"Journal of Automated Reasoning"},{"issue":"5-6","key":"51_CR20","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1017\/S1471068408003578","volume":"8","author":"M. J\u00e4rvisalo","year":"2008","unstructured":"J\u00e4rvisalo, M., Oikarinen, E.: Extended ASP tableaux and rule redundancy in normal logic programs. Theory and Practice of Logic Programming\u00a08(5-6), 691\u2013716 (2008)","journal-title":"Theory and Practice of Logic Programming"},{"issue":"3","key":"51_CR21","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/1149114.1149117","volume":"7","author":"N. Leone","year":"2006","unstructured":"Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic\u00a07(3), 499\u2013562 (2006)","journal-title":"ACM Transactions on Computational Logic"},{"key":"51_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-540-89982-2_35","volume-title":"Logic Programming","author":"Y. Lierler","year":"2008","unstructured":"Lierler, Y.: Abstract answer set solvers. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol.\u00a05366, pp. 377\u2013391. Springer, Heidelberg (2008)"},{"issue":"2-3","key":"51_CR23","first-page":"135","volume":"11","author":"Y. Lierler","year":"2011","unstructured":"Lierler, Y.: Abstract answer set solvers with backjumping and learning. TPLP\u00a011(2-3), 135\u2013169 (2011)","journal-title":"TPLP"},{"issue":"2","key":"51_CR24","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1145\/1131313.1131316","volume":"7","author":"V. Lifschitz","year":"2006","unstructured":"Lifschitz, V., Razborov, A.: Why are there so many loop formulas? ACM Transactions on Computational Logic 7(2), 261\u2013268 (2006)","journal-title":"ACM Transactions on Computational Logic"},{"issue":"1\u20132","key":"51_CR25","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.artint.2004.04.004","volume":"157","author":"F. Lin","year":"2004","unstructured":"Lin, F., Zhao, Y.: ASSAT: Computing answer sets of a logic program by SAT solvers. Artificial Intelligence\u00a0157(1\u20132), 115\u2013137 (2004)","journal-title":"Artificial Intelligence"},{"key":"51_CR26","unstructured":"Lin, Z., Zhang, Y., Hernandez, H.: Fast SAT-based answer set solver. In: Proc. AAAI, pp. 92\u201397. AAAI Press (2006)"},{"key":"51_CR27","unstructured":"Marques-Silva, J.P., Lynce, I., Malik, S.: Conflict-driven clause learning SAT solvers. In: Biere et al [3], pp. 131\u2013153"},{"issue":"3-4","key":"51_CR28","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1018930122475","volume":"25","author":"I. Niemel\u00e4","year":"1999","unstructured":"Niemel\u00e4, I.: Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence\u00a025(3-4), 241\u2013273 (1999)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"51_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-540-72788-0_23","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","author":"M. Samer","year":"2007","unstructured":"Samer, M., Szeider, S.: Backdoor sets of quantified boolean formulas. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol.\u00a04501, pp. 230\u2013243. Springer, Heidelberg (2007)"},{"issue":"1\u20132","key":"51_CR30","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\u20132), 181\u2013234 (2002)","journal-title":"Artificial Intelligence"},{"key":"51_CR31","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-540-24609-1_26","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"J. Ward","year":"2003","unstructured":"Ward, J., Schlipf, J.: Answer set programming with clause learning. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS (LNAI), vol.\u00a02923, pp. 302\u2013313. Springer, Heidelberg (2003)"},{"key":"51_CR32","unstructured":"Williams, R., Gomes, C.P., Selman, B.: Backdoors to typical case complexity. In: Proc. IJCAI, pp. 1173\u20131178. Morgan Kaufmann (2003)"}],"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_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T11:10:38Z","timestamp":1676891438000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-11558-0_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319115573","9783319115580"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11558-0_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}