980 search results - page 115 / 196 » Decentralized Constraint Satisfaction |
AIPS
2000
13 years 11 months ago
2000
Currently, Graphplan and Blackbox, which converts Graphplan's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains i...
CVPR
2008
IEEE
15 years 5 days ago
2008
IEEE
LP relaxation approach to soft constraint optimisation (i.e. MAP-MRF) has been mostly considered only for binary problems. We present its generalisation to n-ary problems, includi...
SGAI
2007
Springer
14 years 4 months ago
2007
Springer
Constraint Satisfaction Problems can be solved using either iterative improvement or constructive search approaches. Iterative improvement techniques converge quicker than the cons...
CP
2003
Springer
14 years 3 months ago
2003
Springer
We provide a reformulation of the constraint hierarchies (CHs) framework based on the notion of error indicators. Adapting the generalized view of local consistency in semiring-ba...
ICLP
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Abductive Logic Programming (ALP) and Constraint Logic Programming (CLP) share the feature to constrain the set of possible solutions to a program via integrity or CLP co...