Publication details

Rotation Based MSS/MCS Enumeration

Investor logo

BENDÍK Jaroslav ČERNÁ Ivana

Year of publication 2020
Type Article in Proceedings
Conference LPAR 2020: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning
MU Faculty or unit

Faculty of Informatics

Keywords Maximal Satisfiable Subsets;Minimal Correction Subsets;Infeasibility Analysis;Diagnosis;MSS;MCS
Description Given an unsatisfiable Boolean Formula F in CNF, i.e., a set of clauses, one is often interested in identifying Maximal Satisfiable Subsets (MSSes) of F or, equivalently, the complements of MSSes called Minimal Correction Subsets (MCSes). Since MSSes (MCSes) find applications in many domains, e.g. diagnosis, ontologies debugging, or axiom pinpointing, several MSS enumeration algorithms have been proposed. Unfortunately, finding even a single MSS is often very hard since it naturally subsumes repeatedly solving the satisfiability problem. Moreover, there can be up to exponentially many MSSes, thus their complete enumeration is often practically intractable. Therefore, the algorithms tend to identify as many MSSes as possible within a given time limit. In this work, we present a novel MSS enumeration algorithm called RIME. Compared to existing algorithms, RIME is much more frugal in the number of performed satisfiability checks which we witness via an experimental comparison. Moreover, RIME is several times faster than existing tools.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.

More info