|
Edinburgh Research Archive >
Informatics, School of >
Informatics thesis and dissertation collection >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1842/326
|
| Title: | Dynamic Flexible Constraint Satisfaction and it's Application to AI Planning |
| Authors: | Miguel, Ian |
| Supervisor(s): | Shen, Qiang |
| Issue Date: | Jul-2001 |
| Publisher: | University of Edinburgh. College of Science and Engineering. School of Informatics. |
| Abstract: | Constraints are a natural means of knowledage representation in many disparate fields. A constraint often takes the form of an equation or inequality, but in the most abstract senseis simply a logical relation among several variables expressing a set of admissable value combinations. The following are simple examples: the sum of two variables must equal 30; no two adjacent countries on the map may be coloured the same. It is this generality and simplicity of structure which underly the ubiquity of the constraint-based representation in Atificial Intelligence. |
| Description: | Centre for Intelligent Systems and their Applications
studentship 97305803 |
| Sponsor(s): | Engineering and Physical Sciences Research Council (EPSRC) |
| URI: | http://hdl.handle.net/1842/326 |
| Appears in Collections: | Informatics thesis and dissertation collection
|
Items in ERA are protected by copyright, with all rights reserved, unless otherwise indicated.
|
