Extending the Finite Domain Solver of GNU Prolog - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Extending the Finite Domain Solver of GNU Prolog

Daniel Diaz
Salvador Abreu

Résumé

This paper describes three significant extensions for the Finite Domain solver of GNU Prolog. First, the solver now supports negative integers. Second, the solver detects and prevents integer overflows from occurring. Third, the internal representation of sparse domains has been redesigned to overcome its current limitations. The preliminary performance evaluation shows a limited slowdown factor with respect to the initial solver. This factor is widely counterbalanced by the new possibilities and the robustness of the solver. Furthermore these results are preliminary and we propose some directions to limit this overhead.
Fichier non déposé

Dates et versions

hal-01220207 , version 1 (25-10-2015)

Identifiants

  • HAL Id : hal-01220207 , version 1

Citer

Bloemen Vincent, Daniel Diaz, Salvador Abreu. Extending the Finite Domain Solver of GNU Prolog. International Joint Workshop on Implementation of Constraint and Logic Programming Systems and Logic-based Methods in Programming Environments (CICLOPS), 2014, Vienne, Austria. ⟨hal-01220207⟩

Collections

UNIV-PARIS1 CRI
44 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More