195 search results - page 8 / 39 » Distributed abductive reasoning with constraints |
130
click to vote
SAC
2003
ACM
15 years 9 months ago
2003
ACM
Researchers building multi-agent algorithms typically work with abstracted away from real applications. The abstracted problem instances allow systematic and detailed investigatio...
113
click to vote
ICLP
2010
Springer
15 years 8 months ago
2010
Springer
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence...
108
click to vote
IAT
2008
IEEE
15 years 10 months ago
2008
IEEE
The reason for using distributed constraint satisfaction algorithms is often to allow agents to find a solution while revealing as little as possible about their variables and co...
158
click to vote
MIDDLEWARE
2007
Springer
15 years 10 months ago
2007
Springer
This paper is about a novel rule-based approach for reasoning about qualitative spatiotemporal relations among technology-rich autonomous objects, to which we refer to as artifact...
126
click to vote
CP
2003
Springer
15 years 9 months ago
2003
Springer
A reason to distribute constraint satisfaction is privacy: agents may not want to share their values, and they may wish to keep constraints as private as possible. In this paper, w...