{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T04:16:08Z","timestamp":1749701768595,"version":"3.41.0"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319491295"},{"type":"electronic","value":"9783319491301"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-49130-1_12","type":"book-chapter","created":{"date-parts":[[2016,11,4]],"date-time":"2016-11-04T14:13:59Z","timestamp":1478268839000},"page":"149-163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Answer Set Enumeration via Assumption Literals"],"prefix":"10.1007","author":[{"given":"Mario","family":"Alviano","sequence":"first","affiliation":[]},{"given":"Carmine","family":"Dodaro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,5]]},"reference":[{"issue":"3\/4","key":"12_CR1","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 Gener. Comput. 9(3\/4), 365\u2013386 (1991)","journal-title":"New Gener. Comput."},{"issue":"4\u20135","key":"12_CR2","first-page":"755","volume":"14","author":"M Alviano","year":"2014","unstructured":"Alviano, M., Dodaro, C., Ricca, F.: Anytime computation of cautious consequences in answer set programming. TPLP 14(4\u20135), 755\u2013770 (2014)","journal-title":"TPLP"},{"key":"12_CR3","unstructured":"Bliem, B., Kaufmann, B., Schaub, T., Woltran, S.: ASP for anytime dynamic programming on tree decompositions. In: IJCAI. AAAI Press (2016)"},{"issue":"7","key":"12_CR4","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.W.: A machine program for theorem-proving. Commun. ACM 5(7), 394\u2013397 (1962)","journal-title":"Commun. ACM"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Brochenin, R., Lierler, Y., Maratea, M.: Abstract disjunctive answer set solvers. In: ECAI, vol. 263. Frontiers in Artificial Intelligence and Applications, pp. 165\u2013170. IOS Press (2014)","DOI":"10.3233\/978-1-61499-419-0-165"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/11562931_6","volume-title":"Logic Programming","author":"E Giunchiglia","year":"2005","unstructured":"Giunchiglia, E., Maratea, M.: On the relation between answer set and SAT procedures (or, Between cmodels and smodels). In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 37\u201351. Springer, Heidelberg (2005). doi:10.1007\/11562931_6"},{"issue":"3","key":"12_CR7","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 Trans. Comput. Log. 7(3), 499\u2013562 (2006)","journal-title":"ACM Trans. Comput. Log."},{"issue":"1\u20132","key":"12_CR8","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. Artif. Intell. 138(1\u20132), 181\u2013234 (2002)","journal-title":"Artif. Intell."},{"issue":"5","key":"12_CR9","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"JPM Silva","year":"1999","unstructured":"Silva, J.P.M., Sakallah, K.A.: GRASP: a search algorithm for propositional satisfiability. IEEE Trans. Comput. 48(5), 506\u2013521 (1999)","journal-title":"IEEE Trans. Comput."},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Zhang, L., Madigan, C.F., Moskewicz, M.W., Malik, S.: Efficient conflict driven learning in boolean satisfiability solver. In: ICCAD, pp. 279\u2013285. IEEE Computer Society (2001)","DOI":"10.1145\/774572.774637"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-642-33558-7_11","volume-title":"Principles and Practice of Constraint Programming","author":"G Audemard","year":"2012","unstructured":"Audemard, G., Simon, L.: Refining Restarts Strategies for SAT and UNSAT. In: Milano, M. (ed.) CP 2012. LNCS, vol. 7514, pp. 118\u2013126. Springer, Heidelberg (2012)"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-540-72200-7_13","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Gebser","year":"2007","unstructured":"Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set enumeration. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 136\u2013148. Springer, Heidelberg (2007). doi:10.1007\/978-3-540-72200-7_13"},{"key":"12_CR13","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. 187, 52\u201389 (2012)","journal-title":"Artif. Intell."},{"key":"12_CR14","unstructured":"Alviano, M., Dodaro, C., Ricca, F.: Reduct-based stability check using literal assumptions. In: ASPOCP (2015)"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Gebser, M., Kaufmann, B., Schaub, T.: Advanced conflict-driven disjunctive answer set solving. In: IJCAI, IJCAI\/AAAI (2013)","DOI":"10.1007\/978-3-031-01561-8"},{"issue":"1\u20132","key":"12_CR16","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0004-3702(03)00078-X","volume":"151","author":"C Koch","year":"2003","unstructured":"Koch, C., Leone, N., Pfeifer, G.: Enhancing disjunctive logic programming systems by SAT checkers. Artif. Intell. 151(1\u20132), 177\u2013212 (2003)","journal-title":"Artif. Intell."},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-319-23264-5_5","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Alviano","year":"2015","unstructured":"Alviano, M., Dodaro, C., Leone, N., Ricca, F.: Advances in WASP. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds.) LPNMR 2015. LNCS (LNAI), vol. 9345, pp. 40\u201354. Springer, Heidelberg (2015). doi:10.1007\/978-3-319-23264-5_5"},{"key":"12_CR18","unstructured":"Dodaro, C., Alviano, M., Faber, W., Leone, N., Ricca, F., Sirianni, M.: The birth of a WASP: preliminary report on a new ASP solver. In: Fioravanti, F. (ed.) CILC 2011, vol. 810. CEUR Workshop Proceedings, pp. 99\u2013113 (2011)"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-40564-8_5","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Alviano","year":"2013","unstructured":"Alviano, M., et al.: The fourth answer set programming competition: preliminary report. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS (LNAI), vol. 8148, pp. 42\u201353. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-40564-8_5"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.artint.2015.09.008","volume":"231","author":"F Calimeri","year":"2016","unstructured":"Calimeri, F., Gebser, M., Maratea, M., Ricca, F.: Design and results of the fifth answer set programming competition. Artif. Intell. 231, 151\u2013181 (2016)","journal-title":"Artif. Intell."},{"issue":"1","key":"12_CR21","first-page":"117","volume":"14","author":"F Calimeri","year":"2014","unstructured":"Calimeri, F., Ianni, G., Ricca, F.: The third open answer set programming competition. TPLP 14(1), 117\u2013135 (2014)","journal-title":"TPLP"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-319-23264-5_44","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Gebser","year":"2015","unstructured":"Gebser, M., Maratea, M., Ricca, F.: The design of the sixth answer set programming competition. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds.) LPNMR 2015. LNCS (LNAI), vol. 9345, pp. 531\u2013544. Springer, Heidelberg (2015). doi:10.1007\/978-3-319-23264-5_44"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Gebser, M., Maratea, M., Ricca, F.: What\u2019s hot in the answer set programming competition. In: AAAI, pp. 4327\u20134329. AAAI Press (2016)","DOI":"10.1609\/aaai.v30i1.9872"},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-319-23264-5_31","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Gebser","year":"2015","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Romero, J., Schaub, T.: Progress in clasp series 3. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds.) LPNMR 2015. LNCS (LNAI), vol. 9345, pp. 368\u2013383. Springer, Heidelberg (2015). doi:10.1007\/978-3-319-23264-5_31"},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-642-24206-9_17","volume-title":"Datalog Reloaded","author":"M Alviano","year":"2011","unstructured":"Alviano, M., Faber, W., Leone, N., Perri, S., Pfeifer, G., Terracina, G.: The disjunctive datalog system DLV. In: Moor, O., Gottlob, G., Furche, T., Sellers, A. (eds.) Datalog 2.0 2010. LNCS, vol. 6702, pp. 282\u2013301. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-24206-9_17"},{"issue":"1\u20133","key":"12_CR26","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.jalgor.2008.02.006","volume":"63","author":"M Maratea","year":"2008","unstructured":"Maratea, M., Ricca, F., Faber, W., Leone, N.: Look-back techniques and heuristics in DLV: implementation, evaluation, and comparison to QBF solvers. J. Algorithms 63(1\u20133), 70\u201389 (2008)","journal-title":"J. Algorithms"},{"key":"12_CR27","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","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. 8148, pp. 54\u201366. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-40564-8_6"},{"issue":"1\u20134","key":"12_CR28","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. 53(1\u20134), 169\u2013204 (2008)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"4","key":"12_CR29","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. J. Autom. Reasoning 36(4), 345\u2013377 (2006)","journal-title":"J. Autom. Reasoning"},{"key":"12_CR30","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-540-24609-1_32","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"Y Lierler","year":"2003","unstructured":"Lierler, Y., Maratea, M.: Cmodels-2: SAT-based answer set solver enhanced to non-tight programs. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 346\u2013350. Springer, Heidelberg (2003). doi:10.1007\/978-3-540-24609-1_32"},{"key":"12_CR31","unstructured":"Audemard, G., Simon, L.: Predicting learnt clauses quality in modern SAT solvers. In: IJCAI, pp. 399\u2013404 (2009)"},{"key":"12_CR32","doi-asserted-by":"crossref","unstructured":"Biere, A.: Lingeling essentials, a tutorial on design and implementation aspects of the the SAT solver lingeling. In: POS, vol. 27. EPiC Series, p. 88. EasyChair (2014)","DOI":"10.29007\/jhd7"},{"key":"12_CR33","unstructured":"Alviano, M., Faber, W.: Stable model semantics of abstract dialectical frameworks revisited: a logic programming perspective. In: IJCAI, pp. 2684\u20132690. AAAI Press (2015)"},{"key":"12_CR34","unstructured":"Brewka, G., Strass, H., Ellmauthaler, S., Wallner, J.P., Woltran, S.: Abstract dialectical frameworks revisited. In: IJCAI, IJCAI\/AAAI (2013)"},{"key":"12_CR35","unstructured":"Brewka, G., Woltran, S.: Abstract dialectical frameworks. In: KR, AAAI Press (2010)"},{"issue":"3\u20134","key":"12_CR36","doi-asserted-by":"publisher","first-page":"263","DOI":"10.3233\/FI-2015-1254","volume":"140","author":"S Bistarelli","year":"2015","unstructured":"Bistarelli, S., Rossi, F., Santini, F.: A comparative test on the enumeration of extensions in abstract argumentation. Fundam. Inform. 140(3\u20134), 263\u2013278 (2015)","journal-title":"Fundam. Inform."},{"issue":"1","key":"12_CR37","first-page":"102","volume":"37","author":"M Thimm","year":"2016","unstructured":"Thimm, M., Villata, S., Cerutti, F., Oren, N., Strass, H., Vallati, M.: Summary report of the first international competition on computational models of argumentation. AI Mag. 37(1), 102 (2016)","journal-title":"AI Mag."},{"key":"12_CR38","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-40564-8_7","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Alviano","year":"2013","unstructured":"Alviano, M., Faber, W.: The complexity boundary of answer set programming with generalized atoms under the FLP semantics. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS (LNAI), vol. 8148, pp. 67\u201372. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-40564-8_7"},{"issue":"4\u20135","key":"12_CR39","first-page":"559","volume":"15","author":"M Alviano","year":"2015","unstructured":"Alviano, M., Faber, W., Gebser, M.: Rewriting recursive aggregates in answer set programming: back to monotonicity. TPLP 15(4\u20135), 559\u2013573 (2015)","journal-title":"TPLP"},{"issue":"4\u20135","key":"12_CR40","first-page":"574","volume":"15","author":"M Alviano","year":"2015","unstructured":"Alviano, M., Leone, N.: Complexity and compilation of gz-aggregates in answer set programming. TPLP 15(4\u20135), 574\u2013587 (2015)","journal-title":"TPLP"},{"issue":"1","key":"12_CR41","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.artint.2010.04.002","volume":"175","author":"W Faber","year":"2011","unstructured":"Faber, W., Pfeifer, G., Leone, N.: Semantics and complexity of recursive aggregates in answer set programming. Artif. Intell. 175(1), 278\u2013298 (2011)","journal-title":"Artif. Intell."},{"key":"12_CR42","doi-asserted-by":"crossref","unstructured":"Alviano, M., Dodaro, C.: Anytime answer set optimization via unsatisfiable core shrinking. TPLP (2016, in press)","DOI":"10.1017\/S147106841600020X"},{"key":"12_CR43","doi-asserted-by":"crossref","unstructured":"Alviano, M., Dodaro, C., Marques-Silva, J., Ricca, F.: Optimum stable model search: algorithms and implementation. J. Logic Comput. (2015)","DOI":"10.1093\/logcom\/exv061"},{"key":"12_CR44","unstructured":"Alviano, M., Dodaro, C., Ricca, F.: A MaxSAT algorithm using cardinality constraints of bounded size. In: IJCAI 2015, pp. 2677\u20132683. AAAI Press (2015)"},{"key":"12_CR45","doi-asserted-by":"crossref","unstructured":"Fionda, V., Pirr\u00f2, G.: Querying graphs with preferences. In: CIKM, pp. 929\u2013938. ACM (2013)","DOI":"10.1145\/2505515.2505758"},{"key":"12_CR46","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2012.12.002","volume":"196","author":"V Fionda","year":"2013","unstructured":"Fionda, V., Greco, G.: The complexity of mixed multi-unit combinatorial auctions: tractability under structural and qualitative restrictions. Artif. Intell. 196, 1\u201325 (2013)","journal-title":"Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","AI*IA 2016 Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-49130-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T00:15:17Z","timestamp":1749687317000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-49130-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319491295","9783319491301"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49130-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"5 November 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AI*IA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference of the Italian Association for Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Genova","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"XV","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aiia2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.aixia2016.unige.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}