Explanations and Proof Trees - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2005

Explanations and Proof Trees

Résumé

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.},
Fichier principal
Vignette du fichier
exact2005.pdf (140.32 Ko) Télécharger le fichier
Loading...

Dates et versions

hal-00085549 , version 1 (12-07-2006)

Identifiants

  • HAL Id : hal-00085549 , version 1

Citer

Gérard Ferrand, Willy Lesaint, Alexandre Tessier. Explanations and Proof Trees. International Symposium on Explanation-Aware Computing, ExaCt 2005, 2005, United States. pp.76-85. ⟨hal-00085549⟩
51 Consultations
28 Téléchargements

Partager

Gmail Facebook X LinkedIn More