Abstract
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the International Joint Workshop on Implementation of Constraint and Logic Programming Systems and Logic-based Methods in Programming Environments 2014 |
| Editors | Thomas Ströder, Terrance Swift |
| Place of Publication | Aachen |
| Publisher | RWTH Aachen |
| Pages | 47-62 |
| Number of pages | 16 |
| Publication status | Published - Jul 2014 |
| Event | International Joint Workshop on Implementation of Constraint and Logic Programming Systems and Logic-based Methods in Programming Environments 2014 - Vienna, Austria Duration: 17 Jul 2014 → 18 Jul 2014 |
Publication series
| Name | Aachener Informatik-Berichte (AIB) |
|---|---|
| Publisher | RWTH Aachen |
| Number | 2014-09 |
| ISSN (Print) | 0935-3232 |
Workshop
| Workshop | International Joint Workshop on Implementation of Constraint and Logic Programming Systems and Logic-based Methods in Programming Environments 2014 |
|---|---|
| Abbreviated title | CICLOPS-WLPE |
| Country | Austria |
| City | Vienna |
| Period | 17/07/14 → 18/07/14 |
Keywords
- EWI-25798
- CR-D.2.5
- test data
- METIS-309926
- constraint solving
- Model-Based Testing
- IR-94675
- test generation
Cite this
}
Extending the Finite Domain Solver of GNU Prolog. / Bloemen, Vincent ; Diaz, Daniel; van der Bijl, Machiel; Abreu, Salvador.
Proceedings of the International Joint Workshop on Implementation of Constraint and Logic Programming Systems and Logic-based Methods in Programming Environments 2014. ed. / Thomas Ströder; Terrance Swift. Aachen : RWTH Aachen, 2014. p. 47-62 (Aachener Informatik-Berichte (AIB); No. 2014-09).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review
TY - GEN
T1 - Extending the Finite Domain Solver of GNU Prolog
AU - Bloemen, Vincent
AU - Diaz, Daniel
AU - van der Bijl, Machiel
AU - Abreu, Salvador
N1 - eemcs-eprint-25798
PY - 2014/7
Y1 - 2014/7
N2 - 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.
AB - 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.
KW - EWI-25798
KW - CR-D.2.5
KW - test data
KW - METIS-309926
KW - constraint solving
KW - Model-Based Testing
KW - IR-94675
KW - test generation
M3 - Conference contribution
T3 - Aachener Informatik-Berichte (AIB)
SP - 47
EP - 62
BT - Proceedings of the International Joint Workshop on Implementation of Constraint and Logic Programming Systems and Logic-based Methods in Programming Environments 2014
A2 - Ströder, Thomas
A2 - Swift, Terrance
PB - RWTH Aachen
CY - Aachen
ER -