Value Withdrawal Explanation in CSP

Simple item page
dc.creatorFerrand, Gerard
dc.creatorLesaint, Willy
dc.creatorTessier, Alexandre
dc.date2000-12-11
dc.date.accessioned2026-07-07T03:16:47Z
dc.date.available2026-07-07T03:16:47Z
dc.descriptionThis work is devoted to constraint solving motivated by the debugging of constraint logic programs a la GNU-Prolog. The paper focuses only on the constraints. In this framework, constraint solving amounts to domain reduction. A computation is formalized by a chaotic iteration. The computed result is described as a closure. This model is well suited to the design of debugging notions and tools, for example failure explanations or error diagnosis. In this paper we detail an application of the model to an explanation of a value withdrawal in a domain. Some other works have already shown the interest of such a notion of explanation not only for failure analysis.
dc.descriptionIn M. Ducasse (ed), proceedings of the Fourth International Workshop on Automated Debugging (AADEBUG 2000), August 2000, Munich. cs.SE/0010035
dc.identifierhttps://arxiv.org/abs/cs/0012005
dc.identifierhttp://arxiv.org/abs/cs/0012005
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30486
dc.subjectSoftware Engineering
dc.subjectProgramming Languages
dc.subjectD.2.5
dc.titleValue Withdrawal Explanation in CSP
dc.typetext

Files

Collections

arXiv