On the complexity of integer programming
Journal of the ACM (JACM)
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
CSPLIB: A Benchmark Library for Constraints
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
The Seven-Eleven Problem
An analysis of slow convergence in interval propagation
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
On the portability of prolog applications
PADL'11 Proceedings of the 13th international conference on Practical aspects of declarative languages
DES: A Deductive Database System
Electronic Notes in Theoretical Computer Science (ENTCS)
Constraint programming with arbitrarily large integer variables
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
| Hi-index | 0.00 |
Finite domain constraint solvers are typically applied to problems with only quite small values. This is the case in many tasks for which constraint-based approaches are well suited. A well-known benchmark library for constraints, CSPLib ([1]), consists almost exclusively of such examples. On the other hand, the need for arbitrary precision integer arithmetic is widely recognised, and many common Prolog systems provide transparent built-in support for arbitrarily large integers.