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 |
MARC
| LEADER | 00000cam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | SCIDIR_ocn909525346 | ||
| 003 | OCoLC | ||
| 005 | 20231120111958.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 150520s2015 enk ob 001 0 eng d | ||
| 040 | |a OPELS |b eng |e rda |e pn |c OPELS |d CDX |d N$T |d COO |d UIU |d IDEBK |d E7B |d YDXCP |d EBLCP |d NLGGC |d DEBSZ |d OCLCF |d AZK |d FEM |d VGM |d OCLCQ |d MERUC |d WRM |d U3W |d D6H |d OCLCQ |d WYU |d DCT |d OCLCO |d OCLCQ |d MM9 |d OCLCO |d OCLCQ |d OCLCO | ||
| 019 | |a 910446832 |a 961628022 |a 968063401 |a 969066512 | ||
| 020 | |a 9780081004647 |q (electronic bk.) | ||
| 020 | |a 0081004648 |q (electronic bk.) | ||
| 020 | |z 9781785480102 | ||
| 020 | |z 1785480103 | ||
| 035 | |a (OCoLC)909525346 |z (OCoLC)910446832 |z (OCoLC)961628022 |z (OCoLC)968063401 |z (OCoLC)969066512 | ||
| 050 | 4 | |a QA76.612 | |
| 072 | 7 | |a COM |x 051000 |2 bisacsh | |
| 082 | 0 | 4 | |a 005.1/16 |2 23 |
| 100 | 1 | |a Pelleau, Marie, |e author. | |
| 245 | 1 | 0 | |a Abstract domains in constraint programming / |c Marie Pelleau. |
| 264 | 1 | |a London, UK : |b ISTE Press ; |a Kidlington, Oxford, UK : |b Elsevier, |c 2015. | |
| 300 | |a 1 online resource | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a text file | ||
| 520 | |a 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. | ||
| 588 | 0 | |a Online resource; title from PDF title page (ScienceDirect, viewed May 20, 2015). | |
| 505 | 0 | |a 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. | |
| 505 | 8 | |a 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. | |
| 504 | |a Includes bibliographical references and index. | ||
| 650 | 0 | |a Constraint programming (Computer science) | |
| 650 | 6 | |a Programmation par contraintes. |0 (CaQQLa)201-0265311 | |
| 650 | 7 | |a COMPUTERS |x Programming |x General. |2 bisacsh | |
| 650 | 7 | |a Constraint programming (Computer science) |2 fast |0 (OCoLC)fst00875873 | |
| 776 | 0 | 8 | |i Print version: |z 9780081004647 |w (OCoLC)909525346 |
| 856 | 4 | 0 | |u https://sciencedirect.uam.elogim.com/science/book/9781785480102 |z Texto completo |