Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Expressive Applications of Constraint Logic Programming

Expressive Applications of Constraint Logic Programming This introduction to the Constraint Logic Programming languageCLP(ℜ) uses applications to provide insight tothe language‘s strengths. An overview of CLP(ℜ)is followed by a discussion of three applications that illustratethe language‘s unifying treatment both of numeric and symboliccomputing and of engineering analysis and synthesis problems.Another discussion dissects the interpreter‘s constraint solverand clarifies how a problem’s search space can be restricteddeclaratively. The final example is an extended description ofthe construction of a network of interpreters, which can be usedto distributively solve a set of linear equations. This extensionrequires no modification of the CLP(ℜ) interpreterand points out the benefits of revisiting established algorithmsvis-a-vis CLP(ℜ). http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Artificial Intelligence Review Springer Journals

Expressive Applications of Constraint Logic Programming

Artificial Intelligence Review , Volume 11 (6) – Sep 19, 2004

Loading next page...
 
/lp/springer-journals/expressive-applications-of-constraint-logic-programming-0iCc0g2bZb

References (14)

Publisher
Springer Journals
Copyright
Copyright © 1997 by Kluwer Academic Publishers
Subject
Computer Science; Artificial Intelligence (incl. Robotics); Computer Science, general
ISSN
0269-2821
eISSN
1573-7462
DOI
10.1023/A:1017967318323
Publisher site
See Article on Publisher Site

Abstract

This introduction to the Constraint Logic Programming languageCLP(ℜ) uses applications to provide insight tothe language‘s strengths. An overview of CLP(ℜ)is followed by a discussion of three applications that illustratethe language‘s unifying treatment both of numeric and symboliccomputing and of engineering analysis and synthesis problems.Another discussion dissects the interpreter‘s constraint solverand clarifies how a problem’s search space can be restricteddeclaratively. The final example is an extended description ofthe construction of a network of interpreters, which can be usedto distributively solve a set of linear equations. This extensionrequires no modification of the CLP(ℜ) interpreterand points out the benefits of revisiting established algorithmsvis-a-vis CLP(ℜ).

Journal

Artificial Intelligence ReviewSpringer Journals

Published: Sep 19, 2004

There are no references for this article.