{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:42:52Z","timestamp":1757540572052,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031849237"},{"type":"electronic","value":"9783031849244"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-84924-4_5","type":"book-chapter","created":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T12:01:20Z","timestamp":1742212880000},"page":"71-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["SM-Based Semantics for\u00a0Answer Set Programs Containing Conditional Literals and\u00a0Arithmetic"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8447-4048","authenticated-orcid":false,"given":"Zachary","family":"Hansen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6146-623X","authenticated-orcid":false,"given":"Yuliya","family":"Lierler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,18]]},"reference":[{"issue":"3","key":"5_CR1","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1017\/S1471068420000046","volume":"21","author":"D Abels","year":"2021","unstructured":"Abels, D., Jordi, J., Ostrowski, M., Schaub, T., Toletti, A., Wanko, P.: Train scheduling with hybrid answer set programming. Theory Pract. Logic Program. 21(3), 317\u2013347 (2021). https:\/\/doi.org\/10.1017\/S1471068420000046","journal-title":"Theory Pract. Logic Program."},{"unstructured":"Balduccini, M., Gelfond, M.: Model-based reasoning for complex flight systems. In: Proceedings of Infotech@Aerospace (American Institute of Aeronautics and Astronautics) (2005)","key":"5_CR2"},{"unstructured":"Balduccini, M., Gelfond, M., Nogueira, M., Watson, R., Barry, M.: An a-prolog decision support system for the Space Shuttle. In: Working Notes of the AAAI Spring Symposium on Answer Set Programming (2001)","key":"5_CR3"},{"doi-asserted-by":"publisher","unstructured":"Bomanson, J., Janhunen, T., Niemel\u00e4, I.: Applying visible strong equivalence in answer-set program transformations. ACM Trans. Comput. Logic 21(4) (2020). https:\/\/doi.org\/10.1145\/3412854","key":"5_CR4","DOI":"10.1145\/3412854"},{"issue":"5","key":"5_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. Logic Program. 20(5), 767\u2013782 (2020)","journal-title":"Theory Pract. Logic Program."},{"unstructured":"Cabalar, P., Mu\u00f1iz, B., P\u00e9rez, G., Su\u00e1rez, F.: Explainable machine learning for liver transplantation (2021). https:\/\/arxiv.org\/abs\/2109.13893","key":"5_CR6"},{"doi-asserted-by":"crossref","unstructured":"Fandinno, J., Hansen, Z., Lierler, Y.: Axiomatization of aggregates in answer set programming. In: Proceedings of the Thirty-Six National Conference on Artificial Intelligence (AAAI 2022). AAAI Press (2022)","key":"5_CR7","DOI":"10.1609\/aaai.v36i5.20504"},{"issue":"5","key":"5_CR8","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. Logic Program. 20(5), 735\u2013750 (2020)","journal-title":"Theory Pract. Logic Program."},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-031-15707-3_15","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"J Fandinno","year":"2022","unstructured":"Fandinno, J., Hansen, Z., Lierler, Y.: Arguing correctness of asp programs with aggregates. In: Gottlob, G., Inclezan, D., Maratea, M. (eds.) LPNMR 2022. LNCS, vol. 13416, pp. 190\u2013202. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15707-3_15"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1613\/jair.1.15786","volume":"80","author":"J Fandinno","year":"2024","unstructured":"Fandinno, J., Hansen, Z., Lierler, Y.: Axiomatization of non-recursive aggregates in first-order answer set programming. J. Artif. Intell. Res. 80, 977\u20131031 (2024). https:\/\/doi.org\/10.1613\/jair.1.15786","journal-title":"J. Artif. Intell. Res."},{"issue":"4","key":"5_CR11","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1017\/S1471068423000200","volume":"23","author":"J Fandinno","year":"2023","unstructured":"Fandinno, J., Hansen, Z., Lierler, Y., Lifschitz, V., Temple, N.: External behavior of a logic program and verification of refactoring. Theory Pract. Logic Program. 23(4), 933\u2013947 (2023). https:\/\/doi.org\/10.1017\/S1471068423000200","journal-title":"Theory Pract. Logic Program."},{"doi-asserted-by":"publisher","unstructured":"Fandinno, J., Lifschitz, V., Temple, N.: Locally tight programs. Theory Pract. Log. Program. 1\u201331 (2024). https:\/\/doi.org\/10.1017\/S147106842300039X","key":"5_CR12","DOI":"10.1017\/S147106842300039X"},{"issue":"1","key":"5_CR13","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.artint.2010.04.011","volume":"175","author":"P Ferraris","year":"2011","unstructured":"Ferraris, P., Lee, J., Lifschitz, V.: Stable models and circumscription. Artif. Intell. 175(1), 236\u2013263 (2011)","journal-title":"Artif. Intell."},{"unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Thiele, S.: A user\u2019s guide to gringo, clasp, clingo, and iclingo. http:\/\/potassco.org","key":"5_CR14"},{"issue":"4\u20135","key":"5_CR15","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1017\/S1471068415000150","volume":"15","author":"M Gebser","year":"2015","unstructured":"Gebser, M., Harrison, A., Kaminski, R., Lifschitz, V., Schaub, T.: Abstract gringo. Theory Pract. Logic Program. 15(4\u20135), 449\u2013463 (2015). https:\/\/doi.org\/10.1017\/S1471068415000150","journal-title":"Theory Pract. Logic Program."},{"issue":"3\u20134","key":"5_CR16","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1017\/S1471068418000200","volume":"18","author":"M Gebser","year":"2018","unstructured":"Gebser, M., et al.: Experimenting with robotic intra-logistics domains. Theory Pract. Logic Program. 18(3\u20134), 502\u2013519 (2018). https:\/\/doi.org\/10.1017\/S1471068418000200","journal-title":"Theory Pract. Logic Program."},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-031-15707-3_20","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"Z Hansen","year":"2022","unstructured":"Hansen, Z., Lierler, Y.: Semantics for conditional literals via the SM operator. In: Gottlob, G., Inclezan, D., Maratea, M. (eds.) LPNMR 2022. LNCS, vol. 13416, pp. 259\u2013272. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15707-3_20"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.artint.2017.02.002","volume":"246","author":"A Harrison","year":"2017","unstructured":"Harrison, A., Lifschitz, V., Pearce, D., Valverde, A.: Infinitary equilibrium logic and strongly equivalent logic programs. Artif. Intell. 246, 22\u201333 (2017). https:\/\/doi.org\/10.1016\/j.artint.2017.02.002","journal-title":"Artif. Intell."},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-540-24609-1_30","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"T Janhunen","year":"2003","unstructured":"Janhunen, T., Oikarinen, E.: LPEQ and DLPEQ\u2014translators for automated equivalence testing of logic programs. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 336\u2013340. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-24609-1_30"},{"doi-asserted-by":"publisher","unstructured":"Kaminski, R., Romero, J., Schaub, T., Wanko, P.: How to build your own ASP-based system?! Theory Pract. Log. Program. 1\u201363 (2021). https:\/\/doi.org\/10.1017\/S1471068421000508","key":"5_CR20","DOI":"10.1017\/S1471068421000508"},{"doi-asserted-by":"crossref","unstructured":"Lifschitz, V., L\u00fchne, P., Schaub, T.: Verifying strong equivalence of programs in the input language of gringo. In: Proceedings of the 15th International Conference on Logic Programming and Non-monotonic Reasoning (2019). http:\/\/www.cs.utexas.edu\/users\/ai-lab?verification","key":"5_CR21","DOI":"10.1007\/978-3-030-20528-7_20"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-030-75775-5_28","volume-title":"Logics in Artificial Intelligence","author":"V Lifschitz","year":"2021","unstructured":"Lifschitz, V.: Transforming gringo rules into formulas in a natural way. In: Faber, W., Friedrich, G., Gebser, M., Morak, M. (eds.) JELIA 2021. LNCS (LNAI), vol. 12678, pp. 421\u2013434. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75775-5_28"},{"issue":"4","key":"5_CR23","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1145\/383779.383783","volume":"2","author":"V Lifschitz","year":"2001","unstructured":"Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Trans. Comput. Log. 2(4), 526\u2013541 (2001). https:\/\/doi.org\/10.1145\/383779.383783","journal-title":"ACM Trans. Comput. Log."},{"key":"5_CR24","series-title":"Artificial Intelligence","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-642-60085-2_17","volume-title":"The Logic Programming Paradigm","author":"VW Marek","year":"1999","unstructured":"Marek, V.W., 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. Artificial Intelligence, pp. 375\u2013398. Springer, Heidelberg (1999)"},{"issue":"3","key":"5_CR25","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), 241\u2013273 (1999). https:\/\/doi.org\/10.1023\/A:1018930122475","journal-title":"Ann. Math. Artif. Intell."},{"key":"5_CR26","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-642-00675-3_16","volume-title":"Applications of Declarative Programming and Knowledge Management","author":"J Oetsch","year":"2009","unstructured":"Oetsch, J., Seidl, M., Tompits, H., Woltran, S.: Testing relativised uniform equivalence under answer-set projection in the system ccT. In: Seipel, D., Hanus, M., Wolf, A. (eds.) INAP\/WLP -2007. LNCS (LNAI), vol. 5437, pp. 241\u2013246. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00675-3_16"},{"key":"5_CR27","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-540-30227-8_18","volume-title":"Logics in Artificial Intelligence","author":"T Syrj\u00e4nen","year":"2004","unstructured":"Syrj\u00e4nen, T.: Cardinality constraint programs. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 187\u2013199. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30227-8_18"},{"key":"5_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-642-30743-0_37","volume-title":"Correct Reasoning","author":"M Truszczynski","year":"2012","unstructured":"Truszczynski, M.: Connecting first-order ASP and the logic FO(ID) through reducts. In: Erdem, E., Lee, J., Lierler, Y., Pearce, D. (eds.) Correct Reasoning. LNCS, vol. 7265, pp. 543\u2013559. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30743-0_37"},{"issue":"15","key":"5_CR29","doi-asserted-by":"publisher","first-page":"16993","DOI":"10.1007\/s10489-022-03272-2","volume":"52","author":"F Wotawa","year":"2022","unstructured":"Wotawa, F., Kaufmann, D.: Model-based reasoning using answer set programming. Appl. Intell. 52(15), 16993\u201317011 (2022). https:\/\/doi.org\/10.1007\/s10489-022-03272-2","journal-title":"Appl. Intell."}],"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-84924-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T12:01:23Z","timestamp":1742212883000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-84924-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031849237","9783031849244"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-84924-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"18 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors\u00a0have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"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":"Denver, CO","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 January 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 January 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"padl2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}