Abstract domains in constraint programming
Constraint Programming aims at solving hard combinatorial problems, with a computation time increasing in practice exponentially. The methods are today efficient enough to solve large industrial problems, in a generic framework. However, solvers are dedicated to a single variable type: integer or re...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
London, UK Kidlington, Oxford, UK
ISTE Press Elsevier
2015
|
| Subjects: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- State of the art
- Abstract interpretation for the constraints
- Octagons
- Octagonal solving
- An abstract solver: absolute