{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T20:57:55Z","timestamp":1768251475209,"version":"3.49.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030038397","type":"print"},{"value":"9783030038403","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-03840-3_17","type":"book-chapter","created":{"date-parts":[[2018,11,8]],"date-time":"2018-11-08T01:28:57Z","timestamp":1541640537000},"page":"225-237","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Answer Set Programming for Declarative Content Specification: A Scalable Partitioning-Based Approach"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0866-0834","authenticated-orcid":false,"given":"Francesco","family":"Calimeri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6993-0618","authenticated-orcid":false,"given":"Stefano","family":"Germano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0534-6425","authenticated-orcid":false,"given":"Giovambattista","family":"Ianni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6632-3492","authenticated-orcid":false,"given":"Francesco","family":"Pacenza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4341-9445","authenticated-orcid":false,"given":"Armando","family":"Pezzimenti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4187-8250","authenticated-orcid":false,"given":"Andrea","family":"Tucci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,9]]},"reference":[{"key":"17_CR1","volume-title":"Foundations of Databases: The Logical Level","year":"1995","unstructured":"Abiteboul, S., Hull, R., Vianu, V. (eds.): Foundations of Databases: The Logical Level. Addison-Wesley Longman Publishing Co., Inc., Boston (1995)"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Cal\u00ec, A., Gottlob, G., Lukasiewicz, T.: Tractable query answering over ontologies with datalog+\/$$-$$. In: Description Logics, CEUR Workshop Proceedings, vol. 477. CEUR-WS.org (2009)","DOI":"10.1007\/978-3-642-04329-1_12"},{"key":"17_CR3","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). https:\/\/doi.org\/10.1016\/j.artint.2015.09.008","journal-title":"Artif. Intell."},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-642-03754-2_2","volume-title":"Reasoning Web. Semantic Technologies for Information Systems","author":"T Eiter","year":"2009","unstructured":"Eiter, T., Ianni, G., Krennwallner, T.: Answer set programming: a primer. In: Tessaris, S., et al. (eds.) Reasoning Web 2009. LNCS, vol. 5689, pp. 40\u2013110. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03754-2_2"},{"issue":"3","key":"17_CR5","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1609\/aimag.v37i3.2678","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."},{"key":"17_CR6","doi-asserted-by":"publisher","unstructured":"Faber, W., Leone, N., Ricca, F.: Answer set programming. In: Wah, B.W. (ed.) Wiley Encyclopedia of Computer Science and Engineering. Wiley (2008) https:\/\/doi.org\/10.1002\/9780470050118.ecse226","DOI":"10.1002\/9780470050118.ecse226"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Fusc\u00e0, D., Germano, S., Zangari, J., Anastasio, M., Calimeri, F., Perri, S.: A framework for easing the development of applications embedding answer set programming. In: PPDP, pp. 38\u201349. ACM (2016)","DOI":"10.1145\/2967973.2968594"},{"key":"17_CR8","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). https:\/\/doi.org\/10.1613\/jair.5373","journal-title":"J. Artif. Intell. Res."},{"issue":"3\/4","key":"17_CR9","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":"3","key":"17_CR10","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1609\/aimag.v37i3.2672","volume":"37","author":"B Kaufmann","year":"2016","unstructured":"Kaufmann, B., Leone, N., Perri, S., Schaub, T.: Grounding and solving in answer set programming. AI Mag. 37(3), 25\u201332 (2016)","journal-title":"AI Mag."},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-319-21768-0_10","volume-title":"Reasoning Web. Web Logic Rules","author":"N Leone","year":"2015","unstructured":"Leone, N., Ricca, F.: Answer set programming: a tour from the basics to advanced development tools and industrial applications. In: Faber, W., Paschke, A. (eds.) Reasoning Web 2015. LNCS, vol. 9203, pp. 308\u2013326. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21768-0_10"},{"key":"17_CR12","unstructured":"Liebana, D.P., Samothrakis, S., Togelius, J., Schaul, T., Lucas, S.M.: General video game AI: competition, challenges and opportunities. In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 12\u201317 February 2016, Phoenix, Arizona, USA, pp. 4335\u20134337 (2016). http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI16\/paper\/view\/11853"},{"issue":"3","key":"17_CR13","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1609\/aimag.v37i3.2675","volume":"37","author":"Y Lierler","year":"2016","unstructured":"Lierler, Y., Maratea, M., Ricca, F.: Systems, engineering environments, and competitions. AI Mag. 37(3), 45\u201352 (2016)","journal-title":"AI Mag."},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Lifschitz, V.: Answer set planning. In: ICLP, pp. 23\u201337. MIT Press (1999)","DOI":"10.1007\/3-540-46767-X_28"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-319-42716-4_8","volume-title":"Procedural Content Generation in Games","author":"MJ Nelson","year":"2016","unstructured":"Nelson, M.J., Smith, A.M.: ASP with applications to mazes and levels. In: Shaker, N., Togelius, J., Nelson, M.J. (eds.) Procedural Content Generation in Games, pp. 143\u2013157. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-42716-4_8"},{"key":"17_CR16","doi-asserted-by":"publisher","unstructured":"Nielsen, T.S., Barros, G.A.B., Togelius, J., Nelson, M.J.: Towards generating arcade game rules with VGDL. In: 2015 IEEE Conference on Computational Intelligence and Games (CIG), pp. 185\u2013192, August 2015. https:\/\/doi.org\/10.1109\/CIG.2015.7317941","DOI":"10.1109\/CIG.2015.7317941"},{"key":"17_CR17","unstructured":"Ortiz, M.: Ontology based query answering: the story so far. In: Proceedings of AMW (2013). http:\/\/ceur-ws.org\/Vol-1087\/keynote3.pdf"},{"key":"17_CR18","unstructured":"P\u00e9rez-Li\u00e9bana, D., Liu, J., Khalifa, A., Gaina, R.D., Togelius, J., Lucas, S.M.: General video game AI: a multi-track framework for evaluating agents, games and content generation algorithms. CoRR abs\/1802.10363 (2018). http:\/\/arxiv.org\/abs\/1802.10363"},{"key":"17_CR19","series-title":"Computational Synthesis and Creative Systems","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-319-42716-4_3","volume-title":"Procedural Content Generation in Games","author":"N Shaker","year":"2016","unstructured":"Shaker, N., Liapis, A., Togelius, J., Lopes, R., Bidarra, R.: Constructive generation methods for dungeons and levels. In: Shaker, N., Togelius, M., Nelson, M.J. (eds.) Procedural Content Generation in Games. CSCS, pp. 31\u201355. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-42716-4_3"},{"key":"17_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-42716-4","volume-title":"Procedural Content Generation in Games","year":"2016","unstructured":"Shaker, N., Togelius, J., Nelson, M.J. (eds.): Procedural Content Generation in Games. CSACS. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-42716-4"},{"issue":"3","key":"17_CR21","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1109\/TCIAIG.2011.2158545","volume":"3","author":"AM Smith","year":"2011","unstructured":"Smith, A.M., Mateas, M.: Answer set programming for procedural content generation: a design space approach. IEEE Trans. Comput. Intell. AI in Games 3(3), 187\u2013200 (2011). https:\/\/doi.org\/10.1109\/TCIAIG.2011.2158545","journal-title":"IEEE Trans. Comput. Intell. AI in Games"},{"key":"17_CR22","doi-asserted-by":"publisher","unstructured":"Togelius, J., Kastbjerg, E., Schedl, D., Yannakakis, G.N.: What is procedural content generation?: Mario on the borderline. In: Proceedings of the 2Nd International Workshop on Procedural Content Generation in Games, PCGames 2011, pp. 3:1\u20133:6. ACM, New York (2011). https:\/\/doi.org\/10.1145\/2000919.2000922","DOI":"10.1145\/2000919.2000922"}],"updated-by":[{"DOI":"10.1007\/978-3-030-03840-3_42","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2019,1,10]],"date-time":"2019-01-10T00:00:00Z","timestamp":1547078400000}}],"container-title":["Lecture Notes in Computer Science","AI*IA 2018 \u2013 Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03840-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,31]],"date-time":"2019-10-31T21:51:04Z","timestamp":1572558664000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-03840-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030038397","9783030038403"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03840-3_17","relation":{"correction":[{"id-type":"doi","id":"10.1007\/978-3-030-03840-3_42","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"AI*IA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference of the Italian Association for Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trento","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aiia2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/aixia2018.fbk.eu\/index.php\/home\/","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"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"210","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"20% - 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"}},{"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"}},{"value":"2,5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}