A comparative study of eight constraint programming languages over the Boolean and finite domains
From MaRDI portal
Publication:1579086
DOI10.1023/A:1009816801567zbMath0954.68031MaRDI QIDQ1579086
Patricia M. Hill, Antonio J. Fernández
Publication date: 4 September 2000
Published in: Constraints (Search for Journal in Brave)
Related Items (5)
Executable specifications for hypothesis-based reasoning with Prolog and Constraint Handling Rules ⋮ Towards a practical engineering tool for rostering ⋮ Evaluating ASP and commercial solvers on the CSPLib ⋮ An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems ⋮ The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments
This page was built for publication: A comparative study of eight constraint programming languages over the Boolean and finite domains
