Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
Constraint satisfaction algorithms
Computational Intelligence
A minimal extension of the WAM for clp(FD)
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Timing trials, or the trials of timing: experiments with scripting and user-interface languages
Software—Practice & Experience
A high-level intermediate language and the algorithms for compiling finite-domain constraints
JICSLP'98 Proceedings of the 1998 joint international conference and symposium on Logic programming
Finding the Right Hybrid Algorithm – A Combinatorial Meta-Problem
Annals of Mathematics and Artificial Intelligence
An Open-Ended Finite Domain Constraint Solver
PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
Tight Cooperation and Its Application in Piecewise Linear Optimization
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Hybrid Benders Decomposition Algorithms in Constraint Logic Programming
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
A Prolog Benchmark Suite for Aquarius
A Prolog Benchmark Suite for Aquarius
Programming finite-domain constraint propagators in Action Rules
Theory and Practice of Logic Programming
Journal of Experimental & Theoretical Artificial Intelligence
Evaluating ASP and commercial solvers on the CSPLib
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
An experimental comparison of constraint logic programming and answer set programming
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
A comparison of CLP(FD) and ASP solutions to NP-Complete problems
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Improving the performance of FD constraint solving in a CFLP system
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
| Hi-index | 0.00 |
The comparative study published in this journal by Fernandez and Hill benchmarked some constraint programming systems on a set of well-known puzzles. The current article examines the positive and negative aspects of this kind of benchmarking.The article analyses some pitfalls in benchmarking, recalling previous published results from benchmarking different kinds of software, and explores some issues in comparative benchmarking of CLP systems.A benchmarking exercise should cover a broad set of representative problems and a broad set of programming constructs. This can be achieved using two kinds of benchmarking: Applications Benchmarking and Unit Testing. The article reports the authors' experiences with these two kinds of benchmarking in the context of the CHIC2 Esprit project. The benchmarks were used to unit test different features of the CLP system ECLiPSe and to compare application development with different high-level constraint platforms.The conclusion is that, in deciding which system to use on a new application, it is less useful to compare standard features of CLP systems, than to compare their relevant functionalities.