348 search results - page 40 / 70 » Using Case-Based Reasoning to Write Constraint Programs |
118
Voted
CORR
2011
Springer
14 years 6 months ago
2011
Springer
We present a unifying approach to the efficient evaluation of propositional answer-set programs. Our approach is based on backdoors which are small sets of atoms that represent ...
118
Voted
LPNMR
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We describe a new software, pbmodels, that uses pseudo-boolean constraint solvers (PB solvers) to compute stable models of logic programs with weight atoms. To this end, ...
134
click to vote
CADE
2011
Springer
14 years 2 months ago
2011
Springer
Abstract. Methods exploiting problem symmetries have been very successful in several areas including constraint programming and SAT solving. We here recast a technique to enhance t...
138
Voted
EWCBR
2008
Springer
15 years 4 months ago
2008
Springer
Case-Based Planning (CBP) is an effective technique for solving planning problems that has the potential to reduce the computational complexity of the generative planning approache...
219
Voted
ICLP
2009
Springer
16 years 3 months ago
2009
Springer
We present an implementation of table constraints in CLP(FD). For binary constraints, the supports of each value are represented as a finite-domain variable, and action rules are u...