Abduction guided query relaxation

We investigate how to improve cooperative communication between agents by representing knowledge bases as logic programs extended with abduction. In this proposal, agents try to provide explanations whenever they fail to answer a question. Query Relaxation is then employed to search for answers related to the query, characterizing cooperative behavior. Our contributions bring insightful improvements to relaxation attempts and the quality of related answers. We introduce rational explanations and use them to efficiently guide the search for related answers in a relaxation tree.

[1]  W. Marsden.  I and J , 2012 .

[2]  Parke Godfrey,et al.  Minimization in Cooperative Response to Failing Database Queries , 1994, Int. J. Cooperative Inf. Syst..

[3]  Dean Allemang,et al.  The Computational Complexity of Abduction , 1991, Artif. Intell..

[4]  Chiaki Sakama,et al.  Abductive Framework for Nonmonotonic Theory Change , 1995, IJCAI.

[5]  Chiaki Sakama,et al.  Negotiation by abduction and relaxation , 2007, AAMAS '07.

[6]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[7]  Parke Godfrey,et al.  Relaxation as a platform for cooperative answering , 1992, Journal of Intelligent Information Systems.