Exploiting Inductive Logic Programming Techniques for Declarative Process Mining

Abstract

In the last few years, there has been a growing interest in the adoption of declarative paradigms for modeling and verifying process models. These paradigms provide an abstract and human understandable way of specifying constraints that must hold among activities executions rather than focusing on a specific procedural solution. Mining such declarative descriptions is still an open challenge. In this paper, we present a logic-based approach for tackling this problem. It relies on Inductive Logic Programming techniques and, in particular, on a modified version of the Inductive Constraint Logic algorithm. We investigate how, by properly tuning the learning algorithm, the approach can be adopted to mine models expressed in the ConDec notation, a graphical language for the declarative specification of business processes. Then, we sketch how such a mining framework has been concretely implemented as a ProM plug-in called DecMiner. We finally discuss the effectiveness of the approach by means of an example which shows the ability of the language to model concurrent activities and of DecMiner to learn such a model.

Generating optimized configurable business process models in scenarios subject to uncertainty

“…In addition, Declare has been widely referenced in the past years in the context of BPs [17,51,55,60]. Declare is based on constraint-based BP models (cf.…”

“…line 14 of Algorithm 3 and Example 12). 17 Example 12. For a MO-COP with two objective functions and a solution space divided in nine regions, Fig.…”

“…For example, our approach allows one to specify the uncertainty about the duration of an activity by using a flat discrete range (e.g., [15][16][17][18][19][20], meaning that such an activity may last 15,16,17,18,19 or 20 units of time with the same probability). This can be used, for example, for specifying that the arrival time of clients is uncertain due to unpunctual clients, or that the availability of some resources is subject to uncertainty.…”

Multi-paradigm Process Mining: Retrieving Better Models by Combining Rules and Sequences

“…The most prominent declarative control flow modeling frameworks are DecSerFlow [4] and its successor Declare [5], which offer a set of Linear Temporal Logic (LTL)-based constraint templates for modeling and rule verification purposes, bundled in the ConDec language. Many declarative process discovery algorithms have been developed, such as [2,6,7,8].…”

Mining process models with prime invisible tasks

“…Finally, the interested reader is referred to Chesani et al 2009] for a preliminary quantitative evaluation related to mining DecSerFlow specification from labeled execution traces, using SCIFF as an intermediate format.…”