Search Strategies as Synchronous Processes (Extended Abstract)

Pierre Talbot 1
1 Repmus - Représentations musicales
STMS - Sciences et Technologies de la Musique et du Son
Abstract : Solving constraint satisfaction problems (CSP) efficiently depends on the solver configuration and the search strategy. However, it is difficult to customize the constraint solvers because they are not modular enough, and it is hard to create new search strategies by composition. To solve these problems, we propose spacetime programming, a paradigm based on lattices and synchronous process calculi that views search strategies as processes working collaboratively towards the resolution of a CSP. We implement the compiler of the language and use it to replace the search module of Choco, a state of the art constraint solver, with an efficient spacetime program that offers better modularity and compositionality of search strategies.
Document type :
Conference papers
Liste complète des métadonnées
Contributor : Pierre Talbot <>
Submitted on : Tuesday, September 26, 2017 - 9:19:51 PM
Last modification on : Thursday, March 21, 2019 - 1:13:11 PM



Pierre Talbot. Search Strategies as Synchronous Processes (Extended Abstract). Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Aug 2017, Melbourne, Australia. ⟨10.24963/ijcai.2017/766 ⟩. ⟨hal-01594862⟩



Record views