Declarative Mining of Business Processes via ASP

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.