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.
Type de document :
Communication dans un congrès
The 19th International Conference on Principles and Practice of Constraint Programming, Sep 2013, Uppsala, Sweden. TRICS'13 Workshop: Techniques foR Implementing Constraint programming Systems
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00904069
Contributeur : Jean-Guillaume Fages <>
Soumis le : mercredi 13 novembre 2013 - 16:23:49
Dernière modification le : mercredi 29 juillet 2015 - 01:26:22
Document(s) archivé(s) le : vendredi 14 février 2014 - 15:50:58

Fichier

Chocobex.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00904069, version 1

Collections

Citation

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>

Partager

Métriques

Consultations de
la notice

256

Téléchargements du document

110