{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:12:02Z","timestamp":1743106322864,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"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_8","type":"book-chapter","created":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T06:02:40Z","timestamp":1704780160000},"page":"116-133","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Direct ASP Encoding for Declare"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7855-7480","authenticated-orcid":false,"given":"Francesco","family":"Chiariello","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7018-1324","authenticated-orcid":false,"given":"Valeria","family":"Fionda","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0006-9644-7975","authenticated-orcid":false,"given":"Antonio","family":"Ielo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8218-3178","authenticated-orcid":false,"given":"Francesco","family":"Ricca","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,10]]},"reference":[{"key":"8_CR1","unstructured":"A Guide To The Project Management Body Of Knowledge (PMBOK Guides). Project Management Institute, 2004. ISBN: 193069945X"},{"key":"8_CR2","doi-asserted-by":"publisher","unstructured":"van der Aalst, W.M.P.: Process mining: a 360 degree overview. In: van der Aalst, W.M.P., Carmona, J. (eds.) Process Mining Handbook. LNBIP, vol. 448, pp. 3\u201334. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-08848-3_1","DOI":"10.1007\/978-3-031-08848-3_1"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"van der Aalst, W.M.P.: The application of petri nets to workflow management. J. Circuits Syst. Comput. 8(1), 21\u201366 (1998)","DOI":"10.1142\/S0218126698000043"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"van der Aalst, W.M., Pesic, M., Schonenberg, H.: Declarative workflows: balancing between flexibility and support. Comput. Sci. Res. Dev. 23(2), 99\u2013113 (2009)","DOI":"10.1007\/s00450-009-0057-9"},{"key":"8_CR5","unstructured":"Alviano, M.: The pyrunlim tool (2014). https:\/\/github.com\/alviano\/python\/tree\/master\/pyrunlim"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92\u2013103 (2011)","DOI":"10.1145\/2043174.2043195"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Calimeri, F., et al.: ASP-Core-2 input language format. Theory Pract. Log. Program. 20(2), 294\u2013309 (2020)","DOI":"10.1017\/S1471068419000450"},{"key":"8_CR8","doi-asserted-by":"publisher","unstructured":"Cecconi, A., et al.: Measuring the interestingness of temporal logic behavioral specifications in process mining. Inf. Syst. 107, 101920 (2022). https:\/\/doi.org\/10.1016\/j.is.2021.101920","DOI":"10.1016\/j.is.2021.101920"},{"key":"8_CR9","doi-asserted-by":"publisher","unstructured":"Chan, W.: Temporal-logic queries. In: Emerson, E.A., Sistla, A.P. (eds.) Computer Aided Verification. CAV 2000. LNCS, vol. 1855, pp. 450\u2013463. Springer, Berlin, Heidelberg (2000). ISBN: 978-3-540-45047-4, https:\/\/doi.org\/10.1007\/10722167_34","DOI":"10.1007\/10722167_34"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Chiariello, F., Maggi, F.M., Patrizi, F.: ASP-based declarative process mining. In: AAAI, pp. 5539\u20135547. AAAI Press (2022)","DOI":"10.1609\/aaai.v36i5.20493"},{"key":"8_CR11","unstructured":"Chiariello, F., Maggi, F.M., Patrizi, F.: From LTL on process traces to finite-state automata. In: BPM, vol. 3469, pp. 127\u2013131. CEUR WP. CEUR-WS.org (2023)"},{"key":"8_CR12","doi-asserted-by":"publisher","unstructured":"Di Ciccio, C., Montali, M.: Declarative process specifications: reasoning, discovery, monitoring. In: van der Aalst, W.M.P., Carmona, J. (eds.) Process Mining Handbook. LNBIP, vol. 448, pp. 108\u2013152. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-08848-3_4","DOI":"10.1007\/978-3-031-08848-3_4"},{"key":"8_CR13","unstructured":"Donadello, I., et al.: Declare4Py: a python library for declarative process mining. In: BPM (PhD\/Demos), vol. 3216, pp. 117\u2013121. CEUR WP. CEURWS.org (2022)"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Dwyer, M.B., Avrunin, G.S., Corbett, J.C.: Patterns in property specifications for finite-state verification. In: ICSE. ACM, pp. 411\u2013420 (1999)","DOI":"10.1145\/302405.302672"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Erdem, E., Gelfond, M., Leone, N.: Applications of answer set programming. AI Mag. 37(3), 53\u201368 (2016)","DOI":"10.1609\/aimag.v37i3.2678"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Finkbeiner, B., Sipma, H.: Checking finite traces using alternating automata. Form. Meth. Syst. Des. 24(2), 101\u2013127 (2004)","DOI":"10.1023\/B:FORM.0000017718.28096.48"},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1613\/jair.1.11256","volume":"63","author":"V Fionda","year":"2018","unstructured":"Fionda, V., Greco, G.: LTL on finite and process traces: complexity results and a practical reasoner. J. Artif. Intell. Res. 63, 557\u2013623 (2018)","journal-title":"J. Artif. Intell. Res."},{"key":"8_CR18","doi-asserted-by":"publisher","unstructured":"Fionda, V., Ielo, A., Ricca, F.: Logic-based composition of business process models. In: Marquis, P., Son, T.C., Kern-Isberner, G. (eds.) Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, KR 2023, Rhodes, Greece, 2\u20138 September 2023, pp. 272\u2013281 (2023). https:\/\/doi.org\/10.24963\/KR.2023\/27","DOI":"10.24963\/KR.2023\/27"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Gebser, M., et al.: Answer Set Solving in Practice. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool Publishers, San Rafael (2012)","DOI":"10.1007\/978-3-031-01561-8"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Gebser, M., et al.: Multi-shot ASP solving with clingo. Theory Pract. Log. Program. 19(1), 27\u201382 (2019)","DOI":"10.1017\/S1471068418000054"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9.3\/4, 365\u2013386 (1991)","DOI":"10.1007\/BF03037169"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"De Giacomo, G., Favorito, M.: Compositional approach to translate LTLf\/LDLf into deterministic finite automata. In: ICAPS, pp. 122\u2013130. AAAI Press (2021)","DOI":"10.1609\/icaps.v31i1.15954"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"De Giacomo, G., De Masellis, R., Montali, M.: Reasoning on LTL on finite traces: insensitivity to infiniteness. In: AAAI, pp. 1027\u20131033. AAAI Press (2014)","DOI":"10.1609\/aaai.v28i1.8872"},{"key":"8_CR24","unstructured":"De Giacomo, G., Vardi, M.Y.: Linear temporal logic and linear dynamic logic on finite traces. In: IJCAI. IJCAI\/AAAI, pp. 854\u2013860 (2013)"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Greenman, B., et al.: Little tricky logic: misconceptions in the understanding of LTL. Art Sci. Eng. Program. 7(2) (2023)","DOI":"10.22152\/programming-journal.org\/2023\/7\/7"},{"key":"8_CR26","unstructured":"Ielo, A., Pontieri, L., Ricca, F.: Declarative mining of business processes via ASP. In: PMAI@IJCAI, vol. 3310, pp. 105\u2013108. CEUR WP. CEUR-WS.org (2022)"},{"key":"8_CR27","unstructured":"Ielo, A., et al.: Towards ILP-based LTLf passive learning. In: ILP 2023, (To Appear)"},{"key":"8_CR28","unstructured":"Kuhlmann, I., Corea, C., Grant, J.: An ASP-based framework for solving problems related to declarative process specifications. In: NMR, vol. 3464, pp. 129\u2013132. CEUR WP. CEUR-WS.org (2023)"},{"key":"8_CR29","doi-asserted-by":"publisher","unstructured":"Law, M.: Conflict-driven inductive logic programming. Theory Pract. Log. Program. 23(2), 387\u2013414 (2023). https:\/\/doi.org\/10.1017\/S1471068422000011","DOI":"10.1017\/S1471068422000011"},{"key":"8_CR30","doi-asserted-by":"crossref","unstructured":"De Leoni, M., Van Der Aalst, W.M.: Data-aware process mining: discovering decisions in processes using alignments. In: SAC. ACM, pp. 1454\u20131461 (2013)","DOI":"10.1145\/2480362.2480633"},{"key":"8_CR31","series-title":"Lecture Notes in Business Information Processing","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-030-37453-2_22","volume-title":"Business Process Management Workshops","author":"IF Lopes","year":"2019","unstructured":"Lopes, I.F., Ferreira, D.R.: A survey of process mining competitions: the BPI challenges 2011\u20132018. In: Di Francescomarino, C., Dijkman, R., Zdun, U. (eds.) BPM 2019. LNBIP, vol. 362, pp. 263\u2013274. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-37453-2_22"},{"key":"8_CR32","unstructured":"Niemel\u00e4, I.: Logic programs with stable model semantics as a constraint programming paradigm. Ann. Math. Artif. Intell. 25(3\u20134), 241\u2013273 (1999)"},{"key":"8_CR33","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: FOCS, pp. 46\u201357. IEEE Computer Society (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"8_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-662-45563-0_5","volume-title":"On the Move to Meaningful Internet Systems: OTM 2014 Conferences","author":"M R\u00e4im","year":"2014","unstructured":"R\u00e4im, M., Di Ciccio, C., Maggi, F.M., Mecella, M., Mendling, J.: Log-based understanding of business processes through temporal logic query checking. In: Meersman, R., et al. (eds.) OTM 2014. LNCS, vol. 8841, pp. 75\u201392. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45563-0_5"},{"key":"8_CR35","doi-asserted-by":"publisher","unstructured":"Son, T.C., et al.: Domain-dependent knowledge in answer set planning. ACM Trans. Comput. Log. 7(4), 613\u2013657 (2006). https:\/\/doi.org\/10.1145\/1183278.1183279","DOI":"10.1145\/1183278.1183279"},{"key":"8_CR36","doi-asserted-by":"publisher","unstructured":"Weske, M.: Business Process Management - Concepts, Languages, Architectures, Third Edition. Springer, Berlin, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-540-73522-9","DOI":"10.1007\/978-3-540-73522-9"},{"key":"8_CR37","unstructured":"White, S.A.: Introduction to BPMN. In: IBM 2.0 (2004)"}],"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_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T06:06:48Z","timestamp":1704780408000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-52038-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031520372","9783031520389"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-52038-9_8","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)"}}]}}