×

Distributed abductive reasoning with constraints. (English) Zbl 1325.68221

Omicini, Andrea (ed.) et al., Declarative agent languages and technologies VIII. 8th international workshop, DALT 2010, Toronto, Canada, May 10, 2010. Revised, selected and invited papers. Berlin: Springer (ISBN 978-3-642-20714-3/pbk). Lecture Notes in Computer Science 6619, 148-166 (2011).
Summary: Abductive inference has many known applications in multi-agent systems including planning, scheduling, policy analysis and sensing data interpretation. However, most abductive frameworks rely on a centrally executed proof procedure whereas many of the application problems are distributed by nature. Confidentiality and communication overhead concerns often preclude agents’ knowledge from being centralised. We present in this paper a distributed abductive reasoning framework with a flexible and extensible proof procedure that permits collaborative abductive reasoning between agents over decentralised knowledge. The proof procedure is sound and complete upon termination, and can perform concurrent computation. To the best of our knowledge, this is the first distributed abductive system that can compute non-ground conditional proofs and handle arithmetic constraints.
For the entire collection see [Zbl 1213.68053].

MSC:

68T27 Logic in artificial intelligence
68T42 Agent technology and artificial intelligence

Software:

LAILA
PDFBibTeX XMLCite
Full Text: DOI