Abstract Domains in Constraint Programming
| Author/creator | Pelleau, Marie Author |
| Format | Electronic |
| Publication Info | San Diego : Elsevier Science & Technology Books |
| Description | 176 p. 09.000 x 06.000 in. |
| Supplemental Content | Full text available from eBook - Computer Science 2015 [EBCCS15] |
| Supplemental Content | Full text available from eBooks on EBSCOhost |
| Subjects |
| Summary | Annotation 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. 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 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. |
| Access restriction | Available only to authorized users. |
| Technical details | Mode of access: World Wide Web |
| Genre/form | Electronic books. |
| ISBN | 9781785480102 |
| ISBN | 1785480103 (Trade Cloth) Active Record |
| Standard identifier# | 9781785480102 |
| Stock number | 00991439 |
Availability
| Library | Location | Call Number | Status | Item Actions |
|---|---|---|---|---|
| Electronic Resources | ✔ Available |