{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T00:02:38Z","timestamp":1768435358257,"version":"3.49.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031157066","type":"print"},{"value":"9783031157073","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15707-3_29","type":"book-chapter","created":{"date-parts":[[2022,8,26]],"date-time":"2022-08-26T11:02:47Z","timestamp":1661511767000},"page":"373-386","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Solving Problems in the Polynomial Hierarchy with ASP(Q)"],"prefix":"10.1007","author":[{"given":"Giovanni","family":"Amendola","sequence":"first","affiliation":[]},{"given":"Bernardo","family":"Cuteri","sequence":"additional","affiliation":[]},{"given":"Francesco","family":"Ricca","sequence":"additional","affiliation":[]},{"given":"Mirek","family":"Truszczynski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,29]]},"reference":[{"key":"29_CR1","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, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23264-5_5"},{"key":"29_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103519","volume":"299","author":"G Amendola","year":"2021","unstructured":"Amendola, G., Dodaro, C., Faber, W., Ricca, F.: Paracoherent answer set computation. Artif. Intell. 299, 103519 (2021)","journal-title":"Artif. Intell."},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.artint.2016.01.011","volume":"234","author":"G Amendola","year":"2016","unstructured":"Amendola, G., Eiter, T., Fink, M., Leone, N., Moura, J.: Semi-equilibrium models for paracoherent answer set programs. Artif. Intell. 234, 219\u2013271 (2016)","journal-title":"Artif. Intell."},{"issue":"5\u20136","key":"29_CR4","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)","journal-title":"Theory Pract. Log. Program."},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"103185","DOI":"10.1016\/j.artint.2019.103185","volume":"279","author":"G Amendola","year":"2020","unstructured":"Amendola, G., Ricca, F., Truszczynski, M.: New models for generating hard random boolean formulas and disjunctive logic programs. Artif. Intell. 279, 103185 (2020)","journal-title":"Artif. Intell."},{"issue":"5\u20136","key":"29_CR6","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1017\/S1471068416000387","volume":"16","author":"B Bogaerts","year":"2016","unstructured":"Bogaerts, B., Janhunen, T., Tasharrofi, S.: Stable-unstable semantics: beyond NP with normal logic programs. Theory Pract. Log. Program. 16(5\u20136), 570\u2013586 (2016)","journal-title":"Theory Pract. Log. Program."},{"issue":"12","key":"29_CR7","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":"2","key":"29_CR8","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1017\/S1471068419000450","volume":"20","author":"F Calimeri","year":"2020","unstructured":"Calimeri, F., et al.: ASP-Core-2 input language format. Theory Pract. Log. Program. 20(2), 294\u2013309 (2020)","journal-title":"Theory Pract. Log. Program."},{"key":"29_CR9","doi-asserted-by":"publisher","unstructured":"Cao, F., Du, D.Z., Gao, B., Wan, P.J., Pardalos, P.M.: Minimax problems in combinatorial optimization. In: Du, DZ., Pardalos, P.M. (eds.) Minimax and Applications. Nonconvex Optimization and Its Applications, vol. 4, pp. 269\u2013292. Springer, Cham (1995). https:\/\/doi.org\/10.1007\/978-1-4613-3557-3_18","DOI":"10.1007\/978-1-4613-3557-3_18"},{"issue":"3","key":"29_CR10","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."},{"issue":"2","key":"29_CR11","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1017\/S1471068421000090","volume":"22","author":"C Dodaro","year":"2022","unstructured":"Dodaro, C., Galat\u00e0, G., Khan, M.K., Maratea, M., Porro, I.: Operating room (re)scheduling with bed management via ASP. Theory Pract. Log. Program. 22(2), 229\u2013253 (2022)","journal-title":"Theory Pract. Log. Program."},{"issue":"2","key":"29_CR12","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0004-3702(94)00041-X","volume":"77","author":"PM Dung","year":"1995","unstructured":"Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artif. Intell. 77(2), 321\u2013358 (1995)","journal-title":"Artif. Intell."},{"issue":"1\/2","key":"29_CR13","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0004-3702(02)00261-8","volume":"141","author":"PE Dunne","year":"2002","unstructured":"Dunne, P.E., Bench-Capon, T.J.M.: Coherence in finite argument systems. Artif. Intell. 141(1\/2), 187\u2013203 (2002)","journal-title":"Artif. Intell."},{"key":"29_CR14","unstructured":"Egly, U., Eiter, T., Tompits, H., Woltran, S.: Solving advanced reasoning tasks using quantified boolean formulas. In: Proceedings of IAAI 2000, pp. 417\u2013422. AAAI Press\/The MIT Press (2000)"},{"issue":"3\u20134","key":"29_CR15","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."},{"issue":"3","key":"29_CR16","first-page":"53","volume":"37","author":"E Erdem","year":"2016","unstructured":"Erdem, E., Gelfond, M., Leone, N.: Applications of answer set programming. AI Mag. 37(3), 53\u201368 (2016)","journal-title":"AI Mag."},{"issue":"5","key":"29_CR17","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. Theory Pract. Log. Program. 21(5), 663\u2013679 (2021)","journal-title":"Theory Pract. Log. Program."},{"key":"29_CR18","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, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23264-5_31"},{"key":"29_CR19","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1613\/jair.5373","volume":"60","author":"M Gebser","year":"2017","unstructured":"Gebser, M., Maratea, M., Ricca, F.: The sixth answer set programming competition. J. Artif. Intell. Res. 60, 41\u201395 (2017)","journal-title":"J. Artif. Intell. Res."},{"issue":"3\/4","key":"29_CR20","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 Generation Comput. 9(3\/4), 365\u2013386 (1991)","journal-title":"New Generation Comput."},{"key":"29_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-030-94479-7_9","volume-title":"Practical Aspects of Declarative Languages","author":"T Janhunen","year":"2022","unstructured":"Janhunen, T.: Implementing stable-unstable semantics with ASPTOOLS and\u00a0Clingo. In: Cheney, J., Perri, S. (eds.) PADL 2022. LNCS, vol. 13165, pp. 135\u2013153. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-94479-7_9"},{"issue":"1\u20132","key":"29_CR22","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."},{"key":"29_CR23","unstructured":"Romero, J., Schaub, T., Son, T.C.: Generalized answer set planning with incomplete information. In: ASPOCP@LPNMR, vol. 1868 of CEUR WS, CEUR-WS.org (2017)"},{"issue":"3","key":"29_CR24","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1093\/logcom\/5.3.265","volume":"5","author":"C Sakama","year":"1995","unstructured":"Sakama, C., Inoue, K.: Paraconsistent stable semantics for extended disjunctive programs. J. Log. Comput. 5(3), 265\u2013285 (1995)","journal-title":"J. Log. Comput."}],"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-031-15707-3_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,25]],"date-time":"2022-11-25T21:34:17Z","timestamp":1669412057000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15707-3_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031157066","9783031157073"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15707-3_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LPNMR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Logic Programming and Nonmonotonic Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Genoa","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lpnmr2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lpnmr2022.dibris.unige.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"57","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}