Sciweavers

JAIR
2006
102views more  JAIR 2006»
13 years 4 months ago
Set Intersection and Consistency in Constraint Networks
In this paper, we show that there is a close relation between consistency in a constraint network and set intersection. A proof schema is provided as a generic way to obtain consi...
Yuanlin Zhang, Roland H. C. Yap
AAAI
1992
13 years 5 months ago
On the Minimality and Decomposability of Constraint Networks
Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint netwo...
Peter van Beek
AAAI
2004
13 years 5 months ago
Domain Transmutation in Constraint Satisfaction Problems
We study local interchangeability of values in constraint networks based on a new approach where a single value in the domain of a variable can be treated as a combination of &quo...
James Bowen, Chavalit Likitvivatanavong
AAAI
2007
13 years 6 months ago
Conservative Dual Consistency
Consistencies are properties of Constraint Networks (CNs) that can be exploited in order to make inferences. When a significant amount of such inferences can be performed, CNs ar...
Christophe Lecoutre, Stéphane Cardon, Julie...
ECAI
2006
Springer
13 years 8 months ago
Extracting MUCs from Constraint Networks
Abstract. We address the problem of extracting Minimal Unsatisfiable Cores (MUCs) from constraint networks. This computationally hard problem has a practical interest in many appli...
Fred Hemery, Christophe Lecoutre, Lakhdar Sais, Fr...
CP
2006
Springer
13 years 8 months ago
An Extension of Complexity Bounds and Dynamic Heuristics for Tree-Decompositions of CSP
This paper deals with methods exploiting tree-decomposition approaches for solving constraint networks. We consider here the practical efficiency of these approaches by defining fi...
Philippe Jégou, Samba Ndiaye, Cyril Terriou...
CP
2003
Springer
13 years 9 months ago
Semi-automatic Modeling by Constraint Acquisition
Constraint programming is a technology which is now widely used to solve combinatorial problems in industrial applications. However, using it requires considerable knowledge and e...
Remi Coletta, Christian Bessière, Barry O'S...
TIME
2006
IEEE
13 years 10 months ago
Ultimately Periodic Simple Temporal Problems (UPSTPs)
In this paper, we consider quantitative temporal or spatial constraint networks whose constraints evolve over time in an ultimately periodic fashion. These constraint networks are...
Jean-François Condotta, Gérard Ligoz...
CP
2009
Springer
14 years 5 months ago
Failed Value Consistencies for Constraint Satisfaction
In constraint satisfaction, basic inferences rely on some properties of constraint networks, called consistencies, that allow the identification of inconsistent instantiations (als...
Christophe Lecoutre, Olivier Roussel