Access the full text.
Sign up today, get DeepDyve free for 14 days.
J. Jaffar, Michael Maher (1994)
Constraint Logic Programming: A SurveyJ. Log. Program., 19/20
N. Heintze, S. Michaylov, Peter Stuckey (1992)
CLP(ℜ) and some electrical engineering problemsJournal of Automated Reasoning, 9
J. Jaffar, S. Michaylov, Peter Stuckey, R. Yap (1992)
The CLP( R ) language and systemACM Trans. Program. Lang. Syst., 14
(1993)
Planning Model Implementation in CLP
Pascal Hentenryck (1989)
Constraint satisfaction in logic programming
E. Chu, A. George (1987)
Gaussian elimination with partial pivoting and load balancing on a multiprocessorParallel Comput., 5
J. Jaffar, S. Michaylov (1987)
Methodology and Implementation of a CLP System
S. Lakmazaheri, W. Rasdorf (1989)
Constraint logic programming for the analysis and partial synthesis of truss structuresArtificial Intelligence for Engineering Design, Analysis and Manufacturing, 3
Jacques Cohen (1990)
Constraint logic programming languagesCommun. ACM, 33
V. Sunderam (1990)
PVM: A Framework for Parallel Distributed ComputingConcurr. Pract. Exp., 2
G. Fox (1988)
Solving Problems on Concurrent Processors
C. Lassez, K. McAloon, R. Yap (1987)
Constraint Logic Programming and Option TradingIEEE Expert, 2
E. Chu, A. George (1987)
Gaussian Elimination with Partial and Load Balancing on a MultiprocessorParallel Computing, 5
A.J. Burton (1972)
APPLIED NUMERICAL ANALYSISThe Mathematical Gazette, 56
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(ℜ).
Artificial Intelligence Review – Springer Journals
Published: Sep 19, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.