A Comparative Study of Eight Constraint Programming Languages Over the Boolean and Finite Domains
- 1 July 2000
- journal article
- Published by Springer Nature in Constraints
- Vol. 5 (3) , 275-301
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- An open-ended finite domain constraint solver1997
- A simple and efficient boolean solver for Constraint Logic ProgrammingJournal of Automated Reasoning, 1996
- Compiling constraints in clp(FD)The Journal of Logic Programming, 1996
- Constraint handling rules1995
- Design, implementation, and evaluation of the constraint language cc(FD)Lecture Notes in Computer Science, 1995
- Interval constraint logic programming1995
- The Oz Programming Model1995
- Constraint logic programming: a surveyThe Journal of Logic Programming, 1994
- Clp(B): Combining simplicity and efficiency in boolean Constraint solvingLecture Notes in Computer Science, 1994
- Increasing tree search efficiency for constraint satisfaction problemsArtificial Intelligence, 1980