Proving Termination of Constraint Solver Programs
Author:
- 1 January 2000
- book chapter
- Published by Springer Nature
- p. 298-317
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A prolog constraint handling rules compiler and runtime systemApplied Artificial Intelligence, 2000
- Placing base stations in wireless indoor communication networksIEEE Intelligent Systems and their Applications, 2000
- Termination of logic programs with delay declarationsThe Journal of Logic Programming, 1999
- Theory and practice of constraint handling rulesThe Journal of Logic Programming, 1998
- Proving termination of GHC programsNew Generation Computing, 1997
- Operational semantics and confluence of constraint propagation rules1997
- Constraint logic programming: a surveyThe Journal of Logic Programming, 1994
- Strong termination of logic programsThe Journal of Logic Programming, 1993
- Constraint satisfaction using constraint logic programmingArtificial Intelligence, 1992
- The complexity of some polynomial network consistency algorithms for constraint satisfaction problemsArtificial Intelligence, 1985