Efficient Enumeration of Minimal Unsatisfiable Cores for Linear Temporal Logic over Finite Traces (LTLf) Formulas

This paper introduces a novel technique for efficiently enumerating minimal unsatisfiable cores (MUCs) of an LTLf specification by encoding it into an Answer Set Programming (ASP) specification, such that the minimal unsatisfiable subsets (MUSes) of the ASP program directly correspond to the MUCs of the original LTLf specification.