A Direct ASP Encoding for Declare

Explore a novel approach to encoding Declare constraints in Answer Set Programming (ASP) for Process Mining applications. Delve into the direct modeling of constraint semantics as ASP rules, bypassing intermediate representations like Linear Temporal Logic formulas or automata. Compare this innovative method to existing ASP encodings and a Python library for Declare across two Process Mining tasks. Gain insights into the effectiveness of this direct encoding technique and its potential impact on declarative process modeling and analysis.

[PADL'24] A direct ASP encoding for Declare