Replication-Guided Enumeration of Minimal Unsatisfiable Subsets

Investor logo


This publication doesn't include Institute of Computer Science. It includes Faculty of Informatics. Official publication website can be found on


BENDÍK Jaroslav ČERNÁ Ivana

Year of publication 2020
Type Article in Proceedings
Conference 26th International Conference on Principles and Practice of Constraint Programming
MU Faculty or unit

Faculty of Informatics

Keywords Minimal Unsatisfiable Subsets;MUSes;Over-constrained systems
Description In many areas of computer science, we are given an unsatisfiable Boolean formula F in CNF, i.e. a set of clauses, with the goal to identify minimal unsatisfiable subsets (MUSes) of F. The more MUSes are identified, the better insight into F’s unsatisfiability is obtained. Unfortunately, finding even a single MUS can be very time consuming since it naturally subsumes repeatedly solving the satisfiability problem, and thus a complete MUS enumeration is often practically intractable. Therefore, contemporary MUS enumeration algorithms tend to identify as many MUSes as possible within a given time limit. In this work, we present a novel MUS enumeration algorithm. Compared to existing algorithms, our algorithm is much more frugal in the number of performed satisfiability checks. Consequently, our algorithm is often able to find substantially more MUSes than contemporary algorithms.
Related projects:

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

More info