{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:47:06Z","timestamp":1742928426412,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031157066"},{"type":"electronic","value":"9783031157073"}],"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_20","type":"book-chapter","created":{"date-parts":[[2022,8,26]],"date-time":"2022-08-26T11:02:47Z","timestamp":1661511767000},"page":"259-272","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Semantics for\u00a0Conditional Literals via\u00a0the\u00a0SM Operator"],"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":[[2022,8,29]]},"reference":[{"issue":"12","key":"20_CR1","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., Truszczy\u0144ski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92\u2013103 (2011). https:\/\/doi.org\/10.1145\/2043174.2043195","journal-title":"Commun. ACM"},{"issue":"5","key":"20_CR2","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."},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Fandinno, J., Hansen, Z., Lierler, Y.: Arguing correctness of asp programs with aggregates (2022), (Accepted to LPNMR-22)","DOI":"10.1007\/978-3-031-15707-3_15"},{"key":"20_CR4","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)","DOI":"10.1609\/aaai.v36i5.20504"},{"key":"20_CR5","unstructured":"Fandinno, J., Lifschitz, V.: Verification of locally tight programs (2022). http:\/\/www.cs.utexas.edu\/users\/ai-labpub-view.php?PubID=127938"},{"issue":"5","key":"20_CR6","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."},{"issue":"1","key":"20_CR7","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."},{"key":"20_CR8","unstructured":"Ferraris, P., Lee, J., Lifschitz, V., Palla, R.: Symmetric splitting in the general theory of stable models. In: Boutilier, C. (ed.) Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 797\u2013803. AAAI\/MIT Press (2009)"},{"key":"20_CR9","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":"20_CR10","unstructured":"Harrison, A., Lifschitz, V., Yang, F.: The semantics of gringo and infinitary propositional formulas. In: Baral, C., De Giacomo, G., Eiter, T. (eds.) Proceedings of the Fourteenth International Conference on Principles of Knowledge Representation and Reasoning (KR 2014). AAAI Press (2014)"},{"key":"20_CR11","doi-asserted-by":"publisher","unstructured":"Kaminski, R., Romero, J., Schaub, T., Wanko, P.: How to build your own ASP-based system?! Theory and Practice of Logic Programming, p. 1\u201363 (2021). https:\/\/doi.org\/10.1017\/S1471068421000508","DOI":"10.1017\/S1471068421000508"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Lifschitz, V.: Thirteen definitions of a stable model. In: Fields of Logic and Computation: Essays Dedicated to Yuri Gurevich on the Occasion of his 70th Birthday (2010)","DOI":"10.1007\/978-3-642-15025-8_24"},{"key":"20_CR13","doi-asserted-by":"publisher","unstructured":"Marek, V.W., Truszczy\u0144ski, M.: Stable Models and an Alternative Logic Programming Paradigm, pp. 375\u2013398. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-642-60085-2_17","DOI":"10.1007\/978-3-642-60085-2_17"},{"issue":"3","key":"20_CR14","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":"20_CR15","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":"Miroslaw Truszczynski","year":"2012","unstructured":"Truszczynski, Miroslaw: Connecting first-order ASP and the logic FO(ID) through reducts. In: Erdem, Esra, Lee, Joohyung, Lierler, Yuliya, Pearce, David (eds.) Correct Reasoning. LNCS, vol. 7265, pp. 543\u2013559. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30743-0_37"}],"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_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,25]],"date-time":"2022-11-25T21:33:43Z","timestamp":1669412023000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15707-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031157066","9783031157073"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15707-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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)"}}]}}