195 search results - page 8 / 39 » Distributed abductive reasoning with constraints |
81
Voted
SAC
2003
ACM
15 years 2 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...
ICLP
2010
Springer
15 years 1 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...
IAT
2008
IEEE
15 years 4 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...
MIDDLEWARE
2007
Springer
15 years 3 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...
CP
2003
Springer
15 years 2 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...