In the context of multi-agent hypothetical reasoning, agents typically have partial knowledge about their environments, and the union of such knowledge is still incomplete to represent the whole world. Thus, given a global query they need to collaborate with each other to make correct inferences and hypothesis, whilst maintaining global constraints. There are many real world applications in which the confidentiality of agent knowledge is of primary concern, and hence the agents may not share or communicate all their information during the collaboration. This extra constraint gives a new challenge to multi-agent reasoning. This paper shows how this dichotomy between ”open communication” in collaborative reasoning and protection of confidentiality can be accommodated, by extending a general-purpose distributed abductive logic programming system for multi-agent hypothetical reasoning with confidentiality. Specifically, the system computes consistent conditional answers for a query over a set of distributed normal logic programs with possibly unbound domains and arithmetic constraints, preserving the private information within the logic programs.
[1]
Jorge Lobo,et al.
Expressive policy analysis with enhanced system dynamicity
,
2009,
ASIACCS '09.
[2]
Krysia Broda,et al.
Distributed Abductive Reasoning with Constraints
,
2010,
DALT.
[3]
Sofie Verbaeten.
Termination Analysis for Abductive General Logic Programs
,
1999,
ICLP.
[4]
Paolo Mancarella,et al.
Abductive Logic Programming
,
1992,
LPNMR.
[5]
Krysia Broda,et al.
Multi-agent planning with confidentiality
,
2009,
AAMAS.
[6]
Frank Teusink,et al.
Three-Valued Completion for Abductive Logic Programs
,
1994,
Theor. Comput. Sci..