Combining finite and continuous solvers Towards a simpler solver maintenance

Jean-Guillaume Fages (1, 2) , Gilles Chabert (2) , Charles Prud'Homme (2)

1 LINA - Laboratoire d'Informatique de Nantes Atlantique
2 TASC - Theory, Algorithms and Systems for Constraints

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.

Mots clés: Constraint Programming Solvers; Finite Domains; Continuous Domains

Domaines: Intelligence artificielle [cs.AI]; Mathématique discrète [cs.DM]; Arithmétique des ordinateurs

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⟩