Logic-Based 0–1 Constraint Programming:
A logic view of 0-1 integer programming problems, providing new insights into the structure of problems that can lead the researcher to more effective solution techniques depending on the problem class. Operations research techniques are integrated into a logic programming environment. The first mon...
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
New York, NY
Springer US
1996
|
| Edition: | 1st ed. 1996 |
| Series: | Operations Research/Computer Science Interfaces Series
5 |
| Subjects: | |
| Online Access: | BTU01 Volltext |
| Summary: | A logic view of 0-1 integer programming problems, providing new insights into the structure of problems that can lead the researcher to more effective solution techniques depending on the problem class. Operations research techniques are integrated into a logic programming environment. The first monographic treatment that begins to unify these two methodological approaches. Logic-based methods for modelling and solving combinatorial problems have recently started to play a significant role in both theory and practice. The application of logic to combinatorial problems has a dual aspect. On one hand, constraint logic programming allows one to declaratively model combinatorial problems over an appropriate constraint domain, the problems then being solved by a corresponding constraint solver. Besides being a high-level declarative interface to the constraint solver, the logic programming language allows one also to implement those subproblems that cannot be naturally expressed with constraints. On the other hand, logic-based methods can be used as a constraint solving technique within a constraint solver for combinatorial problems modelled as 0-1 integer programs |
| Physical Description: | 1 Online-Ressource (XIV, 254 p) |
| ISBN: | 9781461313151 |
| DOI: | 10.1007/978-1-4613-1315-1 |
Staff View
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV046873148 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 200828s1996 |||| o||u| ||||||eng d | ||
| 020 | |a 9781461313151 |9 978-1-4613-1315-1 | ||
| 024 | 7 | |a 10.1007/978-1-4613-1315-1 |2 doi | |
| 035 | |a (ZDB-2-SBE)978-1-4613-1315-1 | ||
| 035 | |a (OCoLC)903189266 | ||
| 035 | |a (DE-599)BVBBV046873148 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-634 | ||
| 082 | 0 | |a 658.40301 |2 23 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 100 | 1 | |a Barth, Peter |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Logic-Based 0–1 Constraint Programming |c by Peter Barth |
| 250 | |a 1st ed. 1996 | ||
| 264 | 1 | |a New York, NY |b Springer US |c 1996 | |
| 300 | |a 1 Online-Ressource (XIV, 254 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Operations Research/Computer Science Interfaces Series |v 5 | |
| 520 | |a A logic view of 0-1 integer programming problems, providing new insights into the structure of problems that can lead the researcher to more effective solution techniques depending on the problem class. Operations research techniques are integrated into a logic programming environment. The first monographic treatment that begins to unify these two methodological approaches. Logic-based methods for modelling and solving combinatorial problems have recently started to play a significant role in both theory and practice. The application of logic to combinatorial problems has a dual aspect. On one hand, constraint logic programming allows one to declaratively model combinatorial problems over an appropriate constraint domain, the problems then being solved by a corresponding constraint solver. Besides being a high-level declarative interface to the constraint solver, the logic programming language allows one also to implement those subproblems that cannot be naturally expressed with constraints. On the other hand, logic-based methods can be used as a constraint solving technique within a constraint solver for combinatorial problems modelled as 0-1 integer programs | ||
| 650 | 4 | |a Operations Research/Decision Theory | |
| 650 | 4 | |a Artificial Intelligence | |
| 650 | 4 | |a Optimization | |
| 650 | 4 | |a Operations research | |
| 650 | 4 | |a Decision making | |
| 650 | 4 | |a Artificial intelligence | |
| 650 | 4 | |a Mathematical optimization | |
| 650 | 0 | 7 | |a Constraint-logische Programmierung |0 (DE-588)4382849-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Pseudo-Boolesche Optimierung |0 (DE-588)4176124-8 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Pseudo-Boolesche Optimierung |0 (DE-588)4176124-8 |D s |
| 689 | 0 | 1 | |a Constraint-logische Programmierung |0 (DE-588)4382849-8 |D s |
| 689 | 0 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781461285649 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780792396635 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781461313168 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4613-1315-1 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-2-SBE |a ZDB-2-BAE | ||
| 940 | 1 | |q ZDB-2-SBE_Archiv | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032283280 | ||
| 966 | e | |u https://doi.org/10.1007/978-1-4613-1315-1 |l BTU01 |p ZDB-2-SBE |q ZDB-2-SBE_Archiv |x Verlag |3 Volltext | |
Record in the Search Index
| _version_ | 1804181722945814528 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Barth, Peter |
| author_facet | Barth, Peter |
| author_role | aut |
| author_sort | Barth, Peter |
| author_variant | p b pb |
| building | Verbundindex |
| bvnumber | BV046873148 |
| classification_rvk | SK 890 |
| collection | ZDB-2-SBE ZDB-2-BAE |
| ctrlnum | (ZDB-2-SBE)978-1-4613-1315-1 (OCoLC)903189266 (DE-599)BVBBV046873148 |
| dewey-full | 658.40301 |
| dewey-hundreds | 600 - Technology (Applied sciences) |
| dewey-ones | 658 - General management |
| dewey-raw | 658.40301 |
| dewey-search | 658.40301 |
| dewey-sort | 3658.40301 |
| dewey-tens | 650 - Management and auxiliary services |
| discipline | Mathematik Wirtschaftswissenschaften |
| discipline_str_mv | Mathematik Wirtschaftswissenschaften |
| doi_str_mv | 10.1007/978-1-4613-1315-1 |
| edition | 1st ed. 1996 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03346nmm a2200577zcb4500</leader><controlfield tag="001">BV046873148</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">200828s1996 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461313151</subfield><subfield code="9">978-1-4613-1315-1</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4613-1315-1</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SBE)978-1-4613-1315-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)903189266</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV046873148</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">658.40301</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Barth, Peter</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Logic-Based 0–1 Constraint Programming</subfield><subfield code="c">by Peter Barth</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 1996</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York, NY</subfield><subfield code="b">Springer US</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XIV, 254 p)</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="490" ind1="0" ind2=" "><subfield code="a">Operations Research/Computer Science Interfaces Series</subfield><subfield code="v">5</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">A logic view of 0-1 integer programming problems, providing new insights into the structure of problems that can lead the researcher to more effective solution techniques depending on the problem class. Operations research techniques are integrated into a logic programming environment. The first monographic treatment that begins to unify these two methodological approaches. Logic-based methods for modelling and solving combinatorial problems have recently started to play a significant role in both theory and practice. The application of logic to combinatorial problems has a dual aspect. On one hand, constraint logic programming allows one to declaratively model combinatorial problems over an appropriate constraint domain, the problems then being solved by a corresponding constraint solver. Besides being a high-level declarative interface to the constraint solver, the logic programming language allows one also to implement those subproblems that cannot be naturally expressed with constraints. On the other hand, logic-based methods can be used as a constraint solving technique within a constraint solver for combinatorial problems modelled as 0-1 integer programs</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operations Research/Decision Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial Intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operations research</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Decision making</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Constraint-logische Programmierung</subfield><subfield code="0">(DE-588)4382849-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Pseudo-Boolesche Optimierung</subfield><subfield code="0">(DE-588)4176124-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Pseudo-Boolesche Optimierung</subfield><subfield code="0">(DE-588)4176124-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Constraint-logische Programmierung</subfield><subfield code="0">(DE-588)4382849-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</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">9781461285649</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">9780792396635</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">9781461313168</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4613-1315-1</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-2-SBE</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SBE_Archiv</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032283280</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-4613-1315-1</subfield><subfield code="l">BTU01</subfield><subfield code="p">ZDB-2-SBE</subfield><subfield code="q">ZDB-2-SBE_Archiv</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV046873148 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T15:15:38Z |
| indexdate | 2024-07-10T08:56:11Z |
| institution | BVB |
| isbn | 9781461313151 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032283280 |
| oclc_num | 903189266 |
| open_access_boolean | |
| owner | DE-634 |
| owner_facet | DE-634 |
| physical | 1 Online-Ressource (XIV, 254 p) |
| psigel | ZDB-2-SBE ZDB-2-BAE ZDB-2-SBE_Archiv ZDB-2-SBE ZDB-2-SBE_Archiv |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| publisher | Springer US |
| record_format | marc |
| series2 | Operations Research/Computer Science Interfaces Series |
| spelling | Barth, Peter Verfasser aut Logic-Based 0–1 Constraint Programming by Peter Barth 1st ed. 1996 New York, NY Springer US 1996 1 Online-Ressource (XIV, 254 p) txt rdacontent c rdamedia cr rdacarrier Operations Research/Computer Science Interfaces Series 5 A logic view of 0-1 integer programming problems, providing new insights into the structure of problems that can lead the researcher to more effective solution techniques depending on the problem class. Operations research techniques are integrated into a logic programming environment. The first monographic treatment that begins to unify these two methodological approaches. Logic-based methods for modelling and solving combinatorial problems have recently started to play a significant role in both theory and practice. The application of logic to combinatorial problems has a dual aspect. On one hand, constraint logic programming allows one to declaratively model combinatorial problems over an appropriate constraint domain, the problems then being solved by a corresponding constraint solver. Besides being a high-level declarative interface to the constraint solver, the logic programming language allows one also to implement those subproblems that cannot be naturally expressed with constraints. On the other hand, logic-based methods can be used as a constraint solving technique within a constraint solver for combinatorial problems modelled as 0-1 integer programs Operations Research/Decision Theory Artificial Intelligence Optimization Operations research Decision making Artificial intelligence Mathematical optimization Constraint-logische Programmierung (DE-588)4382849-8 gnd rswk-swf Pseudo-Boolesche Optimierung (DE-588)4176124-8 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Pseudo-Boolesche Optimierung (DE-588)4176124-8 s Constraint-logische Programmierung (DE-588)4382849-8 s DE-604 Erscheint auch als Druck-Ausgabe 9781461285649 Erscheint auch als Druck-Ausgabe 9780792396635 Erscheint auch als Druck-Ausgabe 9781461313168 https://doi.org/10.1007/978-1-4613-1315-1 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Barth, Peter Logic-Based 0–1 Constraint Programming Operations Research/Decision Theory Artificial Intelligence Optimization Operations research Decision making Artificial intelligence Mathematical optimization Constraint-logische Programmierung (DE-588)4382849-8 gnd Pseudo-Boolesche Optimierung (DE-588)4176124-8 gnd |
| subject_GND | (DE-588)4382849-8 (DE-588)4176124-8 (DE-588)4113937-9 |
| title | Logic-Based 0–1 Constraint Programming |
| title_auth | Logic-Based 0–1 Constraint Programming |
| title_exact_search | Logic-Based 0–1 Constraint Programming |
| title_exact_search_txtP | Logic-Based 0–1 Constraint Programming |
| title_full | Logic-Based 0–1 Constraint Programming by Peter Barth |
| title_fullStr | Logic-Based 0–1 Constraint Programming by Peter Barth |
| title_full_unstemmed | Logic-Based 0–1 Constraint Programming by Peter Barth |
| title_short | Logic-Based 0–1 Constraint Programming |
| title_sort | logic based 0 1 constraint programming |
| topic | Operations Research/Decision Theory Artificial Intelligence Optimization Operations research Decision making Artificial intelligence Mathematical optimization Constraint-logische Programmierung (DE-588)4382849-8 gnd Pseudo-Boolesche Optimierung (DE-588)4176124-8 gnd |
| topic_facet | Operations Research/Decision Theory Artificial Intelligence Optimization Operations research Decision making Artificial intelligence Mathematical optimization Constraint-logische Programmierung Pseudo-Boolesche Optimierung Hochschulschrift |
| url | https://doi.org/10.1007/978-1-4613-1315-1 |
| work_keys_str_mv | AT barthpeter logicbased01constraintprogramming |