Applying inductive logic programming to process mining

59Citations
Citations of this article
36Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The management of business processes has recently received a lot of attention. One of the most interesting problems is the description of a process model in a language that allows the checking of the compliance of a process execution (or trace) to the model. In this paper we propose a language for the representation of process models that is inspired to the SCIFF language and is an extension of clausal logic. A process model is represented in the language as a set of integrity constraints that allow conjunctive formulas as disjuncts in the head. We present an approach for inducing these models from data: we define a subsumption relation for the integrity constraints, we define a refinement operator and we adapt the algorithm ICL to the problem of learning such formulas. The system has been applied to the problem of inducing the model of a sealed bid auction and of the NetBill protocol. The data used for learning and testing were randomly generated from correct models of the processes. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Lamma, E., Mello, P., Riguzzi, F., & Storari, S. (2008). Applying inductive logic programming to process mining. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4894 LNAI, pp. 132–146). https://doi.org/10.1007/978-3-540-78469-2_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free