Abstract. A well-known difficulty with solving Constraint Satisfaction Problems (CSPs) is that, while one formulation of a CSP may enable a solver to solve it quickly, a different ...
Abstract. In this paper, we present a syntactic method for solving firstorder equational constraints over term algebras. The presented method exploits a novel notion of quasi-solve...
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
In this paper we describe a new approach to repairing violations of integrity constraints in databases with null values. By adopting basic concepts from model-based diagnosis, we ...
c Modular Abstractions for Template Numerical Constraints David Monniaux May 26, 2010 We propose a method for automatically generating abstract transformstatic analysis by abstrac...