Improving MCS Enumeration via Caching

Abstract Enumeration of minimal correction sets (MCSes) of conjunctive normal form formulas is a central and highly intractable problem in infeasibility analysis of constraint systems. Often complete enumeration of MCSes is impossible due to both high computational cost and worst-case exponential number of MCSes. In such cases partial enumeration is sought for, finding applications in various domains, including axiom pinpointing in description logics among others. In this work we propose caching as a means of further improving the practical efficiency of current MCS enumeration approaches, and show the potential of caching via an empirical evaluation.

Authors

• Alessandro Previti
• Carlos Mencía
• Matti Järvisalo
• João Marques-Silva 0001

Keywords

No keywords are indexed for this paper.