Sciweavers

805 search results - page 20 / 161
» Enumerating All Solutions for Constraint Satisfaction Proble...
Sort
View
APAL
2006
63views more  APAL 2006»
13 years 8 months ago
Satisfaction of existential theories in finitely presented groups and some embedding theorems
Abstract. The main result is that for every recursively enumerable existential consistent theory (in the usual language of group theory), there exists a finitely presented SQ-univ...
Abderezak Ould Houcine
ECAI
2004
Springer
14 years 1 months ago
Improving Asynchronous Backtracking for Dealing with Complex Local Problems
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
Arnold Maestre, Christian Bessière
CP
2004
Springer
14 years 1 months ago
Counting-Based Look-Ahead Schemes for Constraint Satisfaction
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
Kalev Kask, Rina Dechter, Vibhav Gogate
CSR
2006
Springer
14 years 4 days ago
The Complexity of Equality Constraint Languages
We classify the computational complexity of all constraint satisfaction problems where the constraint language is preserved by all permutations of the domain. A constraint languag...
Manuel Bodirsky, Jan Kára
CP
2009
Springer
13 years 11 months ago
Constraint-Based Local Search for the Automatic Generation of Architectural Tests
Abstract. This paper considers the automatic generation of architectural tests (ATGP), a fundamental problem in processor validation. ATGPs are complex conditional constraint satis...
Pascal Van Hentenryck, Carleton Coffrin, Boris Gut...