 |
Université d'Orléans |  |
|
Université d'Orléans | |
| HAL: hal-00085549, version 1 |
| Detailed view |  Export this paper |
 |
| International Symposium on Explanation-Aware Computing, ExaCt 2005, United States (2005) |
|
|
|
|
| Explanations and Proof Trees |
|
|
| Gérard Ferrand 1Willy Lesaint 1 |
|
|
| (2005) |
|
|
|
| This paper proposes a model for explanations in a set theoretical framework using the notions of closure or fixpoint. In this approach, sets of rules associated with monotonic operators allow to define proof trees. The proof trees may be considered as a declarative view of the trace of a computation. We claim they are explanations of the result of a computation. First, the general scheme is given. Then, it is applied to Constraint Logic Programming, next to Constraint Satisfaction Problems.}, |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire d'Informatique Fondamentale d'Orléans (LIFO) |
|
|
|
Université d'Orléans : EA4022 – Ecole Nationale Supérieure d'Ingénieurs de Bourges |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Artificial Intelligence |
|
|
| Attached file list to this document: | ||||||||||
|
||||||||||
|
|
|
| hal-00085549, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00085549 | |
| oai:hal.archives-ouvertes.fr:hal-00085549 | |
| From: Willy Lesaint | |
| Submitted on: Wednesday, 12 July 2006 17:47:57 | |
| Updated on: Tuesday, 23 February 2010 14:05:30 | |
