Sciweavers

717 search results - page 12 / 72
» Weak-Commitment Search for Solving Constraint Satisfaction P...
Sort
View
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 ...
118 views 142 votes 15 years 6 months ago  CSCLP 2004»
Abstract. Time granularity constraint reasoning is likely to have a relevant role in emerging applications like GIS, time management in the Web and Personal Information Management ...
87 views 97 votes 15 years 7 months ago  KCAP 2005»
Effective reuse of Knowledge Bases (KBs) often entails the expensive task of identifying plausible KB-PS (Problem Solver) combinations. We propose a novel technique based on Const...
125 views 111 votes 15 years 7 months ago  CP 2005»
When the search for a solution to a constraint satisfaction problem backtracks, it is not usually worthwhile to remember the assignment that failed, because the same assignment wil...
180 views 101 votes 15 years 2 months ago  ATAL 2010»
In this paper, we extend the traditional formalization of a Distributed Constraint Satisfaction Problems (DisCSP) to a Quantified DisCSP. A Quantified DisCSP includes several unive...
114 views 116 votes 15 years 2 months ago  AAAI 1996»
The ideas of dependency directed backtracking (DDB) and explanation based learning (EBL) have developed independently in constraint satisfaction, planning and problem solving comm...