{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T20:13:45Z","timestamp":1768162425279,"version":"3.49.0"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032159809","type":"print"},{"value":"9783032159816","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-15981-6_12","type":"book-chapter","created":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T17:13:32Z","timestamp":1768151612000},"page":"199-217","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Solving Hard Combinatorial Optimization Problems with\u00a0PyQASP"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7133-2673","authenticated-orcid":false,"given":"Damiano","family":"Azzolini","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9742-1252","authenticated-orcid":false,"given":"Nicola","family":"Leone","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0125-0477","authenticated-orcid":false,"given":"Giuseppe","family":"Mazzotta","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8218-3178","authenticated-orcid":false,"given":"Francesco","family":"Ricca","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,12]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-319-61660-5_19","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Alviano","year":"2017","unstructured":"Alviano, M., et al.: The ASP system DLV2. In: Balduccini, M., Janhunen, T. (eds.) LPNMR 2017. LNCS (LNAI), vol. 10377, pp. 215\u2013221. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61660-5_19"},{"key":"12_CR2","doi-asserted-by":"publisher","unstructured":"Alviano, M., Dodaro, C.: Anytime answer set optimization via unsatisfiable core shrinking. Theory Pract. Log. Program. 16(5-6), 533\u2013551 (2016). https:\/\/doi.org\/10.1017\/S147106841600020X","DOI":"10.1017\/S147106841600020X"},{"key":"12_CR3","doi-asserted-by":"publisher","unstructured":"Alviano, M., Dodaro, C., Marques-Silva, J., Ricca, F.: Optimum stable model search: algorithms and implementation. J. Log. Comput. 30(4), 863\u2013897 (2020). https:\/\/doi.org\/10.1093\/LOGCOM\/EXV061","DOI":"10.1093\/LOGCOM\/EXV061"},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Amendola, G., Cuteri, B., Ricca, F., Truszczynski, M.: Solving problems in the polynomial hierarchy with ASP(Q). In: Proceedings of LPNMR. LNCS, vol. 13416, pp. 373\u2013386. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15707-3_29","DOI":"10.1007\/978-3-031-15707-3_29"},{"key":"12_CR5","doi-asserted-by":"publisher","unstructured":"Amendola, G., Ricca, F., Truszczynski, M.: Generating hard random boolean formulas and disjunctive logic programs. In: Sierra, C. (ed.) Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, 19\u201325 August 2017, pp. 532\u2013538. ijcai.org (2017). https:\/\/doi.org\/10.24963\/IJCAI.2017\/75","DOI":"10.24963\/IJCAI.2017\/75"},{"issue":"5\u20136","key":"12_CR6","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1017\/S1471068419000140","volume":"19","author":"G Amendola","year":"2019","unstructured":"Amendola, G., Ricca, F., Truszczynski, M.: Beyond NP: quantifying over answer sets. Theory Pract. Log. Program. 19(5\u20136), 705\u2013721 (2019). https:\/\/doi.org\/10.1017\/S1471068419000140","journal-title":"Theory Pract. Log. Program."},{"key":"12_CR7","doi-asserted-by":"publisher","unstructured":"Azzolini, D., Mazzotta, G., Ricca, F., Riguzzi, F.: Most probable explanation in probabilistic answer set programming. In: Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2025, Montreal, Canada, 16\u201322 August 2025, pp. 9049\u20139057 (2025). https:\/\/doi.org\/10.24963\/IJCAI.2025\/1006","DOI":"10.24963\/IJCAI.2025\/1006"},{"issue":"1","key":"12_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S1471068424000437","volume":"25","author":"D Azzolini","year":"2025","unstructured":"Azzolini, D., Riguzzi, F.: Probabilistic answer set programming with discrete and continuous random variables. Theory Pract. Log. Program. 25(1), 1\u201332 (2025)","journal-title":"Theory Pract. Log. Program."},{"key":"12_CR9","unstructured":"Beiser, A., Hecher, M., Unalan, K., Woltran, S.: Bypassing the ASP bottleneck: hybrid grounding by splitting and rewriting. In: IJCAI, pp. 3250\u20133258. ijcai.org (2024)"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-030-94479-7_2","volume-title":"Practical Aspects of Declarative Languages","author":"P Bellusci","year":"2022","unstructured":"Bellusci, P., Mazzotta, G., Ricca, F.: Modelling the outlier detection problem in ASP(Q). In: Cheney, J., Perri, S. (eds.) PADL 2022. LNCS, vol. 13165, pp. 15\u201323. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-94479-7_2"},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"Bogaerts, B., Janhunen, T., Tasharrofi, S.: Stable-unstable semantics: beyond NP with normal logic programs. Theory Pract. Log. Program. 16(5-6), 570\u2013586 (2016). https:\/\/doi.org\/10.1017\/S1471068416000387","DOI":"10.1017\/S1471068416000387"},{"issue":"12","key":"12_CR12","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 54(12), 92\u2013103 (2011)","journal-title":"Commun. ACM"},{"issue":"3","key":"12_CR13","first-page":"5","volume":"37","author":"G Brewka","year":"2016","unstructured":"Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming: an introduction to the special issue. AI Mag. 37(3), 5\u20136 (2016)","journal-title":"AI Mag."},{"issue":"5","key":"12_CR14","first-page":"845","volume":"12","author":"F Buccafurri","year":"2000","unstructured":"Buccafurri, F., Leone, N., Rullo, P.: Enhancing disjunctive datalog by constraints. TKDE 12(5), 845\u2013860 (2000)","journal-title":"TKDE"},{"key":"12_CR15","doi-asserted-by":"publisher","unstructured":"Calimeri, F., et al.: Asp-core-2 input language format. Theory Pract. Log. Program. 20(2), 294\u2013309 (2020). https:\/\/doi.org\/10.1017\/S1471068419000450","DOI":"10.1017\/S1471068419000450"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Cao, F., Du, D.Z., Gao, B., Wan, P.J., Pardalos, P.M.: Minimax Problems in Combinatorial Optimization, pp. 269\u2013292. Boston, MA (1995)","DOI":"10.1007\/978-1-4613-3557-3_18"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Ceri, S., Gottlob, G., Tanca, L.: Logic Programming and Databases. Surveys in Computer Science (1990)","DOI":"10.1007\/978-3-642-83952-8"},{"issue":"3","key":"12_CR18","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/502807.502810","volume":"33","author":"E Dantsin","year":"2001","unstructured":"Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and expressive power of logic programming. ACM Comput. Surv. 33(3), 374\u2013425 (2001)","journal-title":"ACM Comput. Surv."},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-030-31095-0_5","volume-title":"Rules and Reasoning","author":"C Dodaro","year":"2019","unstructured":"Dodaro, C., Galat\u00e0, G., Khan, M.K., Maratea, M., Porro, I.: An ASP-based solution for operating room scheduling with beds management. In: Fodor, P., Montali, M., Calvanese, D., Roman, D. (eds.) RuleML+RR 2019. LNCS, vol. 11784, pp. 67\u201381. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31095-0_5"},{"key":"12_CR20","doi-asserted-by":"publisher","unstructured":"Dodaro, C., Mazzotta, G., Ricca, F.: Blending grounding and compilation for efficient ASP solving. In: Marquis, P., Ortiz, M., Pagnucco, M. (eds.) Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning, KR 2024, Hanoi, Vietnam. 2\u20138 November 2024 (2024). https:\/\/doi.org\/10.24963\/KR.2024\/30","DOI":"10.24963\/KR.2024\/30"},{"key":"12_CR21","doi-asserted-by":"publisher","unstructured":"Eiter, T., Gottlob, G.: The complexity of logic-based abduction. J. ACM 42(1), 3\u201342 (1995). https:\/\/doi.org\/10.1145\/200836.200838","DOI":"10.1145\/200836.200838"},{"issue":"3\u20134","key":"12_CR22","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF01536399","volume":"15","author":"T Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: On the computational cost of disjunctive logic programming: propositional case. Ann. Math. Artif. Intell. 15(3\u20134), 289\u2013323 (1995)","journal-title":"Ann. Math. Artif. Intell."},{"key":"12_CR23","doi-asserted-by":"publisher","unstructured":"Faber, W., Mazzotta, G., Ricca, F.: An efficient solver for ASP(Q). Theory Pract. Log. Program. 23(4), 948\u2013964 (2023). https:\/\/doi.org\/10.1017\/S1471068423000121","DOI":"10.1017\/S1471068423000121"},{"key":"12_CR24","unstructured":"Faber, W., Morak, M.: Evaluating epistemic logic programs via answer set programming with quantifiers. In: HYDRA\/RCRA@LPNMR. CEUR Workshop Proceedings, vol.\u00a03281, pp. 78\u201389. CEUR-WS.org (2022)"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Faber, W., Morak, M., Chrpa, L.: Determining action reversibility in STRIPS using answer set programming with quantifiers. In: PADL. Lecture Notes in Computer Science, vol. 13165, pp. 42\u201356. Springer (2022)","DOI":"10.1007\/978-3-030-94479-7_4"},{"issue":"1","key":"12_CR26","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."},{"issue":"5","key":"12_CR27","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1017\/S1471068421000259","volume":"21","author":"J Fandinno","year":"2021","unstructured":"Fandinno, J., Laferri\u00e8re, F., Romero, J., Schaub, T., Son, T.C.: Planning with incomplete information in quantified answer set programming. TPLP 21(5), 663\u2013679 (2021). https:\/\/doi.org\/10.1017\/S1471068421000259","journal-title":"TPLP"},{"key":"12_CR28","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Wanko, P.: Theory solving made easy with clingo 5. In: ICLP (Technical Communications). OASICS, vol.\u00a052, pp. 2:1\u20132:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)"},{"issue":"4\u20135","key":"12_CR29","first-page":"821","volume":"11","author":"M Gebser","year":"2011","unstructured":"Gebser, M., Kaminski, R., Schaub, T.: Complex optimization in answer set programming. TPLP 11(4\u20135), 821\u2013839 (2011)","journal-title":"TPLP"},{"issue":"3\/4","key":"12_CR30","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."},{"key":"12_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-642-11503-5_5","volume-title":"Practical Aspects of Declarative Languages","author":"G Grasso","year":"2010","unstructured":"Grasso, G., Iiritano, S., Leone, N., Lio, V., Ricca, F., Scalise, F.: An ASP-based system for team-building in the gioia-tauro seaport. In: Carro, M., Pe\u00f1a, R. (eds.) PADL 2010. LNCS, vol. 5937, pp. 40\u201342. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11503-5_5"},{"key":"12_CR32","doi-asserted-by":"crossref","unstructured":"Marek, V.W., Truszczynski, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm - A 25-Year Perspective, pp. 375\u2013398 (1999)","DOI":"10.1007\/978-3-642-60085-2_17"},{"issue":"4","key":"12_CR33","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1017\/S1471068424000395","volume":"24","author":"G Mazzotta","year":"2024","unstructured":"Mazzotta, G., Ricca, F., Truszczynski, M.: Quantifying over optimum answer sets. Theory Pract. Log. Program. 24(4), 716\u2013736 (2024)","journal-title":"Theory Pract. Log. Program."},{"issue":"3\u20134","key":"12_CR34","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."},{"key":"12_CR35","unstructured":"Saikko, P., Wallner, J.P., J\u00e4rvisalo, M.: Implicit hitting set algorithms for reasoning beyond NP. In: KR, pp. 104\u2013113. AAAI Press (2016)"},{"issue":"3","key":"12_CR36","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1145\/582475.582484","volume":"33","author":"M Schaefer","year":"2002","unstructured":"Schaefer, M., Umans, C.: Completeness in the polynomial-time hierarchy: a compendium. SIGACT News 33(3), 32\u201349 (2002)","journal-title":"SIGACT News"}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-15981-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T17:13:33Z","timestamp":1768151613000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-15981-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032159809","9783032159816"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-15981-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"12 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PADL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Practical Aspects of Declarative Languages","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rennes","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 January 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 January 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"padl2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/popl26.sigplan.org\/home\/PADL-2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}