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/ |
id |
ndltd-VTETD-oai-vtechworks.lib.vt.edu-10919-45784 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-VTETD-oai-vtechworks.lib.vt.edu-10919-457842021-05-05T05:40:42Z Constraints, a model of computation Mantha, Suryanarayana M. Computer Science and Applications Roach, John W. Lee, John A. N. Bixler, J. Patrick LD5655.V855 1987.M355 Computer software Constraints (Physics) <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 2014-03-14T21:49:54Z 2014-03-14T21:49:54Z 1987-07-05 2012-11-17 2012-11-17 2012-11-17 Thesis Text etd-11172012-040118 http://hdl.handle.net/10919/45784 http://scholar.lib.vt.edu/theses/available/etd-11172012-040118/ OCLC# 17287306 LD5655.V855_1987.M355.pdf v, 34 leaves BTD application/pdf application/pdf Virginia Tech |
collection |
NDLTD |
format |
Others
|
sources |
NDLTD |
topic |
LD5655.V855 1987.M355 Computer software Constraints (Physics) |
spellingShingle |
LD5655.V855 1987.M355 Computer software Constraints (Physics) Mantha, Suryanarayana M. Constraints, a model of computation |
description |
<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 |
author2 |
Computer Science and Applications |
author_facet |
Computer Science and Applications Mantha, Suryanarayana M. |
author |
Mantha, Suryanarayana M. |
author_sort |
Mantha, Suryanarayana M. |
title |
Constraints, a model of computation |
title_short |
Constraints, a model of computation |
title_full |
Constraints, a model of computation |
title_fullStr |
Constraints, a model of computation |
title_full_unstemmed |
Constraints, a model of computation |
title_sort |
constraints, a model of computation |
publisher |
Virginia Tech |
publishDate |
2014 |
url |
http://hdl.handle.net/10919/45784 http://scholar.lib.vt.edu/theses/available/etd-11172012-040118/ |
work_keys_str_mv |
AT manthasuryanarayanam constraintsamodelofcomputation |
_version_ |
1719402767787753472 |