CP
2007
Springer
13 years 8 months ago
2007
Springer
Recent research has focused on using the power of look-ahead to speed up the resolution of the Max-SAT problem. Indeed, look-ahead techniques such as Unit Propagation (UP) allow to...
CP
2007
Springer
13 years 8 months ago
2007
Springer
Recently, constraint-programming techniques have been used to generate test data and to verify the conformity of a program with its specification. Constraint generated for these ta...
CP
2007
Springer
13 years 8 months ago
2007
Springer
Abstract. In this paper we investigate the ways in which a fixed collection of valued constraints can be combined to express other valued constraints. We show that in some cases a ...
CP
2007
Springer
13 years 8 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
CP
2007
Springer
13 years 8 months ago
2007
Springer
CP
2007
Springer
13 years 11 months ago
2007
Springer
A subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a filtering algorithm dedicated to this...
CP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. There is no standard modelling language for constraint programming (CP) problems. Most solvers have their own modelling language. This makes it difficult for modellers to...
CP
2007
Springer
13 years 11 months ago
2007
Springer
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
CP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. This paper deals with the problem of solving efficiently structured CSPs. It is well known that (hyper)tree-decompositions offer the best approaches from a theoretical v...
CP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract There has been considerable interest in the identification of structural properties of combinatorial problems that lead to efficient algorithms for solving them. Some of...