This 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… (More)

In this paper, we present a general scheme for incremental constraint retraction algorithms that encompasses all existing algorithms. Moreover, we introduce some necessary conditions to ensure the… (More)

Blache [1] introduced Property Grammar as a formalism where linguistic information is represented in terms of non hierarchical constraints. This feature gives it an adequate expressive power to… (More)

Introduction 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… (More)

The paper proposes a theoretical approach of the debugging of constraint programs based on a notion of explanation tree. The proposed approach is an attempt to adapt algorithmic debugging to… (More)

Constraint logic programming combines declarativity and efciency thanks to constraint solvers implemented for speci c domains. Value withdrawal explanations have been e ciently used in several… (More)

The aim of this report is to provide the theoretical foundations of domain reduction. The model is well suited to the solvers on finite domains which are used on the respective platforms of each… (More)

Solvers on finite domains use local consistency notions to remove values from the domains. This paper defines value withdrawal explanations. Domain reduction is formalized with chaotic iterations of… (More)

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… (More)