{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T00:46:46Z","timestamp":1768524406919,"version":"3.49.0"},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2025,2,14]],"date-time":"2025-02-14T00:00:00Z","timestamp":1739491200000},"content-version":"unspecified","delay-in-days":44,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2025,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Answer set programming (ASP), a well-known declarative logic programming paradigm, has recently found practical application in Process Mining. In particular, ASP has been used to model tasks involving declarative specifications of business processes. In this area, <jats:sans-serif>Declare<\/jats:sans-serif> stands out as the most widely adopted declarative process modeling language, offering a means to model processes through sets of constraints valid traces must satisfy, that can be expressed in linear temporal logic over finite traces (LTL<jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S1471068424000486_inline1.png\"\/><jats:tex-math>$_{\\text {f}}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>). Existing ASP-based solutions encode <jats:sans-serif>Declare<\/jats:sans-serif> constraints by modeling the corresponding LTL<jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S1471068424000486_inline2.png\"\/><jats:tex-math>$_{\\text {f}}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> formula or its equivalent automaton which can be obtained using established techniques. In this paper, we introduce a novel encoding for <jats:sans-serif>Declare<\/jats:sans-serif> constraints that <jats:italic>directly<\/jats:italic> models their semantics as ASP rules, eliminating the need for intermediate representations. We assess the effectiveness of this novel approach on two Process Mining tasks by comparing it with alternative ASP encodings and a Python library for <jats:sans-serif>Declare<\/jats:sans-serif>.<\/jats:p>","DOI":"10.1017\/s1471068424000486","type":"journal-article","created":{"date-parts":[[2025,2,14]],"date-time":"2025-02-14T13:25:17Z","timestamp":1739539517000},"page":"92-131","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":1,"title":["Direct Encoding of Declare Constraints in ASP"],"prefix":"10.1017","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7855-7480","authenticated-orcid":false,"given":"FRANCESCO","family":"CHIARIELLO","sequence":"first","affiliation":[]},{"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":"56","published-online":{"date-parts":[[2025,2,14]]},"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068424000486","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,14]],"date-time":"2025-02-14T13:25:24Z","timestamp":1739539524000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068424000486\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["S1471068424000486"],"URL":"https:\/\/doi.org\/10.1017\/s1471068424000486","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1]]},"assertion":[{"value":"\u00a9 The Author(s), 2025. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https:\/\/creativecommons.org\/licenses\/by\/4.0\/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.","name":"license","label":"License","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}