Abducing Priorities to Derive Intended Conclusions
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence. Automated Reasoning. Pages 44-48.
Abstract
We introduce a framework for finding preference information to derive desired conclusions in nonmonotonic reasoning. A new abductive framework called preference abduction enables us to infer an appropriate set of priorities to explain the given observation skeptically, thereby resolving the multiple extension problem in the answer set semantics for extended logic programs. Preference abduction is also combined with a usual form of abduction in abductive logic programming, and has applications such as specification of rule preference in legal reasoning and preference view update. The issue of learning abducibles and priorities is also discussed, in which abduction to a particular cause is equivalent to abduction to preference.
@inproceedings{ijcai1999p7,
title = {Abducing Priorities to Derive Intended Conclusions},
author = {Inoue, Katsumi and Sakama, Chiaki},
booktitle = {Proceedings of the Sixteenth International Joint Conference on
Artificial Intelligence, {IJCAI-99}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Thomas Dean},
pages = {44--48},
year = {1999},
note = {Automated Reasoning},
url = {https://ijcai.org/proceedings/1999/7},
}
TY - CPAPER TI - Abducing Priorities to Derive Intended Conclusions AU - Inoue, Katsumi AU - Sakama, Chiaki T2 - Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI-99 PB - International Joint Conferences on Artificial Intelligence PY - 1999 SP - 44 EP - 48 UR - https://ijcai.org/proceedings/1999/7 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
