HAL : hal-00085550, version 1

Fiche détaillée

Récupérer au format BibTeX - EndNote - TEI - RefWorks -

14th Workshop on Logic Programming Environments, Saint-Malo : France (2004)

Explanations to Understand the Trace of a Finite Domain Constraint Solver

Gérard Ferrand 1, Willy Lesaint 1, Alexandre Tessier 1

(2004)

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.

1 :	Laboratoire d'Informatique Fondamentale d'Orléans (LIFO)
	Université d'Orléans : EA4022 – Ecole Nationale Supérieure d'Ingénieurs de Bourges

Domaine

:

Informatique/Intelligence artificielle

hal-00085550, version 1

http://hal.archives-ouvertes.fr/hal-00085550

oai:hal.archives-ouvertes.fr:hal-00085550

Contributeur : Willy Lesaint <>

Soumis le : Mercredi 12 Juillet 2006, 17:54:34

Dernière modification le : Jeudi 13 Juillet 2006, 22:05:46