Sciweavers

CP
2007
Springer
14 years 2 months ago
On Inconsistent Clause-Subsets for Max-SAT Solving
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...
Sylvain Darras, Gilles Dequen, Laure Devendeville,...
CP
2007
Springer
14 years 2 months ago
Exploring Different Constraint-Based Modelings for Program Verification
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...
Hélène Collavizza, Michel Rueher
CP
2007
Springer
14 years 2 months ago
The Expressive Power of Valued Constraints: Hierarchies and Collapses
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 ...
David A. Cohen, Peter Jeavons, Stanislav Zivn&yacu...
CP
2007
Springer
14 years 2 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
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 ...
Alfonso Gerevini, Alessandro Saetti
CP
2007
Springer
14 years 2 months ago
Local Symmetry Breaking During Search in CSPs
Belaid Benhamou, Mohamed Réda Saïdi
CP
2007
Springer
14 years 5 months ago
Filtering for Subgraph Isomorphism
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...
Stéphane Zampelli, Yves Deville, Christine ...
CP
2007
Springer
14 years 5 months ago
MiniZinc: Towards a Standard CP Modelling Language
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...
Nicholas Nethercote, Peter J. Stuckey, Ralph Becke...
CP
2007
Springer
14 years 5 months ago
Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance
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...
Christophe Lecoutre, Lakhdar Sais, Sébastie...
CP
2007
Springer
14 years 5 months ago
Dynamic Management of Heuristics for Solving Structured CSPs
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...
Philippe Jégou, Samba Ndiaye, Cyril Terriou...
CP
2007
Springer
14 years 5 months ago
Tradeoffs in the Complexity of Backdoor Detection
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...
Bistra N. Dilkina, Carla P. Gomes, Ashish Sabharwa...