Cargando…
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...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
London, UK : Kidlington, Oxford, UK :
ISTE Press ; Elsevier,
2015.
|
| Temas: | |
| Acceso en línea: | Texto completo |
Tabla de Contenidos:
- Front Cover; Abstract Domains in Constraint Programming; Dedication; Copyright; Contents; Preface; Introduction; I.1. Context; I.2. Problematic; I.3. Outline of the book; I.4. Contributions; Chapter 1: State of the Art; 1.1. Abstract Interpretation; 1.2. Constraint Programming; 1.3. Synthesis; Chapter 2: Abstract Interpretation for the Constraints; 2.1. Introduction; 2.2. Unified Components; 2.3. Unified Solving; 2.4. Conclusion; Chapter 3: Octagons; 3.1. Definitions; 3.2. Representations; 3.3. Abstract Domain Components; 3.4. Abstract Domains; Chapter 4: Octagonal Solving; 4.1. Octagonal CSP.
- 4.2. Octagonal Consistency and Propagation4.3. Octagonal Solver; 4.4. Experimental Results; 4.5. Conclusion; Chapter 5: An Abstract Solver: AbSolute; 5.1. Abstract Solving Method; 5.2. The AbSolute Solver; 5.3. Conclusion; Conclusion and Perspectives; C.1. Conclusion; C.2. Perspectives; Bibliography; Index.