✦ LIBER ✦

A hybrid algorithm for finding minimal unsatisfiable subsets in over-constrained CSPs

✍ Scribed by I. Shah

Publisher: John Wiley and Sons
Year: 2011
Tongue: English
Weight: 619 KB
Volume: 26
Category: Article
ISSN: 0884-8173
DOI: 10.1002/int.20497

No coin nor oath required. For personal study only.

✦ Synopsis

Minimal Unsatisfiable Subsets (MUSes) are the subsets of constraints of an overconstrained constraint satisfaction problem (CSP) that cannot be satisfied simultaneously and therefore are responsible for the conflict in the CSP. In this paper, we present a hybrid algorithm for finding MUSes in overconstrained CSPs. The hybrid algorithm combines the direct and the indirect approaches to finding MUSes in overconstrained CSPs. Experimentation with random CSPs reveals that the hybrid approach is not only quite efficient but when operating under a time bound it finds a more representative set of MUSes.

📜 SIMILAR VOLUMES

The minimized dead-end elimination crite

The minimized dead-end elimination criterion and its application to protein redesign in a hybrid scoring and search algorithm for computing partition functions over molecular ensembles

✍ Ivelin Georgiev; Ryan H. Lilien; Bruce R. Donald 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 668 KB

## Abstract One of the main challenges for protein redesign is the efficient evaluation of a combinatorial number of candidate structures. The modeling of protein flexibility, typically by using a rotamer library of commonly‐observed low‐energy side‐chain conformations, further increases the comple