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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
London, UK
ISTE Press
2015
|
| Subjects: | |
| Online Access: | FLA01 Volltext |
| 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 |
| Item Description: | Includes bibliographical references and index |
| Physical Description: | 1 online resource |
| ISBN: | 9780081004647 0081004648 |
Staff View
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV046126845 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 190827s2015 |||| o||u| ||||||eng d | ||
| 020 | |a 9780081004647 |9 978-0-08-100464-7 | ||
| 020 | |a 0081004648 |9 0-08-100464-8 | ||
| 035 | |a (ZDB-33-ESD)ocn909525346 | ||
| 035 | |a (OCoLC)909525346 | ||
| 035 | |a (DE-599)BVBBV046126845 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 082 | 0 | |a 005.1/16 |2 23 | |
| 100 | 1 | |a Pelleau, Marie |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Abstract domains in constraint programming |c Marie Pelleau |
| 264 | 1 | |a London, UK |b ISTE Press |c 2015 | |
| 300 | |a 1 online resource | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Includes bibliographical references and index | ||
| 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 | ||
| 650 | 7 | |a COMPUTERS / Programming / General |2 bisacsh | |
| 650 | 7 | |a Constraint programming (Computer science) |2 fast | |
| 650 | 4 | |a Constraint programming (Computer science) | |
| 655 | 7 | |8 1\p |0 (DE-588)1071861417 |a Konferenzschrift |2 gnd-content | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 1785480103 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781785480102 |
| 856 | 4 | 0 | |u http://www.sciencedirect.com/science/book/9781785480102 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-33-ESD | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-031507299 | ||
| 347 | |a text file |2 rda | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u http://www.sciencedirect.com/science/book/9781785480102 |l FLA01 |p ZDB-33-ESD |q FLA_PDA_ESD |x Verlag |3 Volltext | |
Record in the Search Index
| _version_ | 1804180447339479040 |
|---|---|
| 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 | BV046126845 |
| collection | ZDB-33-ESD |
| ctrlnum | (ZDB-33-ESD)ocn909525346 (OCoLC)909525346 (DE-599)BVBBV046126845 |
| dewey-full | 005.1/16 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.1/16 |
| dewey-search | 005.1/16 |
| dewey-sort | 15.1 216 |
| 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>02973nmm a2200433zc 4500</leader><controlfield tag="001">BV046126845</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">190827s2015 |||| 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">0081004648</subfield><subfield code="9">0-08-100464-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-33-ESD)ocn909525346</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)909525346</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV046126845</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.1/16</subfield><subfield code="2">23</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><subfield code="c">Marie Pelleau</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">London, UK</subfield><subfield code="b">ISTE Press</subfield><subfield code="c">2015</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource</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">Includes bibliographical references and index</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</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Programming / General</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Constraint programming (Computer science)</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Constraint programming (Computer science)</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><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="z">1785480103</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781785480102</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://www.sciencedirect.com/science/book/9781785480102</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-33-ESD</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-031507299</subfield></datafield><datafield tag="347" ind1=" " ind2=" "><subfield code="a">text file</subfield><subfield code="2">rda</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://www.sciencedirect.com/science/book/9781785480102</subfield><subfield code="l">FLA01</subfield><subfield code="p">ZDB-33-ESD</subfield><subfield code="q">FLA_PDA_ESD</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| genre | 1\p (DE-588)1071861417 Konferenzschrift gnd-content |
| genre_facet | Konferenzschrift |
| id | DE-604.BV046126845 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T08:35:54Z |
| institution | BVB |
| isbn | 9780081004647 0081004648 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-031507299 |
| oclc_num | 909525346 |
| open_access_boolean | |
| physical | 1 online resource |
| psigel | ZDB-33-ESD ZDB-33-ESD FLA_PDA_ESD |
| publishDate | 2015 |
| publishDateSearch | 2015 |
| publishDateSort | 2015 |
| publisher | ISTE Press |
| record_format | marc |
| spelling | Pelleau, Marie Verfasser aut Abstract domains in constraint programming Marie Pelleau London, UK ISTE Press 2015 1 online resource txt rdacontent c rdamedia cr rdacarrier Includes bibliographical references and index 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 COMPUTERS / Programming / General bisacsh Constraint programming (Computer science) fast Constraint programming (Computer science) 1\p (DE-588)1071861417 Konferenzschrift gnd-content Erscheint auch als Druck-Ausgabe 1785480103 Erscheint auch als Druck-Ausgabe 9781785480102 http://www.sciencedirect.com/science/book/9781785480102 Verlag URL des Erstveröffentlichers Volltext text file rda 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Pelleau, Marie Abstract domains in constraint programming COMPUTERS / Programming / General bisacsh Constraint programming (Computer science) fast Constraint programming (Computer science) |
| 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 Marie Pelleau |
| title_fullStr | Abstract domains in constraint programming Marie Pelleau |
| title_full_unstemmed | Abstract domains in constraint programming Marie Pelleau |
| title_short | Abstract domains in constraint programming |
| title_sort | abstract domains in constraint programming |
| topic | COMPUTERS / Programming / General bisacsh Constraint programming (Computer science) fast Constraint programming (Computer science) |
| topic_facet | COMPUTERS / Programming / General Constraint programming (Computer science) Konferenzschrift |
| url | http://www.sciencedirect.com/science/book/9781785480102 |
| work_keys_str_mv | AT pelleaumarie abstractdomainsinconstraintprogramming |