Extending the Finite Domain Solver of GNU Prolog

Vincent  Bloemen; Daniel Diaz; Machiel van der Bijl; Salvador Abreu

Extending the Finite Domain Solver of GNU Prolog

Vincent Bloemen, Daniel Diaz, Machiel van der Bijl, Salvador Abreu

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

30 Downloads (Pure)

Abstract

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.

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

Access to Document

Bloemen2014extending
open
Final published version, 287 KB

http://ftp.informatik.rwth-aachen.de/Publications/AIB/2014/2014-09.pdf#page=47

Cite this

Bloemen, V., Diaz, D., van der Bijl, M., & Abreu, S. (2014). Extending the Finite Domain Solver of GNU Prolog. In T. Ströder, & T. Swift (Eds.), Proceedings of the International Joint Workshop on Implementation of Constraint and Logic Programming Systems and Logic-based Methods in Programming Environments 2014 (pp. 47-62). (Aachener Informatik-Berichte (AIB); No. 2014-09). Aachen: RWTH Aachen.

Bloemen, Vincent ; Diaz, Daniel ; van der Bijl, Machiel ; Abreu, Salvador. / Extending the Finite Domain Solver of GNU Prolog. Proceedings of the International Joint Workshop on Implementation of Constraint and Logic Programming Systems and Logic-based Methods in Programming Environments 2014. editor / Thomas Ströder ; Terrance Swift. Aachen : RWTH Aachen, 2014. pp. 47-62 (Aachener Informatik-Berichte (AIB); 2014-09).

@inproceedings{7fbf5cb74ccc479ab365500a7e70e236,

title = "Extending the Finite Domain Solver of GNU Prolog",

abstract = "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.",

keywords = "EWI-25798, CR-D.2.5, test data, METIS-309926, constraint solving, Model-Based Testing, IR-94675, test generation",

author = "Vincent Bloemen and Daniel Diaz and {van der Bijl}, Machiel and Salvador Abreu",

note = "eemcs-eprint-25798",

year = "2014",

month = "7",

language = "English",

series = "Aachener Informatik-Berichte (AIB)",

publisher = "RWTH Aachen",

number = "2014-09",

pages = "47--62",

editor = "Thomas Str{\"o}der and Terrance Swift",

booktitle = "Proceedings of the International Joint Workshop on Implementation of Constraint and Logic Programming Systems and Logic-based Methods in Programming Environments 2014",

}

Bloemen, V, Diaz, D, van der Bijl, M & Abreu, S 2014, Extending the Finite Domain Solver of GNU Prolog. in T Ströder & T Swift (eds), Proceedings of the International Joint Workshop on Implementation of Constraint and Logic Programming Systems and Logic-based Methods in Programming Environments 2014. Aachener Informatik-Berichte (AIB), no. 2014-09, RWTH Aachen, Aachen, pp. 47-62, International Joint Workshop on Implementation of Constraint and Logic Programming Systems and Logic-based Methods in Programming Environments 2014, Vienna, Austria, 17/07/14.

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 -

Bloemen V, Diaz D, van der Bijl M, Abreu S. Extending the Finite Domain Solver of GNU Prolog. In Ströder T, Swift T, editors, Proceedings of the International Joint Workshop on Implementation of Constraint and Logic Programming Systems and Logic-based Methods in Programming Environments 2014. Aachen: RWTH Aachen. 2014. p. 47-62. (Aachener Informatik-Berichte (AIB); 2014-09).