226 search results - page 19 / 46 » GAC on Conjunctions of Constraints |
PPDP
2001
Springer
13 years 12 months ago
2001
Springer
This paper explores the question of when two propagationbased constraint systems have the same behaviour, in terms of search space. We categorise the behaviour of domain and bound...
ITC
2003
IEEE
14 years 24 days ago
2003
IEEE
Functional verification of complex designs largely relies on the use of simulation in conjunction high-level verification languages (HVL) and test-bench automation (TBA) tools. In...
DBPL
2005
Springer
2005
Springer
Complexity and Approximation of Fixing Numerical Attributes in Databases Under Integrity Constraints
14 years 1 months ago
Consistent query answering is the problem of computing the answers from a database that are consistent with respect to certain integrity constraints that the database as a whole ma...
ENTCS
2008
13 years 7 months ago
2008
Most well-known algorithms for equational solving are based on quantifier elimination. This technique iteratively eliminates the innermost block of existential/universal quantifie...
CSCLP
2006
Springer
13 years 11 months ago
2006
Springer
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...