{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:42:35Z","timestamp":1762101755438,"version":"3.40.3"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319232638"},{"type":"electronic","value":"9783319232645"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23264-5_44","type":"book-chapter","created":{"date-parts":[[2015,9,14]],"date-time":"2015-09-14T06:29:48Z","timestamp":1442212188000},"page":"531-544","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["The Design of the Sixth Answer Set Programming Competition"],"prefix":"10.1007","author":[{"given":"Martin","family":"Gebser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Maratea","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Ricca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,15]]},"reference":[{"key":"44_CR1","series-title":"Lecture Notes in Computer Science","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, vol. 8148, pp. 54\u201366. Springer, Heidelberg (2013)"},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"Alviano, M., Dodaro, C., Leone, N., Ricca, F.: Advances in Wasp. In: Proceedings of LPNMR 2015. Springer (2015)","DOI":"10.1007\/978-3-319-23264-5_5"},{"issue":"4\u20135","key":"44_CR3","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1017\/S1471068414000325","volume":"14","author":"M Alviano","year":"2014","unstructured":"Alviano, M., Dodaro, C., Ricca, F.: Anytime computation of cautious consequences in answer set programming. Theory Pract. Logic Program. 14(4\u20135), 755\u2013770 (2014)","journal-title":"Theory Pract. Logic Program."},{"key":"44_CR4","unstructured":"Alviano, M., Dodaro, C., Ricca, F.: Preliminary report on Wasp 2.0. In: Proceedings of NMR 2014, pp. 68\u201372. Vienna University of Technology (2014)"},{"key":"44_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/978-3-642-21311-3_4","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"M Aschinger","year":"2011","unstructured":"Aschinger, M., Drescher, C., Friedrich, G., Gottlob, G., Jeavons, P., Ryabokon, A., Thorstensen, E.: Optimization methods for the partner units problem. In: Achterberg, T., Beck, J.C. (eds.) CPAIOR 2011. LNCS, vol. 6697, pp. 4\u201319. Springer, Heidelberg (2011)"},{"key":"44_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-642-20895-9_33","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Balduccini","year":"2011","unstructured":"Balduccini, M.: Industrial-size scheduling with ASP+CP. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS, vol. 6645, pp. 284\u2013296. Springer, Heidelberg (2011)"},{"key":"44_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357","volume-title":"Knowledge Representation Reasoning and Declarative Problem Solving","author":"C Baral","year":"2003","unstructured":"Baral, C.: Knowledge Representation Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)"},{"key":"44_CR8","doi-asserted-by":"crossref","first-page":"59","DOI":"10.3233\/SAT190075","volume":"7","author":"D Berre","year":"2010","unstructured":"Berre, D., Parrain, A.: The Sat4j library, release 2.2. J. Satisfiability Boolean Model. Comput. 7, 59\u201364 (2010)","journal-title":"J. Satisfiability Boolean Model. Comput."},{"key":"44_CR9","doi-asserted-by":"crossref","unstructured":"Biewer, A., Andres, B., Gladigau, J., Schaub, T., Haubelt, C.: A symbolic system synthesis approach for hard real-time systems based on coordinated SMT-solving. In: Proceedings of DATE 2015, pp. 357\u2013362. ACM (2015)","DOI":"10.7873\/DATE.2015.0606"},{"key":"44_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/978-3-319-11558-0_12","volume-title":"Logics in Artificial Intelligence","author":"J Bomanson","year":"2014","unstructured":"Bomanson, J., Gebser, M., Janhunen, T.: Improving the normalization of weight rules in answer set programs. In: Ferm\u00e9, E., Leite, J. (eds.) JELIA 2014. LNCS, vol. 8761, pp. 166\u2013180. Springer, Heidelberg (2014)"},{"key":"44_CR11","unstructured":"Calimeri, F., Gebser, M., Maratea, M., Ricca, F.: The design of the fifth answer set programming competition. In: Technical Communications of ICLP 2014, http:\/\/arxiv.org\/abs\/1405.3710v4. CoRR (2014)"},{"issue":"3","key":"44_CR12","doi-asserted-by":"crossref","first-page":"297","DOI":"10.3233\/FI-2009-180","volume":"96","author":"D Pal\u00f9","year":"2009","unstructured":"Pal\u00f9, D., Dovier, A., Pontelli, E., Rossi, G.: GASP: Answer set programming with lazy grounding. Fundamenta Informaticae 96(3), 297\u2013322 (2009)","journal-title":"Fundamenta Informaticae"},{"key":"44_CR13","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-1-4615-1567-8_4","volume-title":"Logic-Based Artificial Intelligence","author":"T Eiter","year":"2000","unstructured":"Eiter, T., Faber, W., Leone, N., Pfeifer, G.: Declarative problem-solving using the DLV system. In: Minker, J. (ed.) Logic-Based Artificial Intelligence, pp. 79\u2013103. Kluwer Academic Publishers, Norwell (2000)"},{"issue":"3","key":"44_CR14","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/261124.261126","volume":"22","author":"T Eiter","year":"1997","unstructured":"Eiter, T., Gottlob, G., Mannila, H.: Disjunctive datalog. ACM Trans. Database Syst. 22(3), 364\u2013418 (1997)","journal-title":"ACM Trans. Database Syst."},{"key":"44_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/978-3-642-03754-2_2","volume-title":"Reasoning Web","author":"T Eiter","year":"2009","unstructured":"Eiter, T., Ianni, G., Krennwallner, T.: Answer set programming: a primer. In: Tessaris, S., Franconi, E., Eiter, T., Gutierrez, C., Handschuh, S., Rousset, M.-C., Schmidt, R.A. (eds.) Reasoning Web. LNCS, vol. 5689, pp. 40\u2013110. Springer, Heidelberg (2009)"},{"key":"44_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-540-27775-0_27","volume-title":"Logic Programming","author":"E Erdem","year":"2004","unstructured":"Erdem, E., Wong, M.D.F.: Rectilinear steiner tree construction using answer set programming. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 386\u2013399. Springer, Heidelberg (2004)"},{"key":"44_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-642-18469-7_21","volume-title":"Graph Drawing","author":"R Fulek","year":"2011","unstructured":"Fulek, R., Pach, J.: A computational approach to conway\u2019s thrackle conjecture. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 226\u2013237. Springer, Heidelberg (2011)"},{"key":"44_CR18","unstructured":"Gavanelli, M., Nonato, M., Peano, A., Alvisi, S., Franchini, M.: An ASP approach for the valves positioning optimization in a water distribution system. In: Proceedings of CILC 2012, pp. 134\u2013148 (2012). http:\/\/www.CEUR-WS.org"},{"key":"44_CR19","unstructured":"Gebser, M., Guziolowski, C., Ivanchev, M., Schaub, T., Siegel, A., Thiele, S., Veber, P.: Repair and prediction (under inconsistency) in large biological networks with answer set programming. In: Proceedings of KR 2010, pp. 497\u2013507. AAAI (2010)"},{"key":"44_CR20","doi-asserted-by":"crossref","unstructured":"Gebser, M., Janhunen, T., Rintanen, J.: Answer set programming as SAT modulo acyclicity. In: Proceedings of ECAI 2014, pp. 351\u2013356. IOS (2014)","DOI":"10.1007\/978-3-319-11558-0_10"},{"key":"44_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/978-3-319-11558-0_10","volume-title":"Logics in Artificial Intelligence","author":"M Gebser","year":"2014","unstructured":"Gebser, M., Janhunen, T., Rintanen, J.: SAT modulo graphs: acyclicity. In: Ferm\u00e9, E., Leite, J. (eds.) JELIA 2014. LNCS, vol. 8761, pp. 137\u2013151. Springer, Heidelberg (2014)"},{"issue":"4\u20135","key":"44_CR22","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1017\/S1471068411000329","volume":"11","author":"M Gebser","year":"2011","unstructured":"Gebser, M., Kaminski, R., Schaub, T.: Complex optimization in answer set programming. Theory Pract. Logic Program. 11(4\u20135), 821\u2013839 (2011)","journal-title":"Theory Pract. Logic Program."},{"key":"44_CR23","doi-asserted-by":"crossref","unstructured":"Gebser, M., Kaufmann, B., Schaub, T.: Advanced conflict-driven disjunctive answer set solving. In: Proceedings of IJCAI 2013, pp. 912\u2013918. IJCAI\/AAAI (2013)","DOI":"10.1007\/978-3-031-01561-8"},{"key":"44_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-642-20895-9_40","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Gebser","year":"2011","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T., Schneider, M.T., Ziller, S.: A portfolio solver for answer set programming: preliminary report. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS, vol. 6645, pp. 352\u2013357. Springer, Heidelberg (2011)"},{"key":"44_CR25","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.artint.2012.04.001","volume":"187\u2013188","author":"M Gebser","year":"2012","unstructured":"Gebser, M., Kaufmann, B., Schaub, T.: Conflict-driven answer set solving: from theory to practice. Artif. Intell. 187\u2013188, 52\u201389 (2012)","journal-title":"Artif. Intell."},{"key":"44_CR26","doi-asserted-by":"crossref","unstructured":"Gebser, M., Ryabokon, A., Schenner, G.: Combining heuristics for configuration problems using answer set programming. In: Proceedings of LPNMR 2015. Springer (2015)","DOI":"10.1007\/978-3-319-23264-5_32"},{"issue":"2\u20133","key":"44_CR27","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1017\/S1471068410000554","volume":"11","author":"M Gebser","year":"2011","unstructured":"Gebser, M., Schaub, T., Thiele, S., Veber, P.: Detecting inconsistencies in large biological networks with answer set programming. Theory Pract. Logic Program. 11(2\u20133), 323\u2013360 (2011)","journal-title":"Theory Pract. Logic Program."},{"issue":"1\u20132","key":"44_CR28","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0004-3702(02)00207-2","volume":"138","author":"M Gelfond","year":"2002","unstructured":"Gelfond, M., Leone, N.: Logic programming and knowledge representation - the A-Prolog perspective. Artif. Intell. 138(1\u20132), 3\u201338 (2002)","journal-title":"Artif. Intell."},{"key":"44_CR29","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, 365\u2013385 (1991)","journal-title":"New Gener. Comput."},{"issue":"4","key":"44_CR30","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. Reason. 36(4), 345\u2013377 (2006)","journal-title":"J. Autom. Reason."},{"issue":"1","key":"44_CR31","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.: Unfolding partiality and disjunctions in stable model semantics. ACM Trans. Comput. Logic 7(1), 1\u201337 (2006)","journal-title":"ACM Trans. Comput. Logic"},{"key":"44_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-642-23786-7_32","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"M Janota","year":"2011","unstructured":"Janota, M., Marques-Silva, J.: On deciding MUS membership with QBF. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 414\u2013428. Springer, Heidelberg (2011)"},{"issue":"3","key":"44_CR33","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. Logic 7(3), 499\u2013562 (2006)","journal-title":"ACM Trans. Comput. Logic"},{"key":"44_CR34","first-page":"613","volume-title":"Handbook of Satisfiability","author":"C Li","year":"2009","unstructured":"Li, C., Many\u00e0, F.: MaxSAT. In: Biere, A. (ed.) Handbook of Satisfiability, pp. 613\u2013631. IOS Press, Amsterdam (2009)"},{"issue":"1\u20132","key":"44_CR35","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0004-3702(02)00186-8","volume":"138","author":"V Lifschitz","year":"2002","unstructured":"Lifschitz, V.: Answer set programming and plan generation. Artif. Intell. 138(1\u20132), 39\u201354 (2002)","journal-title":"Artif. Intell."},{"issue":"1\u20132","key":"44_CR36","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. Artif. Intell. 157(1\u20132), 115\u2013137 (2004)","journal-title":"Artif. Intell."},{"key":"44_CR37","unstructured":"Liu, G., Janhunen, T., Niemel\u00e4, I.: Answer set programming via mixed integer programming. In: Proceedings of KR 2012, pp. 32\u201342. AAAI (2012)"},{"issue":"2","key":"44_CR38","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1017\/S1471068411000640","volume":"13","author":"M Manna","year":"2013","unstructured":"Manna, M., Ricca, F., Terracina, G.: Consistent query answering via ASP from different perspectives: theory and practice. Theory Pract. Logic Program. 13(2), 227\u2013252 (2013)","journal-title":"Theory Pract. Logic Program."},{"issue":"6","key":"44_CR39","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1017\/S1471068413000094","volume":"14","author":"M Maratea","year":"2014","unstructured":"Maratea, M., Pulina, L., Ricca, F.: A multi-engine approach to answer-set programming. Theory Pract. Logic Program. 14(6), 841\u2013868 (2014)","journal-title":"Theory Pract. Logic Program."},{"key":"44_CR40","doi-asserted-by":"crossref","unstructured":"Maratea, M., Pulina, L., Ricca, F.: Multi-level algorithm selection for ASP. In: Proceedings of LPNMR 2015. Springer (2015)","DOI":"10.1007\/978-3-319-23264-5_36"},{"key":"44_CR41","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-642-60085-2_17","volume-title":"The Logic Programming Paradigm: A 25-Year Perspective","author":"V Marek","year":"1999","unstructured":"Marek, V., Truszczy\u0144ski, M.: Stable models and an alternative logic programming paradigm. In: Apt, K.R., Marek, V.W., Truszczynski, M., Warren, D.S. (eds.) The Logic Programming Paradigm: A 25-Year Perspective, pp. 375\u2013398. Springer, Heidelberg (1999)"},{"key":"44_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-540-79719-7_20","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2008","author":"M Mari\u00ebn","year":"2008","unstructured":"Mari\u00ebn, M., Wittocx, J., Denecker, M., Bruynooghe, M.: SAT(ID): satisfiability of propositional logic extended with inductive definitions. In: Kleine B\u00fcning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol. 4996, pp. 211\u2013224. Springer, Heidelberg (2008)"},{"key":"44_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-642-41524-1_6","volume-title":"Applications of Declarative Programming and Knowledge Management","author":"M Nguyen","year":"2013","unstructured":"Nguyen, M., Janhunen, T., Niemel\u00e4, I.: Translating answer-set programs into bit-vector logic. In: Tompits, H., Abreu, S., Oetsch, J., P\u00fchrer, J., Seipel, D., Umeda, M., Wolf, A. (eds.) INAP\/WLP 2011. LNCS, vol. 7773, pp. 91\u2013109. Springer, Heidelberg (2013)"},{"issue":"3\u20134","key":"44_CR44","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. Ann. Math. Artif. Intell. 25(3\u20134), 241\u2013273 (1999)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"1\u20132","key":"44_CR45","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."},{"key":"44_CR46","doi-asserted-by":"crossref","unstructured":"Toni, L., Aparicio-Pardo, R., Simon, G., Blanc, A., Frossard, P.: Optimal set of video representations in adaptive streaming. In: Proceedings of MMSys 2014, pp. 271\u2013282. ACM (2014)","DOI":"10.1145\/2557642.2557652"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23264-5_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T11:28:30Z","timestamp":1676978910000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23264-5_44"}},"subtitle":["\u2013 Report \u2013"],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319232638","9783319232645"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23264-5_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"15 September 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}