Declarative process discovery algorithms aim to identify a subset of relationships between process’ activities (“constraints") that implicitly define the acceptable behavior of a process given a bag of its execution traces. Declarative process models have proven effective in dealing with loosely-structured processes and complex domains. This paper proposes a declarative approach to mine constraints over a set of process variants that satisfy user-defined optimization criteria and preferences. We implement the approach using Answer Set Programming, a declarative paradigm developed in logic programming and non-monotonic reasoning.

Declarative Mining of Business Processes via ASP

Ielo A.;Pontieri L.;Ricca F.
2022-01-01

Abstract

Declarative process discovery algorithms aim to identify a subset of relationships between process’ activities (“constraints") that implicitly define the acceptable behavior of a process given a bag of its execution traces. Declarative process models have proven effective in dealing with loosely-structured processes and complex domains. This paper proposes a declarative approach to mine constraints over a set of process variants that satisfy user-defined optimization criteria and preferences. We implement the approach using Answer Set Programming, a declarative paradigm developed in logic programming and non-monotonic reasoning.
2022
Answer Set Programming
Declarative process discovery
Declare
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.11770/356319
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 3
  • ???jsp.display-item.citation.isi??? ND
social impact