Sciweavers

21 search results - page 1 / 5
» k-relevant Explanations for Constraint Programming
Sort
View
FLAIRS
2003
13 years 6 months ago
k-relevant Explanations for Constraint Programming
Samir Ouis, Narendra Jussien, Patrice Boizumault
PADL
2010
Springer
14 years 1 months ago
Lazy Explanations for Constraint Propagators
Explanations are a technique for reasoning about constraint propagation, which have been applied in many learning, backjumping and user-interaction algorithms for constraint progra...
Ian P. Gent, Ian Miguel, Neil C. A. Moore
AAAI
2004
13 years 6 months ago
QUICKXPLAIN: Preferred Explanations and Relaxations for Over-Constrained Problems
Over-constrained problems can have an exponential number of conflicts, which explain the failure, and an exponential number of relaxations, which restore the consistency. A user o...
Ulrich Junker
JUCS
2007
129views more  JUCS 2007»
13 years 4 months ago
Constraint Programming Architectures: Review and a New Proposal
: Most automated reasoning tasks with practical applications can be automatically reformulated into a constraint solving task. A constraint programming platform can thus act as a u...
Jacques Robin, Jairson Vitorino, Armin Wolf
AADEBUG
2000
Springer
13 years 9 months ago
Value Withdrawal Explanation in CSP
This work is devoted to constraint solving motivated by the debugging of constraint logic programs a la GNU-Prolog. The paper focuses only on the constraints. In this framework, c...
Gérard Ferrand, Willy Lesaint, Alexandre Te...