Abstract

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 used for constraint retraction.

Keywords

Cite this article

@article{cai-1605,
  author  = {Gérard Ferrand and Willy Lesaint and Alexandre Tessier},
  title   = {Explanations and Proof Trees},
  journal = {Computing and Informatics},
  volume  = {25},
  number  = {2-3},
  pages   = {105--125},
  year    = {2006},
  issn    = {1335-9150},
  url     = {https://cai.type.sk/content/2006/2-3/explanations-and-proof-trees/}
}
Download .bib