Search by Constraint Propagation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Search by Constraint Propagation


Constraint programming is traditionally viewed as the combination of two components: a constraint model and a search procedure. In this paper we show that tree search procedures can be fully inter-nalized in the constraint model with a fixed enumeration strategy. This approach has several advantages: 1) it makes search strategies declarative, and modeled as constraint satisfaction problems; 2) it makes it possible to express search strategies in existing front-end modeling languages supporting reified constraints without any extension ; 3) it opens up constraint propagation algorithms to search constraints and to the implementation of novel search procedures based on constraint propagation. We illustrate this approach with a Horn clause extension of the MiniZinc modeling language and the modeling in this language of a variety of search procedures, including dynamic symmetry breaking procedures and limited discrepancy search, as constraint satisfaction problems. We show that this generality does not come with a significant overhead, and can in fact exhibit exponential speedups over procedural implementations, thanks to the propagation of the search constraints..
Fichier principal
Vignette du fichier
MFS15ppdp.pdf (323.4 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01140761 , version 1 (09-04-2015)



Thierry Martinez, François Fages, Sylvain Soliman. Search by Constraint Propagation. PPDP '15- 17th International Symposium on Principles and Practice of Declarative Programming, Jul 2015, Siena, Italy. pp.173--183, ⟨10.1145/2790449.2790527⟩. ⟨hal-01140761⟩


120 View
217 Download



Gmail Facebook X LinkedIn More