Explanations and Proof Trees - Archive ouverte HAL Access content directly
Journal Articles Computing and Informatics Year : 2006

Explanations and Proof Trees


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 results of a computation. This notion of explanation is applied to constraint logic programming, and it is used for declarative error diagnosis. It is also applied to constraint programming, and it is used for constraint retraction.
Fichier principal
Vignette du fichier
cai2006.pdf (242.49 Ko) Télécharger le fichier

Dates and versions

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


  • HAL Id : hal-00085545 , version 1


Gérard Ferrand, Willy Lesaint, Alexandre Tessier. Explanations and Proof Trees. Computing and Informatics, 2006, 25, pp.105-125. ⟨hal-00085545⟩
69 View
338 Download


Gmail Facebook X LinkedIn More