Direct Encoding of Declare Constraints in ASP
Guardado en:
| Publicado en: | Theory and Practice of Logic Programming vol. 25, no. 1 (Jan 2025), p. 92 |
|---|---|
| Autor principal: | |
| Otros Autores: | , , |
| Publicado: |
Cambridge University Press
|
| Materias: | |
| Acceso en línea: | Citation/Abstract Full Text - PDF |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 3166673608 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 1471-0684 | ||
| 022 | |a 1475-3081 | ||
| 024 | 7 | |a 10.1017/S1471068424000486 |2 doi | |
| 035 | |a 3166673608 | ||
| 045 | 2 | |b d20250101 |b d20250131 | |
| 084 | |a 79011 |2 nlm | ||
| 100 | 1 | |a Chiariello, Francesco |u IRIT, ANITI, University of Toulouse, France, (e-mail: francesco.chiariello@irit.fr ) | |
| 245 | 1 | |a Direct Encoding of Declare Constraints in ASP | |
| 260 | |b Cambridge University Press |c Jan 2025 | ||
| 513 | |a Journal Article | ||
| 520 | 3 | |a 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>. | |
| 653 | |a Temporal logic | ||
| 653 | |a Semantics | ||
| 653 | |a Syntax | ||
| 653 | |a Mathematical programming | ||
| 653 | |a Computer models | ||
| 653 | |a Programming languages | ||
| 653 | |a Logic programming | ||
| 653 | |a Information systems | ||
| 653 | |a Declarative programming | ||
| 653 | |a Constraint modelling | ||
| 653 | |a Cognition & reasoning | ||
| 653 | |a Coding | ||
| 700 | 1 | |a Fionda, Valeria |u Università della Calabria, Rende, Italia, (e-mail: valeria.fionda@unical.it, antonio.ielo@unical.it, francesco.ricca@unical.it ) | |
| 700 | 1 | |a IELO, ANTONIO |u Università della Calabria, Rende, Italia, (e-mail: valeria.fionda@unical.it, antonio.ielo@unical.it, francesco.ricca@unical.it ) | |
| 700 | 1 | |a Ricca, Francesco |u Università della Calabria, Rende, Italia, (e-mail: valeria.fionda@unical.it, antonio.ielo@unical.it, francesco.ricca@unical.it ) | |
| 773 | 0 | |t Theory and Practice of Logic Programming |g vol. 25, no. 1 (Jan 2025), p. 92 | |
| 786 | 0 | |d ProQuest |t Advanced Technologies & Aerospace Database | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/3166673608/abstract/embedded/IZYTEZ3DIR4FRXA2?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text - PDF |u https://www.proquest.com/docview/3166673608/fulltextPDF/embedded/IZYTEZ3DIR4FRXA2?source=fedsrch |