CP
2007
Springer
13 years 11 months ago
2007
Springer
We present an algorithm for compressing table constraints representing allowed or disallowed tuples. This type of constraint is used for example in configuration problems, where t...
CP
2007
Springer
13 years 11 months ago
2007
Springer
Preferences and uncertainty are common in many real-life problems. In this paper, we focus on bipolar preferences and on uncertainty modelled via uncontrollable variables. However,...
CP
2007
Springer
13 years 11 months ago
2007
Springer
Dual Consistency (DC) is a property of Constraint Networks (CNs) which is equivalent, in its unrestricted form, to Path Consistency (PC). The principle is to perform successive sin...
CP
2007
Springer
13 years 11 months ago
2007
Springer
Finite domain propagation solvers effectively represent the possible values of variables by a set of choices which can be naturally modelled as Boolean variables. In this paper we...
CP
2007
Springer
13 years 11 months ago
2007
Springer
The typical constraint store transmits a limited amount of information because it consists only of variable domains. We propose a richer constraint store in the form of a limited-w...
CP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. One of the most successful approaches in automated planning is to use heuristic state-space search. A popular heuristic that is used by a number of state-space planners i...
CP
2007
Springer
13 years 11 months ago
2007
Springer
CP
2007
Springer
13 years 11 months ago
2007
Springer
CP
2007
Springer
13 years 11 months ago
2007
Springer
In this paper we present new techniques for improving backtracking based Quantified Constraint Satisfaction Problem (QCSP) solvers. QCSP is a generalization of CSP in which variab...
CP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Empirical hardness models are a recent approach for studying NP-hard problems. They predict the runtime of an instance using efficiently computable features. Previous res...