Abduction-Based Search for Cooperative Answers
We propose that agents may use abductive reasoning to adopt a Cooperative Answering behavior. In the event of failure or inadequacy of answers to a query (question), the agent should provide related answers by employing Query Relaxation. These answers are to be related to the query and might be useful to the querying agent. In order to achieve that, we consider agents with knowledge bases consisting of Abductive Logic Programs. Such agents are able to explain failure and guide the search for related answers. A distinctive aspect of our proposal is that in order to avoid undesirable results, one can select the parts of the query that cannot be relaxed.
KeywordsRational Explanation Original Query Ground Instance Deductive Database Abductive Reasoning
Unable to display preview. Download preview PDF.
- 1.Andreasen, T., Christiansen, H.: Flexible query-answering systems modelled in metalogic programming. In: ECAI 1996 Workshop Knowledge Representation Meets Databases, pp. 1–7 (1996)Google Scholar
- 2.Balduccini, M.: Computing answer sets of cr-prolog programs. Technical report, Texas Tech. University (2006)Google Scholar
- 9.Inoue, K., Sakama, C.: Abductive framework for nonmonotonic theory change. In: IJCAI, pp. 204–210 (1995)Google Scholar
- 10.Kakas, A.C., Kowalski, R.A., Toni, F.: The role of abduction in logic programming. In: Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 5, pp. 235–324. Oxford University Press, Oxford (1998)Google Scholar
- 13.Sadri, F., Toni, F.: Active behaviour in deductive databases. Technical report (1996)Google Scholar
- 15.Sakama, C., Inoue, K.: Negotiation by abduction and relaxation. In: AAMAS, pp. 1022–1029 (2007)Google Scholar