ASP-Based Declarative Process Mining (Extended Abstract)

TL;DR

This paper introduces an ASP-based approach for declarative process mining, enabling modeling and solving of classical problems with greater expressiveness than traditional methods, including temporal logic specifications.

Contribution

It presents a novel ASP-based framework for declarative process mining that handles more expressive specifications than existing standard languages.

Findings

Successfully models process specifications as automata

Addresses log generation, conformance checking, and query checking

Handles linear-time temporal logic over finite traces

Abstract

We propose Answer Set Programming (ASP) as an approach for modeling and solving problems from the area of Declarative Process Mining (DPM). We consider here three classical problems, namely, Log Generation, Conformance Checking, and Query Checking. These problems are addressed from both a control-flow and a data-aware perspective. The approach is based on the representation of process specifications as (finite-state) automata. Since these are strictly more expressive than the de facto DPM standard specification language DECLARE, more general specifications than those typical of DPM can be handled, such as formulas in linear-time temporal logic over finite traces. (Full version available in the Proceedings of the 36th AAAI Conference on Artificial Intelligence).