A Methodological View of Constraint Solving |
| |
Authors: | Hubert Comon Mehmet Dincbas Jean-Pierre Jouannaud Claude Kirchner |
| |
Affiliation: | (1) LSV, Ecole Normale Supérieure de Cachan, 61 Ave. Président Wilson, 94235 Cachan Cedex, France;(2) COSYTEC, Parc Club Orsay Université, 4 Rue Jean Rostand, 91893 Orsay Cedex, France;(3) CNRS and LRI, Bat. 490, Université de Paris Sud, 91405 ORSAY Cedex, France;(4) LORIA & INRIA, 615 Rue du Jardin Botanique, 54602 Villers-lès-Nancy Cedex, France |
| |
Abstract: | Constraints are an effective tool to define sets of data by means of logical formulae. Our goal here is to survey the notion of constraint system and to give examples of constraint systems operating on various domains, such as natural, rational or real numbers, finite domains, and term domains. We classify the different methods used for solving constraints, syntactic methods based on transformations, semantic methods based on adequate representations of constraints, hybrid methods combining transformations and enumerations. The concepts and methods are illustrated via examples. We also discuss applications of constraints to various fields, such as programming, operations research, and theorem proving. |
| |
Keywords: | constraint solving constraint satisfiability unification rule based solving |
本文献已被 SpringerLink 等数据库收录! |
|