Hiérarchie de contraintes : quelques approches de résolution

Abstract : The goal of this work is to propose some approaches that solve functional constraint hierarchies. First, we define the role and the interesting features of a constraint hierarchy. A constraint hierarchy allows to represent and solve over-constrained problems. Second, we have conceived a new solver that solves and maintains solutions of a functional constraint hierarchy, in order to obtain solutions of a better quality than the existing solvers. The algorithmic approach used by this solver is the "best first search". This solver considers different error combination modes at each level of the hierarchy and uses a global lexicographic aggregation on the values of these combinations. The global combination modes integrated in this solver are : the number of unsatisfied constraints, a combination where the weights represent priorities between the constraints in order to handle replacement constraints and the sum of the weights of unsatisfied constraints. Third, we propose an algorithm based on the previous solver and on the extended notion of comparators for comparisons between the hierarchies that anse from alternate rule choices in the program. This algorithm is more promising than a branch and bound algorithm and can be incorporated in hierarchical constraint logic programing languages. This algorithm allows to achieve the inter-hierarchies comparison and to eliminate the hierarchies such that these hierarchies may lead to undesirable solutions. Finally, we propose a model of a second solver. It treats a single system where different types of constraints are unified. This solver supports constraints with multi-output variables. If constraints don't need to be solved simultaneously then this solver divides them as much as possible into subsets of constraints and solves each subset by invoking a specific subsolver.
Document type :
Theses
Complete list of metadatas

Cited literature [92 references]  Display  Hide  Download

https://pastel.archives-ouvertes.fr/tel-00520756
Contributor : Ecole Des Ponts Paristech <>
Submitted on : Monday, December 20, 2010 - 1:32:38 PM
Last modification on : Tuesday, April 24, 2018 - 1:36:01 PM
Long-term archiving on : Monday, March 21, 2011 - 2:34:02 AM

Identifiers

  • HAL Id : tel-00520756, version 1

Collections

Citation

Mouhssine Bouzoubaa. Hiérarchie de contraintes : quelques approches de résolution. Génie logiciel [cs.SE]. Ecole Nationale des Ponts et Chaussées, 1996. Français. ⟨NNT : 1996ENPC9624⟩. ⟨tel-00520756⟩

Share

Metrics

Record views

352

Files downloads

918