Cited By
View all- Chiariello FIelo ATarzariol A(2024)An ILASP-Based Approach to Repair Petri NetsLogic Programming and Nonmonotonic Reasoning10.1007/978-3-031-74209-5_7(85-97)Online publication date: 11-Oct-2024
A Direct ASP Encoding for Declare
Pages 116 - 133
Abstract
Answer Set Programming (ASP), a well-known declarative programming paradigm, has recently found practical application in Process Mining, particularly in tasks involving declarative specifications of business processes. Declare is the most popular declarative process modeling language. It provides a way to model processes by sets of constraints, expressed in Linear Temporal Logic over Finite Traces (LTL), that valid traces must satisfy. Existing ASP-based solutions encode a Declare constraint by the corresponding LTL formula or its equivalent automaton, derived using well-established techniques. In this paper, we propose a novel encoding for Declare constraints, which models their semantics directly as ASP rules, without resorting to intermediate representations. We evaluate the effectiveness of the novel approach on two Process Mining tasks by comparing it to alternative ASP encodings and a Python library for Declare .
References
[1]
A Guide To The Project Management Body Of Knowledge (PMBOK Guides). Project Management Institute, 2004. ISBN: 193069945X
[2]
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–34. Springer, Cham (2022).
[3]
van der Aalst, W.M.P.: The application of petri nets to workflow management. J. Circuits Syst. Comput. 8(1), 21–66 (1998)
[4]
van der Aalst, W.M., Pesic, M., Schonenberg, H.: Declarative workflows: balancing between flexibility and support. Comput. Sci. Res. Dev. 23(2), 99–113 (2009)
[5]
Alviano, M.: The pyrunlim tool (2014). https://github.com/alviano/python/tree/master/pyrunlim
[6]
Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92–103 (2011)
[7]
Calimeri, F., et al.: ASP-Core-2 input language format. Theory Pract. Log. Program. 20(2), 294–309 (2020)
[8]
Cecconi, A., et al.: Measuring the interestingness of temporal logic behavioral specifications in process mining. Inf. Syst. 107, 101920 (2022).
[9]
Chan, W.: Temporal-logic queries. In: Emerson, E.A., Sistla, A.P. (eds.) Computer Aided Verification. CAV 2000. LNCS, vol. 1855, pp. 450–463. Springer, Berlin, Heidelberg (2000). ISBN: 978-3-540-45047-4,
[10]
Chiariello, F., Maggi, F.M., Patrizi, F.: ASP-based declarative process mining. In: AAAI, pp. 5539–5547. AAAI Press (2022)
[11]
Chiariello, F., Maggi, F.M., Patrizi, F.: From LTL on process traces to finite-state automata. In: BPM, vol. 3469, pp. 127–131. CEUR WP. CEUR-WS.org (2023)
[12]
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–152. Springer, Cham (2022).
[13]
Donadello, I., et al.: Declare4Py: a python library for declarative process mining. In: BPM (PhD/Demos), vol. 3216, pp. 117–121. CEUR WP. CEURWS.org (2022)
[14]
Dwyer, M.B., Avrunin, G.S., Corbett, J.C.: Patterns in property specifications for finite-state verification. In: ICSE. ACM, pp. 411–420 (1999)
[15]
Erdem, E., Gelfond, M., Leone, N.: Applications of answer set programming. AI Mag. 37(3), 53–68 (2016)
[16]
Finkbeiner, B., Sipma, H.: Checking finite traces using alternating automata. Form. Meth. Syst. Des. 24(2), 101–127 (2004)
[17]
Fionda V and Greco G LTL on finite and process traces: complexity results and a practical reasoner J. Artif. Intell. Res. 2018 63 557-623
[18]
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–8 September 2023, pp. 272–281 (2023).
[19]
Gebser, M., et al.: Answer Set Solving in Practice. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool Publishers, San Rafael (2012)
[20]
Gebser, M., et al.: Multi-shot ASP solving with clingo. Theory Pract. Log. Program. 19(1), 27–82 (2019)
[21]
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9.3/4, 365–386 (1991)
[22]
De Giacomo, G., Favorito, M.: Compositional approach to translate LTLf/LDLf into deterministic finite automata. In: ICAPS, pp. 122–130. AAAI Press (2021)
[23]
De Giacomo, G., De Masellis, R., Montali, M.: Reasoning on LTL on finite traces: insensitivity to infiniteness. In: AAAI, pp. 1027–1033. AAAI Press (2014)
[24]
De Giacomo, G., Vardi, M.Y.: Linear temporal logic and linear dynamic logic on finite traces. In: IJCAI. IJCAI/AAAI, pp. 854–860 (2013)
[25]
Greenman, B., et al.: Little tricky logic: misconceptions in the understanding of LTL. Art Sci. Eng. Program. 7(2) (2023)
[26]
Ielo, A., Pontieri, L., Ricca, F.: Declarative mining of business processes via ASP. In: PMAI@IJCAI, vol. 3310, pp. 105–108. CEUR WP. CEUR-WS.org (2022)
[27]
Ielo, A., et al.: Towards ILP-based LTLf passive learning. In: ILP 2023, (To Appear)
[28]
Kuhlmann, I., Corea, C., Grant, J.: An ASP-based framework for solving problems related to declarative process specifications. In: NMR, vol. 3464, pp. 129–132. CEUR WP. CEUR-WS.org (2023)
[29]
Law, M.: Conflict-driven inductive logic programming. Theory Pract. Log. Program. 23(2), 387–414 (2023).
[30]
De Leoni, M., Van Der Aalst, W.M.: Data-aware process mining: discovering decisions in processes using alignments. In: SAC. ACM, pp. 1454–1461 (2013)
[31]
Lopes IF and Ferreira DR Di Francescomarino C, Dijkman R, and Zdun U A survey of process mining competitions: the BPI challenges 2011–2018 Business Process Management Workshops 2019 Cham Springer 263-274
[32]
Niemelä, I.: Logic programs with stable model semantics as a constraint programming paradigm. Ann. Math. Artif. Intell. 25(3–4), 241–273 (1999)
[33]
Pnueli, A.: The temporal logic of programs. In: FOCS, pp. 46–57. IEEE Computer Society (1977)
[34]
Räim M, Di Ciccio C, Maggi FM, Mecella M, Mendling J, et al. Meersman R et al. Log-based understanding of business processes through temporal logic query checking On the Move to Meaningful Internet Systems: OTM 2014 Conferences 2014 Heidelberg Springer 75-92
[35]
Son, T.C., et al.: Domain-dependent knowledge in answer set planning. ACM Trans. Comput. Log. 7(4), 613–657 (2006).
[36]
Weske, M.: Business Process Management - Concepts, Languages, Architectures, Third Edition. Springer, Berlin, Heidelberg (2019).
[37]
White, S.A.: Introduction to BPMN. In: IBM 2.0 (2004)
Index Terms
- A Direct ASP Encoding for Declare
Index terms have been assigned to the content through auto-classification.
Recommendations
First-order ASP programs as CHR programs
SAC '21: Proceedings of the 36th Annual ACM Symposium on Applied ComputingWe present in this paper a way to use the paradigm of Answer Set Programming (ASP) into the Constraint Handling Rules (CHR) paradigm. We present a translation of the ASP language to the Constraint Handling Rules language.
The committed-choice principle ...
Automaton-based comparison of Declare process models
AbstractThe Declare process modeling language has been established within the research community for modeling so-called flexible processes. Declare follows the declarative modeling paradigm and therefore guarantees flexible process execution. For several ...
Efficient discovery of Target-Branched Declare constraints
Process discovery is the task of generating process models from event logs. Mining processes that operate in an environment of high variability is an ongoing research challenge because various algorithms tend to produce spaghetti-like process models. ...
Comments
Information & Contributors
Information
Published In
Jan 2024
237 pages
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 15 January 2024
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 16 Feb 2025
Other Metrics
Citations
Cited By
View all- Chiariello FIelo ATarzariol A(2024)An ILASP-Based Approach to Repair Petri NetsLogic Programming and Nonmonotonic Reasoning10.1007/978-3-031-74209-5_7(85-97)Online publication date: 11-Oct-2024