Tunable Online MUS/MSS Enumeration

06/10/2016
by   Jaroslav Bendik, et al.
0

In various areas of computer science, the problem of dealing with a set of constraints arises. If the set of constraints is unsatisfiable, one may ask for a minimal description of the reason for this unsatisifi- ability. Minimal unsatisifable subsets (MUSes) and maximal satisifiable subsets (MSSes) are two kinds of such minimal descriptions. The goal of this work is the enumeration of MUSes and MSSes for a given constraint system. As such full enumeration may be intractable in general, we focus on building an online algorithm, which produces MUSes/MSSes in an on-the-fly manner as soon as they are discovered. The problem has been studied before even in its online version. However, our algorithm uses a novel approach that is able to outperform current state-of-the art algorithms for online MUS/MSS enumeration. Moreover, the performance of our algorithm can be adjusted using tunable parameters. We evaluate the algorithm on a set of benchmarks.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/14/2023

Enumerating all minimal hitting sets in polynomial total time

Consider a hypergraph (=set system) ℍ whose h hyperedges are subsets of ...
research
10/31/2010

Prunnig Algorithm of Generation a Minimal Set of Rule Reducts Based on Rough Set Theory

In this paper it is considered rule reduct generation problem, based on ...
research
07/30/2021

Beep-And-Sleep: Message and Energy Efficient Set Cover

We observe message-efficient distributed algorithms for the Set Cover pr...
research
09/18/2020

Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Cardinality Constraints

A property Π on a finite set U is monotone if for every X ⊆ U satisfying...
research
02/05/2023

Online Nonstochastic Control with Adversarial and Static Constraints

This paper studies online nonstochastic control problems with adversaria...
research
12/30/2017

Efficiently Enumerating all Maximal Cliques with Bit-Parallelism

The maximal clique enumeration (MCE) problem has numerous applications i...
research
02/26/2020

Linear-Time Variational Integrators in Maximal Coordinates

Most dynamic simulation tools parameterize the configuration of multi-bo...

Please sign up or login with your details

Forgot password? Click here to reset