Constraints, a model of computation
<p>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...
Main Author: | |
---|---|
Other Authors: | |
Format: | Others |
Published: |
Virginia Tech
2014
|
Subjects: | |
Online Access: | http://hdl.handle.net/10919/45784 http://scholar.lib.vt.edu/theses/available/etd-11172012-040118/ |
Summary: | <p>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.</p> === Master of Science |
---|