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.
Cite
CITATION STYLE
Previti, A., Mencía, C., Järvisalo, M., & Marques-Silva, J. (2017). Improving MCS enumeration via caching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10491 LNCS, pp. 184–194). Springer Verlag. https://doi.org/10.1007/978-3-319-66263-3_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
