Panagiotis Lymperopoulos

Graph Pruning for Enumeration of Minimal Unsatisfiable Subsets

Finding Minimal Unsatisfiable Subsets (MUSes) of boolean constraints is a common problem in infeasibility analysis of over-constrained systems. However, because of the exponential search space of the problem, enumerating MUSes is extremely time-consuming in real applications. In this work, we propos…