Title page for ETD etd-11172012-040118
|Type of Document
||Mantha, Suryanarayana M.
||Constraints, a model of computation
||Master of Science
||Computer Science and Applications
|Roach, John W.
|Bixler, J. Patrick
|Lee, John A. N.
|Date of Defense
In this thesis constraint solving/satisfaction is presented as a model of computation.
Advantages of using constraints as a paradigm of programming are presented. A semantic schema for constraint based computations is given, following a brief
survey of the more important systems based on constraints. These systems range
from particular algorithms to problem solvers to constraint based general purpose
programming languages. Finally, constraint satisfaction is applied to logic programming
and theorem proving. It is shown that incorporating constraint solving
in definite clause programs enhances their expressive power. Also, an alternative
semantics - based on constraint satisfaction - is given for theorem proving.
|| Approximate Download Time
| 28.8 Modem
|| 56K Modem
|| ISDN (64 Kb)
|| ISDN (128 Kb)
|| Higher-speed Access
next to an author's name indicates that all
files or directories associated with their ETD
are accessible from the Virginia Tech campus network only.
If you have questions or technical
problems, please Contact DLA.