195 search results - page 9 / 39 » Distributed abductive reasoning with constraints |
130
click to vote
CL
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. Dominance constraints are widely used in computational linguistics as a language for talking and reasoning about trees. In this paper, we extend dominance constraints by ...
126
click to vote
CP
2005
Springer
15 years 9 months ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
131
click to vote
ICLP
2005
Springer
15 years 9 months ago
2005
Springer
We present a version of the CCP paradigm, which is both distributed and probabilistic. We consider networks with a fixed number of nodes, each of them possessing a local and indep...
140
click to vote
CP
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Although algorithms for Distributed Constraint Optimization Problems (DCOPs) have emerged as a key technique for distributed reasoning, their application faces significa...
138
Voted
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
Service coordination in domains involving temporal constraints and duration uncertainty has previously been solved with a greedy algorithm that attempts to satisfy service requests...