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...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Elsevier Science
2015
|
| Schlagworte: | |
| Zusammenfassung: | 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. Exploits the over-approximation methods to integrate AI tools in the methods of CPExploits the relationships captured to solve continuous problems more effectivelyLearn from the developers of a solver capable of handling practically all abstract domains |
| Beschreibung: | Description based on publisher supplied metadata and other sources |
| Beschreibung: | 1 online resource (177 pages) |
| ISBN: | 9780081004647 9781785480102 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV043620610 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 160616s2015 |||| o||u| ||||||eng d | ||
| 020 | |a 9780081004647 |9 978-0-08-100464-7 | ||
| 020 | |a 9781785480102 |c Print |9 978-1-78548-010-2 | ||
| 035 | |a (ZDB-30-PQE)EBC2055770 | ||
| 035 | |a (ZDB-89-EBL)EBL2055770 | ||
| 035 | |a (ZDB-38-EBR)ebr11056152 | ||
| 035 | |a (OCoLC)909525346 | ||
| 035 | |a (DE-599)BVBBV043620610 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 082 | 0 | |a 005.13 | |
| 100 | 1 | |a Pelleau, Marie |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Abstract Domains in Constraint Programming |
| 264 | 1 | |b Elsevier Science |c 2015 | |
| 264 | 4 | |c © 2015 | |
| 300 | |a 1 online resource (177 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Description based on publisher supplied metadata and other sources | ||
| 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. Exploits the over-approximation methods to integrate AI tools in the methods of CPExploits the relationships captured to solve continuous problems more effectivelyLearn from the developers of a solver capable of handling practically all abstract domains | ||
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Constraint programming (Computer science) -- Congresses | |
| 650 | 4 | |a Constraint programming (Computer science) | |
| 650 | 4 | |a Decision making -- Data processing | |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |2 gnd-content | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |a Pelleau, Marie |t Abstract Domains in Constraint Programming |
| 912 | |a ZDB-30-PQE |a ZDB-33-EBS | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029034669 | ||
Datensatz im Suchindex
| _version_ | 1804176359917879296 |
|---|---|
| any_adam_object | |
| author | Pelleau, Marie |
| author_facet | Pelleau, Marie |
| author_role | aut |
| author_sort | Pelleau, Marie |
| author_variant | m p mp |
| building | Verbundindex |
| bvnumber | BV043620610 |
| collection | ZDB-30-PQE ZDB-33-EBS |
| ctrlnum | (ZDB-30-PQE)EBC2055770 (ZDB-89-EBL)EBL2055770 (ZDB-38-EBR)ebr11056152 (OCoLC)909525346 (DE-599)BVBBV043620610 |
| dewey-full | 005.13 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.13 |
| dewey-search | 005.13 |
| dewey-sort | 15.13 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03013nmm a2200421zc 4500</leader><controlfield tag="001">BV043620610</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">160616s2015 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780081004647</subfield><subfield code="9">978-0-08-100464-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781785480102</subfield><subfield code="c">Print</subfield><subfield code="9">978-1-78548-010-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-30-PQE)EBC2055770</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-89-EBL)EBL2055770</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-38-EBR)ebr11056152</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)909525346</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043620610</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.13</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Pelleau, Marie</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Abstract Domains in Constraint Programming</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="b">Elsevier Science</subfield><subfield code="c">2015</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 2015</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (177 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Description based on publisher supplied metadata and other sources</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="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. Exploits the over-approximation methods to integrate AI tools in the methods of CPExploits the relationships captured to solve continuous problems more effectivelyLearn from the developers of a solver capable of handling practically all abstract domains</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Constraint programming (Computer science) -- Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Constraint programming (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Decision making -- Data processing</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="a">Pelleau, Marie</subfield><subfield code="t">Abstract Domains in Constraint Programming</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-PQE</subfield><subfield code="a">ZDB-33-EBS</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029034669</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift gnd-content |
| genre_facet | Konferenzschrift |
| id | DE-604.BV043620610 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:30:56Z |
| institution | BVB |
| isbn | 9780081004647 9781785480102 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029034669 |
| oclc_num | 909525346 |
| open_access_boolean | |
| physical | 1 online resource (177 pages) |
| psigel | ZDB-30-PQE ZDB-33-EBS |
| publishDate | 2015 |
| publishDateSearch | 2015 |
| publishDateSort | 2015 |
| publisher | Elsevier Science |
| record_format | marc |
| spelling | Pelleau, Marie Verfasser aut Abstract Domains in Constraint Programming Elsevier Science 2015 © 2015 1 online resource (177 pages) txt rdacontent c rdamedia cr rdacarrier Description based on publisher supplied metadata and other sources 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. Exploits the over-approximation methods to integrate AI tools in the methods of CPExploits the relationships captured to solve continuous problems more effectivelyLearn from the developers of a solver capable of handling practically all abstract domains Datenverarbeitung Constraint programming (Computer science) -- Congresses Constraint programming (Computer science) Decision making -- Data processing (DE-588)1071861417 Konferenzschrift gnd-content Erscheint auch als Druck-Ausgabe Pelleau, Marie Abstract Domains in Constraint Programming |
| spellingShingle | Pelleau, Marie Abstract Domains in Constraint Programming Datenverarbeitung Constraint programming (Computer science) -- Congresses Constraint programming (Computer science) Decision making -- Data processing |
| subject_GND | (DE-588)1071861417 |
| title | Abstract Domains in Constraint Programming |
| title_auth | Abstract Domains in Constraint Programming |
| title_exact_search | Abstract Domains in Constraint Programming |
| title_full | Abstract Domains in Constraint Programming |
| title_fullStr | Abstract Domains in Constraint Programming |
| title_full_unstemmed | Abstract Domains in Constraint Programming |
| title_short | Abstract Domains in Constraint Programming |
| title_sort | abstract domains in constraint programming |
| topic | Datenverarbeitung Constraint programming (Computer science) -- Congresses Constraint programming (Computer science) Decision making -- Data processing |
| topic_facet | Datenverarbeitung Constraint programming (Computer science) -- Congresses Constraint programming (Computer science) Decision making -- Data processing Konferenzschrift |
| work_keys_str_mv | AT pelleaumarie abstractdomainsinconstraintprogramming |