Efficient Reasoning for Nogoods in Constraint Solvers with BDDs
نویسنده
چکیده
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.
منابع مشابه
Exchanging nogoods : an efficient cooperative search for solving constraint satisfaction problems Research Report Number LSIS
We propose a new cooperative concurrent search for solving the constraint satisfaction problem. Our approach consists in running independently many solvers (each one being associated with a process). These solvers exploit the algorithm Forward-Checking with Nogood Recording and they differ from each other in the heuristics they use for ordering variables and values. The cooperation is then base...
متن کاملGeneralized NoGoods in CSPs
Although nogood learning in CSPs and clause learning in SAT are formally equivalent, nogood learning has not been as successful a technique in CSP solvers as clause learning has been for SAT solvers. We show that part of the reason for this discrepancy is that nogoods in CSPs (as standardly defined) are too restrictive. In this paper we demonstrate that these restrictions can be lifted so that ...
متن کاملCooperative Search and Nogood Recording
Within the framework of constraint satisfaction problem, we propose a new scheme of cooperative parallel search. The cooperation is realized by exchanging nogoods (instantiations which can’t be extended to a solution). We associate a process with each solver and we introduce a manager of nogoods, in order to regulate exchanges of nogoods. Each solver runs the algorithm Forward-Checking with Nog...
متن کاملAn Increasing-Nogoods Global Constraint for Symmetry Breaking During Search
Symmetry Breaking During Search (SBDS) adds conditional symmetry breaking constraints (which are nogoods) dynamically upon backtracking to avoid exploring symmetrically equivalents of visited search space. The constraint store is proliferated with numerous such individual nogoods which are weak in constraint propagation. We introduce the notion of increasing nogoods, and give a global constrain...
متن کاملCooperative search vs classical algorithms
We have presented, in a previous work ([15]), a cooperative parallel search for solving the constraint satisfaction problem. We run independently solvers based on Forward-Checking with Nogood Recording. The solvers exchange nogoods via a process (”the manager of nogoods”) which regulates the exchanges. Solvers exploit the nogoods they receive to limit the size of their search tree. Experimental...
متن کامل