Reformulates conformance checking as a totally unimodular LP that complements A* by speeding up long deviating traces and yields 38.6% average runtime savings when the two are combined via simple selection rules on over 2.1 million instances.
arXiv preprint arXiv:2406.05439
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Developing a Totally Unimodular Linear Program for Optimal Conformance Checking: When and Why It Complements A*
Reformulates conformance checking as a totally unimodular LP that complements A* by speeding up long deviating traces and yields 38.6% average runtime savings when the two are combined via simple selection rules on over 2.1 million instances.