Extending the Finite Domain Solver of GNU Prolog

Vincent Bloemen, Vincent Bloemen, Daniel Diaz, H.M. van der Bijl, Salvador Abreu

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 languageUndefined
Title of host publicationProceedings of the International Joint Workshop on Implementation of Constraint and Logic Programming Systems and Logic-based Methods in Programming Environments 2014
EditorsT. Ströder, T. Swift
Place of PublicationAachen
PublisherRWTH Aachen, Department of Computer Science
Pages47-62
Number of pages16
ISBN (Print)0935-3232
StatePublished - Jul 2014

Publication series

NameAachener Informatik-Berichte
PublisherRWTH Aachen, Department of Computer Science
NumberAIB-2014-09
Volume2014-09
ISSN (Print)0935-3232

Keywords

  • EWI-25798
  • CR-D.2.5
  • test data
  • METIS-309926
  • constraint solving
  • Model-Based Testing
  • IR-94675
  • test generation

Cite this

Bloemen, V., Bloemen, V., Diaz, D., van der Bijl, H. 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; Vol. 2014-09, No. AIB-2014-09). Aachen: RWTH Aachen, Department of Computer Science.

Bloemen, Vincent; Bloemen, Vincent; Diaz, Daniel; van der Bijl, H.M.; 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. ed. / T. Ströder; T. Swift. Aachen : RWTH Aachen, Department of Computer Science, 2014. p. 47-62 (Aachener Informatik-Berichte; Vol. 2014-09, No. AIB-2014-09).

Research output: Scientific - peer-reviewConference contribution

@inbook{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 Vincent Bloemen and Daniel Diaz and {van der Bijl}, H.M. and Salvador Abreu",
note = "eemcs-eprint-25798",
year = "2014",
month = "7",
isbn = "0935-3232",
series = "Aachener Informatik-Berichte",
publisher = "RWTH Aachen, Department of Computer Science",
number = "AIB-2014-09",
pages = "47--62",
editor = "T. Ströder and T. 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, Bloemen, V, Diaz, D, van der Bijl, HM & 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, no. AIB-2014-09, vol. 2014-09, RWTH Aachen, Department of Computer Science, Aachen, pp. 47-62.

Extending the Finite Domain Solver of GNU Prolog. / Bloemen, Vincent; Bloemen, Vincent; Diaz, Daniel; van der Bijl, H.M.; 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. / T. Ströder; T. Swift. Aachen : RWTH Aachen, Department of Computer Science, 2014. p. 47-62 (Aachener Informatik-Berichte; Vol. 2014-09, No. AIB-2014-09).

Research output: Scientific - peer-reviewConference contribution

TY - CHAP

T1 - Extending the Finite Domain Solver of GNU Prolog

AU - Bloemen,Vincent

AU - Bloemen,Vincent

AU - Diaz,Daniel

AU - van der Bijl,H.M.

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

SN - 0935-3232

T3 - Aachener Informatik-Berichte

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

PB - RWTH Aachen, Department of Computer Science

ER -

Bloemen V, Bloemen V, Diaz D, van der Bijl HM, 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, Department of Computer Science. 2014. p. 47-62. (Aachener Informatik-Berichte; AIB-2014-09).