391 search results - page 18 / 79 » Locally Consistent Constraint Satisfaction Problems with Bin... |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in ...
SAGA
2001
Springer
13 years 12 months ago
2001
Springer
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
ICTAI
2007
IEEE
14 years 1 months ago
2007
IEEE
Domain filtering local consistencies, such as inverse consistencies, that only delete values and do not add new constraints are particularly useful in Constraint Programming. Alt...
CP
2008
Springer
13 years 9 months ago
2008
Springer
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the ...
CEC
2007
IEEE
14 years 1 months ago
2007
IEEE
—Constraint satisfaction problems (CSPs) widely occur in artificial intelligence. In the last twenty years, many algorithms and heuristics were developed to solve CSP. Recently,...