Analysis and Compilation of Constraint Solving Algorithms: A Case Study.
Panagiotis TsarchopoulosPublished in: ILPS Workshop: Implementation Techniques for Logic Programming Languages (1994)
Keyphrases
- constraint solving
- computationally efficient
- case study
- learning algorithm
- computational complexity
- data analysis
- constraint propagation
- lower bound
- significant improvement
- computational cost
- upper bound
- worst case
- constraint satisfaction problems
- constraint satisfaction
- combinatorial optimization
- constraint programming
- branch and bound
- complexity analysis