Sciweavers

26 search results - page 4 / 6
» Decomposition During Search for Propagation-Based Constraint...
Sort
View
CP
2010
Springer
13 years 6 months ago
Making Adaptive an Interval Constraint Propagation Algorithm Exploiting Monotonicity
A new interval constraint propagation algorithm, called MOnotonic Hull Consistency (Mohc), has recently been proposed. Mohc exploits monotonicity of functions to better filter var...
Ignacio Araya, Gilles Trombettoni, Bertrand Neveu
ICTAI
2007
IEEE
14 years 2 months ago
Adaptive Lookahead for Answer Set Computation
Lookahead is a well-known constraint propagation technique for DPLL-based SAT and answer set solvers. Despite its space pruning power, it can also slow down the search, due to its...
Guohua Liu, Jia-Huai You
ECAI
2008
Springer
13 years 9 months ago
Heuristics for Dynamically Adapting Propagation
Building adaptive constraint solvers is a major challenge in constraint programming. An important line of research towards this goal is concerned with ways to dynamically adapt th...
Kostas Stergiou
AAAI
2004
13 years 9 months ago
Complete Local Search for Propositional Satisfiability
Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search a...
Hai Fang, Wheeler Ruml
CORR
2002
Springer
81views Education» more  CORR 2002»
13 years 7 months ago
Value withdrawal explanations: a theoretical tool for programming environments
Abstract. Constraint logic programming combines declarativity and efficiency thanks to constraint solvers implemented for specific domains. Value withdrawal explanations have been ...
Willy Lesaint