Skip to main content
SpringerLink
Log in

A Direct ASP Encoding for Declare

  • Conference paper
  • First Online:
Practical Aspects of Declarative Languages (PADL 2024)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14512))

Included in the following conference series:

  • 141 Accesses

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\(_\text {f}\)), that valid traces must satisfy. Existing ASP-based solutions encode a Declare constraint by the corresponding LTL\(_\text {f}\) 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 .

This work was partially supported by the Italian Ministry of Research (MUR) under PRIN project PINPOINT - CUP H23C22000280006, PRIN project HypeKG - CUP H53D23003710006, PRIN PNRR project DISTORT - CUP H53D23008170001, PNRR projects FAIR “Future AI Research” - Spoke 9 - WP9.1 and WP9.2- CUP H23C22000860006 and by the project “Borgo 4.0”, POR Campania FESR 2014–2020.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 64.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. A Guide To The Project Management Body Of Knowledge (PMBOK Guides). Project Management Institute, 2004. ISBN: 193069945X

    Google Scholar 

  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). https://doi.org/10.1007/978-3-031-08848-3_1

  3. van der Aalst, W.M.P.: The application of petri nets to workflow management. J. Circuits Syst. Comput. 8(1), 21–66 (1998)

    Google Scholar 

  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)

    Google Scholar 

  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)

    Google Scholar 

  7. Calimeri, F., et al.: ASP-Core-2 input language format. Theory Pract. Log. Program. 20(2), 294–309 (2020)

    Google Scholar 

  8. 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

  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, https://doi.org/10.1007/10722167_34

  10. Chiariello, F., Maggi, F.M., Patrizi, F.: ASP-based declarative process mining. In: AAAI, pp. 5539–5547. AAAI Press (2022)

    Google Scholar 

  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)

    Google Scholar 

  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). https://doi.org/10.1007/978-3-031-08848-3_4

  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)

    Google Scholar 

  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)

    Google Scholar 

  15. Erdem, E., Gelfond, M., Leone, N.: Applications of answer set programming. AI Mag. 37(3), 53–68 (2016)

    Google Scholar 

  16. Finkbeiner, B., Sipma, H.: Checking finite traces using alternating automata. Form. Meth. Syst. Des. 24(2), 101–127 (2004)

    Google Scholar 

  17. Fionda, V., Greco, G.: LTL on finite and process traces: complexity results and a practical reasoner. J. Artif. Intell. Res. 63, 557–623 (2018)

    Article  MathSciNet  Google Scholar 

  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). https://doi.org/10.24963/KR.2023/27

  19. Gebser, M., et al.: Answer Set Solving in Practice. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool Publishers, San Rafael (2012)

    Google Scholar 

  20. Gebser, M., et al.: Multi-shot ASP solving with clingo. Theory Pract. Log. Program. 19(1), 27–82 (2019)

    Google Scholar 

  21. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9.3/4, 365–386 (1991)

    Google Scholar 

  22. De Giacomo, G., Favorito, M.: Compositional approach to translate LTLf/LDLf into deterministic finite automata. In: ICAPS, pp. 122–130. AAAI Press (2021)

    Google Scholar 

  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)

    Google Scholar 

  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)

    Google Scholar 

  25. Greenman, B., et al.: Little tricky logic: misconceptions in the understanding of LTL. Art Sci. Eng. Program. 7(2) (2023)

    Google Scholar 

  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)

    Google Scholar 

  27. Ielo, A., et al.: Towards ILP-based LTLf passive learning. In: ILP 2023, (To Appear)

    Google Scholar 

  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)

    Google Scholar 

  29. Law, M.: Conflict-driven inductive logic programming. Theory Pract. Log. Program. 23(2), 387–414 (2023). https://doi.org/10.1017/S1471068422000011

  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)

    Google Scholar 

  31. Lopes, I.F., Ferreira, D.R.: A survey of process mining competitions: the BPI challenges 2011–2018. In: Di Francescomarino, C., Dijkman, R., Zdun, U. (eds.) BPM 2019. LNBIP, vol. 362, pp. 263–274. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-37453-2_22

    Chapter  Google Scholar 

  32. Niemelä, I.: Logic programs with stable model semantics as a constraint programming paradigm. Ann. Math. Artif. Intell. 25(3–4), 241–273 (1999)

    Google Scholar 

  33. Pnueli, A.: The temporal logic of programs. In: FOCS, pp. 46–57. IEEE Computer Society (1977)

    Google Scholar 

  34. Räim, 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–92. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-662-45563-0_5

    Chapter  Google Scholar 

  35. Son, T.C., et al.: Domain-dependent knowledge in answer set planning. ACM Trans. Comput. Log. 7(4), 613–657 (2006). https://doi.org/10.1145/1183278.1183279

  36. Weske, M.: Business Process Management - Concepts, Languages, Architectures, Third Edition. Springer, Berlin, Heidelberg (2019). https://doi.org/10.1007/978-3-540-73522-9

  37. White, S.A.: Introduction to BPMN. In: IBM 2.0 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Naples Federico II, Naples, Italy

    Francesco Chiariello

  2. University of Calabria, Rende, Italy

    Valeria Fionda, Antonio Ielo & Francesco Ricca

Authors
  1. Francesco Chiariello
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Valeria Fionda
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Antonio Ielo
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Francesco Ricca
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Antonio Ielo .

Editor information

Editors and Affiliations

  1. University of Klagenfurt, Klagenfurt, Austria

    Martin Gebser

  2. National University of Singapore, Singapore, Singapore

    Ilya Sergey

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Chiariello, F., Fionda, V., Ielo, A., Ricca, F. (2023). A Direct ASP Encoding for Declare. In: Gebser, M., Sergey, I. (eds) Practical Aspects of Declarative Languages. PADL 2024. Lecture Notes in Computer Science, vol 14512. Springer, Cham. https://doi.org/10.1007/978-3-031-52038-9_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-52038-9_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-52037-2

  • Online ISBN: 978-3-031-52038-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation