Explanations to Understand the Trace of a Finite Domain Constraint Solver - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2004

Explanations to Understand the Trace of a Finite Domain Constraint Solver

Résumé

Some works in progress on finite domain constraint solvers concern the implementation of a XML trace of the computation according to the OADymPPaC DTD (for example in GNU-Prolog, PaLM, CHIP). Because of the large size of traces, even for small toy problems, some tools are needed to understand this trace. Explanations of value withdrawal (or nogoods) during domain reduction are used by some solvers in finite domain constraint programming. In this paper, we use a formalization of explanations by proof trees in a fixpoint framework based on iteration of monotonic local consistency operators. Proof trees provide a declarative view of the computations by constraint propagation. We show how explanations may be naturally extracted from the OADymPPaC trace format. Explanations allow a better understanding of the domain reductions in the trace.
Fichier principal
Vignette du fichier
wlpe2004.pdf (190.35 Ko) Télécharger le fichier
Loading...

Dates et versions

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

Identifiants

  • HAL Id : hal-00085550 , version 1

Citer

Gérard Ferrand, Willy Lesaint, Alexandre Tessier. Explanations to Understand the Trace of a Finite Domain Constraint Solver. 14th Workshop on Logic Programming Environments, 2004, Saint-Malo, France. pp.19-33. ⟨hal-00085550⟩
55 Consultations
20 Téléchargements

Partager

Gmail Facebook X LinkedIn More