Abstract
We study binary relations ⊳ over propositional formulas built over a finite set of variables. The meaning of α ⊳ γ is that γ is a preferred explanation of the observation α. These relations are called Explanatory or abductive relations. We find two important families of abductive relations characterized by his axiomatic behavior: the ordered explanatory relations and the weakly reflexive explanatory relations. We show that both families have tight links with the framework of Credibility limited revision. These relationships allow to establish semantical representations for each family. An important corollary of our representations results is that our axiomatizations allow us to overcome the background theory present in most axiomatizations of abduction.
Cite
CITATION STYLE
León, M. V., & Pino Pérez, R. (2016). Explanatory relations revisited: Links with credibility-limited revision. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10022 LNAI, pp. 25–36). Springer Verlag. https://doi.org/10.1007/978-3-319-47955-2_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.