Common abductive explanations in first order logic
We build upon a recent definition of a common explanation for the label shared by a group of observations. The motivation stems from explaining how a specific action, when playing a card game, leads to an acceptable reward at the end of the game. Since there are various ways to achieve this goal, gr...
Saved in:
| Published in: | Machine learning Vol. 114; no. 12; p. 264 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
Springer US
01.12.2025
Springer Nature B.V |
| Subjects: | |
| ISSN: | 0885-6125, 1573-0565 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | We build upon a recent definition of a common explanation for the label shared by a group of observations. The motivation stems from explaining how a specific action, when playing a card game, leads to an acceptable reward at the end of the game. Since there are various ways to achieve this goal, groups of acceptable trajectories are first extracted from a rule-based ILP model. Subsequently, common explanations are enumerated for each group of trajectories. A significant contribution of this article is the introduction of a new definition of preferred common explanations: they must be both subset-minimal and maximally instantiated. These so-called leq-minimal common explanations (
leq-MCE
s for short) happen to be subsets of the least general generalisation of the observations in the group. We propose efficient algorithms to enumerate
leq-MCE
s and a scheme to extract a diverse subset of these leq-MCEs to be presented to human interlocutors. Experiments are conducted on a card game. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 0885-6125 1573-0565 |
| DOI: | 10.1007/s10994-025-06869-z |