Name
Abstract | ||
|---|---|---|
We study the framework of abductive logic programming extended with integrity constraints. For this framework, we introduce a new measure of the simplicity of an explanation based on its degree of arbitrariness: the more arbitrary the explanation, the less appealing it is, with explanations having no arbitrariness - they are called constrained - being the preferred ones. In the paper, we study basic properties of constrained explanations. For the case when programs in abductive theories are stratified we establish results providing a detailed picture of the complexity of the problem to decide whether constrained explanations exist. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1017/S1471068414000271 | THEORY AND PRACTICE OF LOGIC PROGRAMMING |
DocType | Volume | Issue |
Journal | 14 | 4-5 |
ISSN | Citations | PageRank |
1471-0684 | 2 | 0.43 |
References | Authors | |
8 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Luciano Caroprese | 1 | 140 | 21.01 |
| Irina Trubitsyna | 2 | 119 | 24.66 |
| Miroslaw Truszczynski | 3 | 1494 | 162.36 |
| Ester Zumpano | 4 | 518 | 62.16 |