Constraint Satisfaction Problems: CSP Formalisms and Techniques
A Constraint Satisfaction Problem (CSP) consists of a set of variables, a domain of values for each variable and a set of constraints. The objective is to assign a value for each variable such that all constraints are satisfied. CSPs continue to receive increased attention because of both their high...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Somerset
John Wiley & Sons, Incorporated
2013
|
| Ausgabe: | 1st ed |
| Schriftenreihe: | FOCUS
|
| Schlagworte: | |
| Zusammenfassung: | A Constraint Satisfaction Problem (CSP) consists of a set of variables, a domain of values for each variable and a set of constraints. The objective is to assign a value for each variable such that all constraints are satisfied. CSPs continue to receive increased attention because of both their high complexity and their omnipresence in academic, industrial and even real-life problems. This is why they are the subject of intense research in both artificial intelligence and operations research. This book introduces the classic CSP and details several extensions/improvements of both formalisms and techniques in order to tackle a large variety of problems. Consistency, flexible, dynamic, distributed and learning aspects are discussed and illustrated using simple examples such as the n-queen problem. Contents 1. Foundations of CSP. 2. Consistency Reinforcement Techniques. 3. CSP Solving Algorithms. 4. Search Heuristics. 5. Learning Techniques. 6. Maximal Constraint Satisfaction Problems. 7. Constraint Satisfaction and Optimization Problems. 8. Distibuted Constraint Satisfaction Problems. About the Authors Khaled Ghedira is the general managing director of the Tunis Science City in Tunisia, Professor at the University of Tunis, as well as the founding president of the Tunisian Association of Artificial Intelligence and the founding director of the SOIE research laboratory. His research areas include MAS, CSP, transport and production logistics, metaheuristics and security in M/E-government. He has led several national and international research projects, supervised 30 PhD theses and more than 50 Master's theses, co-authored about 300 journal, conference and book research papers, written two text books on metaheuristics and production logistics and co-authored three others |
| Beschreibung: | Description based on publisher supplied metadata and other sources |
| Beschreibung: | 1 online resource (159 pages) |
| ISBN: | 9781118575017 9781848214606 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV044050035 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 170217s2013 |||| o||u| ||||||eng d | ||
| 020 | |a 9781118575017 |9 978-1-118-57501-7 | ||
| 020 | |a 9781848214606 |c Print |9 978-1-84821-460-6 | ||
| 035 | |a (ZDB-30-PAD)EBC1124005 | ||
| 035 | |a (ZDB-89-EBL)EBL1124005 | ||
| 035 | |a (ZDB-38-EBR)ebr10658422 | ||
| 035 | |a (OCoLC)828299042 | ||
| 035 | |a (DE-599)BVBBV044050035 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 082 | 0 | |a 006.3 | |
| 100 | 1 | |a Ghedira, Khaled |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Constraint Satisfaction Problems |b CSP Formalisms and Techniques |
| 250 | |a 1st ed | ||
| 264 | 1 | |a Somerset |b John Wiley & Sons, Incorporated |c 2013 | |
| 264 | 4 | |c © 2013 | |
| 300 | |a 1 online resource (159 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a FOCUS | |
| 500 | |a Description based on publisher supplied metadata and other sources | ||
| 520 | |a A Constraint Satisfaction Problem (CSP) consists of a set of variables, a domain of values for each variable and a set of constraints. The objective is to assign a value for each variable such that all constraints are satisfied. CSPs continue to receive increased attention because of both their high complexity and their omnipresence in academic, industrial and even real-life problems. This is why they are the subject of intense research in both artificial intelligence and operations research. This book introduces the classic CSP and details several extensions/improvements of both formalisms and techniques in order to tackle a large variety of problems. Consistency, flexible, dynamic, distributed and learning aspects are discussed and illustrated using simple examples such as the n-queen problem. Contents 1. Foundations of CSP. 2. Consistency Reinforcement Techniques. 3. CSP Solving Algorithms. 4. Search Heuristics. 5. Learning Techniques. 6. Maximal Constraint Satisfaction Problems. 7. Constraint Satisfaction and Optimization Problems. 8. Distibuted Constraint Satisfaction Problems. About the Authors Khaled Ghedira is the general managing director of the Tunis Science City in Tunisia, Professor at the University of Tunis, as well as the founding president of the Tunisian Association of Artificial Intelligence and the founding director of the SOIE research laboratory. His research areas include MAS, CSP, transport and production logistics, metaheuristics and security in M/E-government. He has led several national and international research projects, supervised 30 PhD theses and more than 50 Master's theses, co-authored about 300 journal, conference and book research papers, written two text books on metaheuristics and production logistics and co-authored three others | ||
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Constraint satisfaction problems | |
| 650 | 4 | |a Formalisms | |
| 650 | 4 | |a Mathematics | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |a Ghedira, Khaled |t Constraint Satisfaction Problems : CSP Formalisms and Techniques |
| 912 | |a ZDB-30-PAD |a ZDB-38-ESG | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029456880 | ||
Datensatz im Suchindex
| _version_ | 1804177067093262336 |
|---|---|
| any_adam_object | |
| author | Ghedira, Khaled |
| author_facet | Ghedira, Khaled |
| author_role | aut |
| author_sort | Ghedira, Khaled |
| author_variant | k g kg |
| building | Verbundindex |
| bvnumber | BV044050035 |
| collection | ZDB-30-PAD ZDB-38-ESG |
| ctrlnum | (ZDB-30-PAD)EBC1124005 (ZDB-89-EBL)EBL1124005 (ZDB-38-EBR)ebr10658422 (OCoLC)828299042 (DE-599)BVBBV044050035 |
| dewey-full | 006.3 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 006 - Special computer methods |
| dewey-raw | 006.3 |
| dewey-search | 006.3 |
| dewey-sort | 16.3 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| edition | 1st ed |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03225nmm a2200445zc 4500</leader><controlfield tag="001">BV044050035</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">170217s2013 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781118575017</subfield><subfield code="9">978-1-118-57501-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781848214606</subfield><subfield code="c">Print</subfield><subfield code="9">978-1-84821-460-6</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-30-PAD)EBC1124005</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-89-EBL)EBL1124005</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-38-EBR)ebr10658422</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)828299042</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV044050035</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">006.3</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ghedira, Khaled</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Constraint Satisfaction Problems</subfield><subfield code="b">CSP Formalisms and Techniques</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Somerset</subfield><subfield code="b">John Wiley & Sons, Incorporated</subfield><subfield code="c">2013</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 2013</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (159 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="490" ind1="0" ind2=" "><subfield code="a">FOCUS</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">A Constraint Satisfaction Problem (CSP) consists of a set of variables, a domain of values for each variable and a set of constraints. The objective is to assign a value for each variable such that all constraints are satisfied. CSPs continue to receive increased attention because of both their high complexity and their omnipresence in academic, industrial and even real-life problems. This is why they are the subject of intense research in both artificial intelligence and operations research. This book introduces the classic CSP and details several extensions/improvements of both formalisms and techniques in order to tackle a large variety of problems. Consistency, flexible, dynamic, distributed and learning aspects are discussed and illustrated using simple examples such as the n-queen problem. Contents 1. Foundations of CSP. 2. Consistency Reinforcement Techniques. 3. CSP Solving Algorithms. 4. Search Heuristics. 5. Learning Techniques. 6. Maximal Constraint Satisfaction Problems. 7. Constraint Satisfaction and Optimization Problems. 8. Distibuted Constraint Satisfaction Problems. About the Authors Khaled Ghedira is the general managing director of the Tunis Science City in Tunisia, Professor at the University of Tunis, as well as the founding president of the Tunisian Association of Artificial Intelligence and the founding director of the SOIE research laboratory. His research areas include MAS, CSP, transport and production logistics, metaheuristics and security in M/E-government. He has led several national and international research projects, supervised 30 PhD theses and more than 50 Master's theses, co-authored about 300 journal, conference and book research papers, written two text books on metaheuristics and production logistics and co-authored three others</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Constraint satisfaction problems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Formalisms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</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">Ghedira, Khaled</subfield><subfield code="t">Constraint Satisfaction Problems : CSP Formalisms and Techniques</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-PAD</subfield><subfield code="a">ZDB-38-ESG</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029456880</subfield></datafield></record></collection> |
| id | DE-604.BV044050035 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:42:11Z |
| institution | BVB |
| isbn | 9781118575017 9781848214606 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029456880 |
| oclc_num | 828299042 |
| open_access_boolean | |
| physical | 1 online resource (159 pages) |
| psigel | ZDB-30-PAD ZDB-38-ESG |
| publishDate | 2013 |
| publishDateSearch | 2013 |
| publishDateSort | 2013 |
| publisher | John Wiley & Sons, Incorporated |
| record_format | marc |
| series2 | FOCUS |
| spelling | Ghedira, Khaled Verfasser aut Constraint Satisfaction Problems CSP Formalisms and Techniques 1st ed Somerset John Wiley & Sons, Incorporated 2013 © 2013 1 online resource (159 pages) txt rdacontent c rdamedia cr rdacarrier FOCUS Description based on publisher supplied metadata and other sources A Constraint Satisfaction Problem (CSP) consists of a set of variables, a domain of values for each variable and a set of constraints. The objective is to assign a value for each variable such that all constraints are satisfied. CSPs continue to receive increased attention because of both their high complexity and their omnipresence in academic, industrial and even real-life problems. This is why they are the subject of intense research in both artificial intelligence and operations research. This book introduces the classic CSP and details several extensions/improvements of both formalisms and techniques in order to tackle a large variety of problems. Consistency, flexible, dynamic, distributed and learning aspects are discussed and illustrated using simple examples such as the n-queen problem. Contents 1. Foundations of CSP. 2. Consistency Reinforcement Techniques. 3. CSP Solving Algorithms. 4. Search Heuristics. 5. Learning Techniques. 6. Maximal Constraint Satisfaction Problems. 7. Constraint Satisfaction and Optimization Problems. 8. Distibuted Constraint Satisfaction Problems. About the Authors Khaled Ghedira is the general managing director of the Tunis Science City in Tunisia, Professor at the University of Tunis, as well as the founding president of the Tunisian Association of Artificial Intelligence and the founding director of the SOIE research laboratory. His research areas include MAS, CSP, transport and production logistics, metaheuristics and security in M/E-government. He has led several national and international research projects, supervised 30 PhD theses and more than 50 Master's theses, co-authored about 300 journal, conference and book research papers, written two text books on metaheuristics and production logistics and co-authored three others Mathematik Algorithms Constraint satisfaction problems Formalisms Mathematics Erscheint auch als Druck-Ausgabe Ghedira, Khaled Constraint Satisfaction Problems : CSP Formalisms and Techniques |
| spellingShingle | Ghedira, Khaled Constraint Satisfaction Problems CSP Formalisms and Techniques Mathematik Algorithms Constraint satisfaction problems Formalisms Mathematics |
| title | Constraint Satisfaction Problems CSP Formalisms and Techniques |
| title_auth | Constraint Satisfaction Problems CSP Formalisms and Techniques |
| title_exact_search | Constraint Satisfaction Problems CSP Formalisms and Techniques |
| title_full | Constraint Satisfaction Problems CSP Formalisms and Techniques |
| title_fullStr | Constraint Satisfaction Problems CSP Formalisms and Techniques |
| title_full_unstemmed | Constraint Satisfaction Problems CSP Formalisms and Techniques |
| title_short | Constraint Satisfaction Problems |
| title_sort | constraint satisfaction problems csp formalisms and techniques |
| title_sub | CSP Formalisms and Techniques |
| topic | Mathematik Algorithms Constraint satisfaction problems Formalisms Mathematics |
| topic_facet | Mathematik Algorithms Constraint satisfaction problems Formalisms Mathematics |
| work_keys_str_mv | AT ghedirakhaled constraintsatisfactionproblemscspformalismsandtechniques |