Abducing priorities to derive intended conclusions

Authors:
Katsumi Inoue;Chiaki Sakama
Affiliations:
Dept. Electrical and Electronics Engineering, Kobe University, Nada, Kobe, Japan;Dept. Computer and Communication Sciences, Wakayama University, Sakaedani, Wakayama, Japan
Venue:
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Year:
1999

Citing 5
Cited 5

Nonmonotonic logic and temporal projection

Artificial Intelligence
Logic programs with classical negation

Logic programming
Reasoning about priorities in default logic

AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
The complexity of logic-based abduction

Journal of the ACM (JACM)
Database Updates through Abduction

VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases

Abduction in Logic Programming

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Automated Abduction

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Explicitly Using Default Knowledge in Concept Learning: An Extended Description Logics Plus Strict and Default Rules

LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Abduction and preferences in linguistics

LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
N-axioms Parallel Unification

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 2

Quantified Score

Hi-index	0.00

Visualization

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.