Search
 
loader loading subjects...
cover
An Optimal Iterative Algorithm for Extracting MUCs in a Black-box Constraint Network
Philippe Laborie
1051 - 1052
10.3233/978-1-61499-419-0-1051
Frontiers in Artificial Intelligence and Applications
Volume 263: ECAI 2014
Abstract

We present a non-intrusive iterative algorithm for extracting Minimal Unsatisfiable Cores in black-box constraint networks. The problem can be generalized as the one of finding a minimal subset satisfying an upward-closed property P. If performance is measured as the number of infeasibility property checks, we show that the proposed algorithm, ADEL, is optimal both for small and for large MUCs and that it consistently outperforms existing approaches in between those two extremal cases.

Download
Creative Commons License