Sciweavers

717 search results - page 11 / 72
» Weak-Commitment Search for Solving Constraint Satisfaction P...
Sort
View
114 views 110 votes 15 years 5 months ago  CSCLP 2006»
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
124 views 123 votes 15 years 2 months ago  IJCAI 1989»
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
157 views 103 votes 15 years 8 months ago  SAC 2010»
In this paper, we propose a new algorithm for enforcing relational consistency on every set of k constraints of a finite Constraint Satisfaction Problem (CSP). This algorithm ope...
166 views 130 votes 15 years 3 months ago  FLAIRS 2007»
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
164 views 99 votes 15 years 7 months ago  CP 2005»
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
145 views 113 votes 14 years 11 months ago  EUSFLAT 2009»
Harmonization with four voices is a musical problem which is subject to hard constraints, which absolutely need to be fulfilled, as well as to soft constraints, which preferably ho...
102 views 94 votes 15 years 7 months ago  CPAIOR 2007»
Abstract. This work presents methods for processing a constraint satisfaction problem (CSP) formulated by an expression-based language, before the CSP is presented to a stochastic ...
108 views 99 votes 15 years 6 months ago  SETN 2004»
Abstract. Constructive methods obtain solutions to constraint satisfaction problem instances by iteratively extending consistent partial assignments. In this research, we study the...
108 views 154 votes 15 years 5 months ago  PACT 1999»
Many problems from artificial intelligence can be described as constraint satisfaction problems over finite domains (CSP(FD)), that is, a solution is an assignment of a value to ...
134 views 109 votes 15 years 1 months ago  CORR 2010»
We present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in ...