{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:29:47Z","timestamp":1742930987456,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031520372"},{"type":"electronic","value":"9783031520389"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-52038-9_6","type":"book-chapter","created":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T06:02:40Z","timestamp":1704780160000},"page":"82-99","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Rethinking Answer Set Programming Templates"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2052-2063","authenticated-orcid":false,"given":"Mario","family":"Alviano","sequence":"first","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-0002-6418-7711","authenticated-orcid":false,"given":"Jessica","family":"Zangari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,10]]},"reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s11334-021-00422-6","volume":"18","author":"EA AlOmar","year":"2022","unstructured":"AlOmar, E.A., Wang, T., Raut, V., Mkaouer, M.W., Newman, C.D., Ouni, A.: Refactoring for reuse: an empirical study. Innov. Syst. Softw. Eng. 18(1), 105\u2013135 (2022)","journal-title":"Innov. Syst. Softw. Eng."},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-030-75775-5_24","volume-title":"Logics in Artificial Intelligence","author":"G Amendola","year":"2021","unstructured":"Amendola, G., Berei, T., Ricca, F.: Testing in ASP: revisited language and programming environment. In: Faber, W., Friedrich, G., Gebser, M., Morak, M. (eds.) JELIA 2021. LNCS (LNAI), vol. 12678, pp. 362\u2013376. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75775-5_24"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/11799573_28","volume-title":"Logic Programming","author":"C Baral","year":"2006","unstructured":"Baral, C., Dzifcak, J., Takahashi, H.: Macros, macro calls and use of ensembles in modular answer set programming. In: Etalle, S., Truszczy\u0144ski, M. (eds.) ICLP 2006. LNCS, vol. 4079, pp. 376\u2013390. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11799573_28"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Bomanson, J., Janhunen, T., Niemel\u00e4, I.: Applying visible strong equivalence in answer-set program transformations. ACM Trans. Comput. Log. 21(4), 33:1\u201333:41 (2020)","DOI":"10.1145\/3412854"},{"issue":"5","key":"6_CR5","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1017\/S1471068420000265","volume":"20","author":"P Cabalar","year":"2020","unstructured":"Cabalar, P., Fandinno, J., Lierler, Y.: Modular answer set programming as a formal specification language. Theory Pract. Log. Program. 20(5), 767\u2013782 (2020)","journal-title":"Theory Pract. Log. Program."},{"issue":"2","key":"6_CR6","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."},{"issue":"3","key":"6_CR7","first-page":"193","volume":"19","author":"F Calimeri","year":"2006","unstructured":"Calimeri, F., Ianni, G.: Template programs for disjunctive logic programming: an operational semantics. AI Commun. 19(3), 193\u2013206 (2006)","journal-title":"AI Commun."},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-642-02846-5_16","volume-title":"Logic Programming","author":"M Dao-Tran","year":"2009","unstructured":"Dao-Tran, M., Eiter, T., Fink, M., Krennwallner, T.: Modular nonmonotonic logic programming revisited. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol. 5649, pp. 145\u2013159. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02846-5_16"},{"key":"6_CR9","unstructured":"Dao-Tran, M., Eiter, T., Fink, M., Krennwallner, T.: Distributed nonmonotonic multi-context systems. In: KR. AAAI Press (2010)"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/3-540-63255-7_22","volume-title":"Logic Programming And Nonmonotonic Reasoning","author":"T Eiter","year":"1997","unstructured":"Eiter, T., Gottlob, G., Veith, H.: Modular logic programming and generalized quantifiers. In: Dix, J., Furbach, U., Nerode, A. (eds.) LPNMR 1997. LNCS, vol. 1265, pp. 289\u2013308. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63255-7_22"},{"key":"6_CR11","unstructured":"Eiter, T., Tompits, H., Woltran, S.: On solution correspondences in answer-set programming. In: IJCAI, pp. 97\u2013102. Professional Book Center (2005)"},{"issue":"3","key":"6_CR12","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":"6_CR13","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1017\/S1471068420000344","volume":"20","author":"J Fandinno","year":"2020","unstructured":"Fandinno, J., Lifschitz, V., L\u00fchne, P., Schaub, T.: Verifying tight logic programs with anthem and vampire. Theory Pract. Log. Program. 20(5), 735\u2013750 (2020)","journal-title":"Theory Pract. Log. Program."},{"issue":"6","key":"6_CR14","doi-asserted-by":"publisher","first-page":"201","DOI":"10.3390\/a15060201","volume":"15","author":"J Fandinno","year":"2022","unstructured":"Fandinno, J., Pearce, D., Vidal, C., Woltran, S.: Comparing the reasoning capabilities of equilibrium theories and answer set programs. Algorithms 15(6), 201 (2022)","journal-title":"Algorithms"},{"key":"6_CR15","unstructured":"Febbraro, O., Reale, K., Ricca, F.: Testing ASP programs in ASPIDE. In: CILC. CEUR Workshop Proceedings, vol. 810, pp. 115\u2013129. CEUR-WS.org (2011)"},{"issue":"2\u20133","key":"6_CR16","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1017\/S1471068410000542","volume":"11","author":"M Fink","year":"2011","unstructured":"Fink, M.: A general framework for equivalences in answer-set programming by countermodels in the logic of here-and-there. Theory Pract. Log. Program. 11(2\u20133), 171\u2013202 (2011)","journal-title":"Theory Pract. Log. Program."},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/978-3-030-19570-0_36","volume-title":"Logics in Artificial Intelligence","author":"T Geibinger","year":"2019","unstructured":"Geibinger, T., Tompits, H.: Characterising relativised strong equivalence with projection for non-ground answer-set programs. In: Calimeri, F., Leone, N., Manna, M. (eds.) JELIA 2019. LNCS (LNAI), vol. 11468, pp. 542\u2013558. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19570-0_36"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-319-61660-5_21","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"A Gre\u00dfler","year":"2017","unstructured":"Gre\u00dfler, A., Oetsch, J., Tompits, H.: Harvey: a system for random testing in ASP. In: Balduccini, M., Janhunen, T. (eds.) LPNMR 2017. LNCS (LNAI), vol. 10377, pp. 229\u2013235. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61660-5_21"},{"key":"6_CR19","unstructured":"Heyting, A.: Die formalen regeln der intuitionistischen logik, pp. 42\u201356. De\u00fctsche Akademie der Wissenschaften zu Berlin, Mathematisch-Naturwissenschaftliche Klasse (1930)"},{"key":"6_CR20","unstructured":"Janhunen, T., Niemel\u00e4, I., Oetsch, J., P\u00fchrer, J., Tompits, H.: On testing answer-set programs. In: ECAI. Frontiers in Artificial Intelligence and Applications, vol. 215, pp. 951\u2013956. IOS Press (2010)"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-20895-9_26","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"T Janhunen","year":"2011","unstructured":"Janhunen, T., Niemel\u00e4, I., Oetsch, J., P\u00fchrer, J., Tompits, H.: Random vs. structure-based testing of answer-set programs: an experimental comparison. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS (LNAI), vol. 6645, pp. 242\u2013247. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20895-9_26"},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1613\/jair.2810","volume":"35","author":"T Janhunen","year":"2009","unstructured":"Janhunen, T., Oikarinen, E., Tompits, H., Woltran, S.: Modularity aspects of disjunctive stable models. J. Artif. Intell. Res. 35, 813\u2013857 (2009)","journal-title":"J. Artif. Intell. Res."},{"issue":"1","key":"6_CR23","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1017\/S1471068421000508","volume":"23","author":"R Kaminski","year":"2023","unstructured":"Kaminski, R., Romero, J., Schaub, T., Wanko, P.: How to build your own asp-based system?! Theory Pract. Log. Program. 23(1), 299\u2013361 (2023)","journal-title":"Theory Pract. Log. Program."},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Leach, P., Mealling, M., Salz, R.: A universally unique identifier (UUID) urn namespace. Internet Requests for Comments, July 2005. https:\/\/tools.ietf.org\/html\/rfc4122","DOI":"10.17487\/rfc4122"},{"issue":"5\u20136","key":"6_CR25","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1017\/S1471068417000345","volume":"17","author":"V Lifschitz","year":"2017","unstructured":"Lifschitz, V.: Achievements in answer set programming. Theory Pract. Log. Program. 17(5\u20136), 961\u2013973 (2017)","journal-title":"Theory Pract. Log. Program."},{"key":"6_CR26","doi-asserted-by":"publisher","unstructured":"Lifschitz, V.: Answer Set Programming. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24658-7","DOI":"10.1007\/978-3-030-24658-7"},{"key":"6_CR27","unstructured":"L\u00fchne, P.: Discovering and proving invariants in answer set programming and planning. CoRR abs\/1905.03196 (2019)"},{"key":"6_CR28","unstructured":"Oetsch, J., Prischink, M., P\u00fchrer, J., Schwengerer, M., Tompits, H.: On the small-scope hypothesis for testing answer-set programs. In: KR. AAAI Press (2012)"},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"Oetsch, J., Seidl, M., Tompits, H., Woltran, S.: Beyond uniform equivalence between answer-set programs. ACM Trans. Comput. Log. 22(1), 2:1\u20132:46 (2021)","DOI":"10.1145\/3422361"},{"issue":"1\u20132","key":"6_CR30","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10472-006-9028-z","volume":"47","author":"D Pearce","year":"2006","unstructured":"Pearce, D.: Equilibrium logic. Ann. Math. Artif. Intell. 47(1\u20132), 3\u201341 (2006)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"1","key":"6_CR31","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1017\/S1471068422000072","volume":"23","author":"TC Son","year":"2023","unstructured":"Son, T.C., Pontelli, E., Balduccini, M., Schaub, T.: Answer set planning: a survey. Theory Pract. Log. Program. 23(1), 226\u2013298 (2023)","journal-title":"Theory Pract. Log. Program."},{"issue":"4\u20135","key":"6_CR32","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1017\/S147106841200021X","volume":"12","author":"MD Vos","year":"2012","unstructured":"Vos, M.D., Kisa, D.G., Oetsch, J., P\u00fchrer, J., Tompits, H.: Annotating answer-set programs in LANA. Theory Pract. Log. Program. 12(4\u20135), 619\u2013637 (2012)","journal-title":"Theory Pract. Log. Program."}],"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-031-52038-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T06:06:01Z","timestamp":1704780361000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-52038-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031520372","9783031520389"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-52038-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"10 January 2024","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":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 January 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 January 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"padl2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/popl24.sigplan.org\/home\/PADL-2024","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","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":"13","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":"0","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":"52% - 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":"4","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":"4","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)"}}]}}