Readings Newsletter
Become a Readings Member to make your shopping experience even easier.
Sign in or sign up for free!
You’re not far away from qualifying for FREE standard shipping within Australia
You’ve qualified for FREE standard shipping within Australia
The cart is loading…
This title is printed to order. This book may have been self-published. If so, we cannot guarantee the quality of the content. In the main most books will have gone through the editing process however some may not. We therefore suggest that you be aware of this before ordering this book. If in doubt check either the author or publisher’s details as we are unable to accept any returns unless they are faulty. Please contact us if you have any questions.
First, I would like to thank my principal supervisor Dr Qiang Shen for all his help, advice and friendship throughout. Many thanks also to my second supervisor Dr Peter Jarvis for his enthusiasm, help and friendship. I would also like to thank the other members of the Approximate and Qualitative Reasoning group at Edinburgh who have also helped and inspired me. This project has been funded by an EPSRC studentship, award num ber 97305803. I would like, therefore, to extend my gratitude to EPSRC for supporting this work. Many thanks to the staff at Edinburgh University for all their help and support and for promptly fixing any technical problems that I have had . My whole family have been both encouraging and supportive throughout the completion of this book, for which I am forever indebted. York, April 2003 Ian Miguel Contents List of Figures XV 1 Introduction… … … … … … … … … … … … … … … . 1 1. 1 Solving Classical CSPs … … … … … … … … … … … . 2 1. 2 Applicat ions of Classical CSP … … … … … … … … … . 3 1. 3 Limitations of Classical CSP … … … … … … … … … . . 6 1. 3. 1 Flexible CSP 6 1. 3. 2 Dynamic CSP … … … … … … … … … … … … 7 1. 4 Dynamic Flexible CSP … … … … … … … … … … … . 7 1. 5 Flexible Planning: a DFCSP Application … … … … … … 8 1. 6 Structure … … … … … … … … … … … … … … … . 9 1. 7 Contributions and their Significance 11 2 The Constraint Satisfaction Problem 13 2. 1 Constraints and Constraint Graphs … … … … … … … . . 13 2. 2 Tree Search Solution Techniques for Classical CSP … … … . 16 2. 2. 1 Backtrack … … … … … … … … … … … … … 17 2. 2. 2 Backjumping … … … … … … … … … … … … 18 2. 2. 3 Conflict-Directed Backjumping … … … … … … … 19 2. 2. 4 Backmarking … … … … … … … … … … … …
$9.00 standard shipping within Australia
FREE standard shipping within Australia for orders over $100.00
Express & International shipping calculated at checkout
This title is printed to order. This book may have been self-published. If so, we cannot guarantee the quality of the content. In the main most books will have gone through the editing process however some may not. We therefore suggest that you be aware of this before ordering this book. If in doubt check either the author or publisher’s details as we are unable to accept any returns unless they are faulty. Please contact us if you have any questions.
First, I would like to thank my principal supervisor Dr Qiang Shen for all his help, advice and friendship throughout. Many thanks also to my second supervisor Dr Peter Jarvis for his enthusiasm, help and friendship. I would also like to thank the other members of the Approximate and Qualitative Reasoning group at Edinburgh who have also helped and inspired me. This project has been funded by an EPSRC studentship, award num ber 97305803. I would like, therefore, to extend my gratitude to EPSRC for supporting this work. Many thanks to the staff at Edinburgh University for all their help and support and for promptly fixing any technical problems that I have had . My whole family have been both encouraging and supportive throughout the completion of this book, for which I am forever indebted. York, April 2003 Ian Miguel Contents List of Figures XV 1 Introduction… … … … … … … … … … … … … … … . 1 1. 1 Solving Classical CSPs … … … … … … … … … … … . 2 1. 2 Applicat ions of Classical CSP … … … … … … … … … . 3 1. 3 Limitations of Classical CSP … … … … … … … … … . . 6 1. 3. 1 Flexible CSP 6 1. 3. 2 Dynamic CSP … … … … … … … … … … … … 7 1. 4 Dynamic Flexible CSP … … … … … … … … … … … . 7 1. 5 Flexible Planning: a DFCSP Application … … … … … … 8 1. 6 Structure … … … … … … … … … … … … … … … . 9 1. 7 Contributions and their Significance 11 2 The Constraint Satisfaction Problem 13 2. 1 Constraints and Constraint Graphs … … … … … … … . . 13 2. 2 Tree Search Solution Techniques for Classical CSP … … … . 16 2. 2. 1 Backtrack … … … … … … … … … … … … … 17 2. 2. 2 Backjumping … … … … … … … … … … … … 18 2. 2. 3 Conflict-Directed Backjumping … … … … … … … 19 2. 2. 4 Backmarking … … … … … … … … … … … …