We present in this paper a hybrid planning system which combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its ...
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...
We show that aggregate constraints (as opposed to pairwise constraints) that often arise when integrating multiple sources of data, can be leveraged to enhance the quality of dedu...
Surajit Chaudhuri, Anish Das Sarma, Venkatesh Gant...
Abstract. While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mo...