Solving loosely coupled constraints - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2009

Solving loosely coupled constraints



Many practical problems are modelled by mean of constraints which, pairwise, share only a few variables if any. Suc constraints are loosely coupled. In this paper we show how to use this property to lower the complexity of decision procedures or solvers. The introduction of a data structure, the well formed covering tree allows for a reparametrisation of constraint problems in a way which can be seen as a generalisation of the triangulation procedure for system of linear equations.
Fichier principal
Vignette du fichier
RR-6958.pdf (150.04 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00397098 , version 1 (19-06-2009)


  • HAL Id : inria-00397098 , version 1


Michel Le Borgne. Solving loosely coupled constraints. [Research Report] RR-6958, INRIA. 2009, pp.19. ⟨inria-00397098⟩
101 View
72 Download


Gmail Facebook Twitter LinkedIn More