Abduction and abductive logic programming
Proceedings of the eleventh international conference on Logic programming
Three-valued completion for abductive logic programs
ALP Proceedings of the fourth international conference on Algebraic and logic programming
Termination analysis for abductive general logic programs
Proceedings of the 1999 international conference on Logic programming
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
DARE: a system for distributed abductive reasoning
Autonomous Agents and Multi-Agent Systems
Expressive policy analysis with enhanced system dynamicity
Proceedings of the 4th International Symposium on Information, Computer, and Communications Security
Speculative abductive reasoning for hierarchical agent systems
CLIMA'10 Proceedings of the 11th international conference on Computational logic in multi-agent systems
The SCIFF abductive proof-procedure
AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
LAILA: a language for coordinating abductive reasoning among logic agents
Computer Languages
Multi-agent abductive reasoning with confidentiality
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
| Hi-index | 0.00 |
Abductive inference has many known applications in multiagent 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.