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
Expressive policy analysis with enhanced system dynamicity
Proceedings of the 4th International Symposium on Information, Computer, and Communications Security
Multi-agent planning with confidentiality
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Distributed abductive reasoning with constraints
DALT'10 Proceedings of the 8th international conference on Declarative agent languages and technologies VIII
| Hi-index | 0.00 |
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.