Back to Search
Start Over
Efficient Reasoning for Nogoods in Constraint Solvers with BDDs.
- Source :
- Practical Aspects of Declarative Languages (978-3-540-77441-9); 2008, p53-67, 15p
- Publication Year :
- 2008
-
Abstract
- When BDDs are used for propagation in a constraint solver with nogood recording, it is necessary to find a small subset of a given set of variable assignments that is enough for a BDD to imply a new variable assignment. We show that the task of finding such a minimum subset is NP-complete by reduction from the hitting set problem. We present a new algorithm for finding such a minimal subset, which runs in time linear in the size of the BDD representation. In our experiments, the new method is up to ten times faster than the previous method, thereby reducing the solution time by even more than 80%. Due to linear time complexity the new method is able to scale well. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISBNs :
- 9783540774419
- Database :
- Complementary Index
- Journal :
- Practical Aspects of Declarative Languages (978-3-540-77441-9)
- Publication Type :
- Book
- Accession number :
- 34019437
- Full Text :
- https://doi.org/10.1007/978-3-540-77442-6_5