| Description |
1 online resource |
|
text txt rdacontent |
|
computer c rdamedia |
|
online resource cr rdacarrier |
|
text file |
| Summary |
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 real. Solving mixed problems relies on ad hoc transformations. In another field, Abstract Interpretation offers tools to prove program properties, by studying an abstraction of their concrete semantics, that is, the set of possible values of the variables during an execution. Various representations for these abstractions have been proposed. They are called abstract domains. Abstract domains can mix any type of variables, and even represent relations between the variables. In this work, we define abstract domains for Constraint Programming, so as to build a generic solving method, dealing with both integer and real variables. We also study the octagons abstract domain, already defined in Abstract Interpretation. Guiding the search by the octagonal relations, we obtain good results on a continuous benchmark. We also define our solving method using Abstract Interpretation techniques, in order to include existing abstract domains. Our solver, AbSolute, is able to solve mixed problems and use relational domains. |
| Note |
Online resource; title from PDF title page (ScienceDirect, viewed May 20, 2015). |
| Contents |
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. |
| Bibliography |
Includes bibliographical references and index. |
| Subject |
Constraint programming (Computer science)
|
|
Programmation par contraintes.
|
|
COMPUTERS -- Programming -- General.
|
|
Constraint programming (Computer science)
|
| Other Form: |
Print version: 9780081004647 (OCoLC)909525346 |
| ISBN |
9780081004647 (electronic bk.) |
|
0081004648 (electronic bk.) |
|
9781785480102 |
|
1785480103 |
| Standard No. |
AU@ 000054975406 |
|
AU@ 000058374623 |
|
CHBIS 010547885 |
|
CHNEW 001001163 |
|
CHNEW 001026549 |
|
CHSLU 001313402 |
|
CHVBK 341782483 |
|
CHVBK 511172087 |
|
DEBBG BV042991495 |
|
DEBBG BV043620610 |
|
DEBSZ 433954191 |
|
DEBSZ 45333010X |
|
NZ1 16091527 |
|
