Solving loosely coupled constraints

Michel Le Borgne 1, *
* Corresponding author
1 SYMBIOSE - Biological systems and models, bioinformatics and sequences
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : 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.
Complete list of metadatas

Cited literature [3 references]  Display  Hide  Download

https://hal.inria.fr/inria-00397098
Contributor : Michel Le Borgne <>
Submitted on : Friday, June 19, 2009 - 3:19:06 PM
Last modification on : Friday, November 16, 2018 - 1:22:24 AM
Long-term archiving on : Tuesday, June 15, 2010 - 5:16:17 PM

Files

RR-6958.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00397098, version 1

Citation

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

Share

Metrics

Record views

312

Files downloads

152