Direct Encoding of Declare Constraints in ASP
Na minha lista:
| Publicado no: | Theory and Practice of Logic Programming vol. 25, no. 1 (Jan 2025), p. 92 |
|---|---|
| Autor principal: | |
| Outros Autores: | , , |
| Publicado em: |
Cambridge University Press
|
| Assuntos: | |
| Acesso em linha: | Citation/Abstract Full Text - PDF |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|
| Resumo: | 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, <sans-serif>Declare</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<inline-formula><inline-graphic mime-subtype="png" xlink:href="S1471068424000486_inline1.png" />\(_{\text {f}}\)</inline-formula>). Existing ASP-based solutions encode <sans-serif>Declare</sans-serif> constraints by modeling the corresponding LTL<inline-formula><inline-graphic mime-subtype="png" xlink:href="S1471068424000486_inline2.png" />\(_{\text {f}}\)</inline-formula> formula or its equivalent automaton which can be obtained using established techniques. In this paper, we introduce a novel encoding for <sans-serif>Declare</sans-serif> constraints that directly 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 <sans-serif>Declare</sans-serif>. |
|---|---|
| ISSN: | 1471-0684 1475-3081 |
| DOI: | 10.1017/S1471068424000486 |
| Fonte: | Advanced Technologies & Aerospace Database |