Sciweavers

20 search results - page 2 / 4
» Finite Domain Constraint Solver Learning
Sort
View
HEURISTICS
2008
136views more  HEURISTICS 2008»
13 years 3 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet
ENTCS
2008
85views more  ENTCS 2008»
13 years 5 months ago
Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
Salvador Lucas, Rafael Navarro-Marset
AICOM
2004
80views more  AICOM 2004»
13 years 4 months ago
A Generic, Collaborative Framework for Interval Constraint Solving
The paper abstracts the contents of a PhD dissertation entitled A Generic, Collaborative Framework for Interval Constraint Solving which has been recently defended. This thesis pre...
Antonio J. Fernández
CPAIOR
2009
Springer
13 years 11 months ago
Learning How to Propagate Using Random Probing
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
Efstathios Stamatatos, Kostas Stergiou
IJCSA
2007
104views more  IJCSA 2007»
13 years 4 months ago
Solving the Satisfiability Problem Using Finite Learning Automata
A large number of problems that occur in knowledge-representation, learning, VLSI-design, and other areas of artificial intelligence, are essentially satisfiability problems. The ...
Ole-Christoffer Granmo, Noureddine Bouhmala