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.},
Domaines
Intelligence artificielle [cs.AI]
Loading...