Combining finite and continuous solvers Towards a simpler solver maintenance

Jean-Guillaume Fages 1, 2 Gilles Chabert 2 Charles Prud'Homme 2
2 TASC - Theory, Algorithms and Systems for Constraints
LINA - Laboratoire d'Informatique de Nantes Atlantique, Département informatique - EMN, Inria Rennes – Bretagne Atlantique
Abstract : Combining efficiency with reliability within CP systems is one of the main concerns of CP developers. This paper presents a simple and efficient way to connect Choco and Ibex, two CP solvers respectively specialised on finite and continuous domains. This enables to take advantage of the most recent advances of the continuous community within Choco while saving development and maintenance resources, hence ensuring a better software quality.
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download
Contributor : Jean-Guillaume Fages <>
Submitted on : Wednesday, November 13, 2013 - 4:23:49 PM
Last modification on : Friday, June 22, 2018 - 9:29:27 AM
Long-term archiving on : Friday, February 14, 2014 - 3:50:58 PM


Files produced by the author(s)


  • HAL Id : hal-00904069, version 1


Jean-Guillaume Fages, Gilles Chabert, Charles Prud'Homme. Combining finite and continuous solvers Towards a simpler solver maintenance. The 19th International Conference on Principles and Practice of Constraint Programming, Sep 2013, Uppsala, Sweden. TRICS'13 Workshop: Techniques foR Implementing Constraint programming Systems. ⟨hal-00904069⟩



Record views


Files downloads