Testing Global Constraints
Artificial Intelligence
2018-07-12 v1 Software Engineering
Abstract
Every Constraint Programming (CP) solver exposes a library of constraints for solving combinatorial problems. In order to be useful, CP solvers need to be bug-free. Therefore the testing of the solver is crucial to make developers and users confident. We present a Java library allowing any JVM based solver to test that the implementations of the individual constraints are correct. The library can be used in a test suite executed in a continuous integration tool or it can also be used to discover minimalist instances violating some properties (arc-consistency, etc) in order to help the developer to identify the origin of the problem using standard debuggers.
Cite
@article{arxiv.1807.03975,
title = {Testing Global Constraints},
author = {Aurélie Massart and Valentin Rombouts and Pierre Schaus},
journal= {arXiv preprint arXiv:1807.03975},
year = {2018}
}
Comments
CP2018 Doctoral Program http://cp2018.a4cp.org/doctoral.html