Loading...
Please wait, while we are loading the content...
Similar Documents
Effectiveness of Optimizing Compilation for CLP(R) (1996)
| Content Provider | CiteSeerX |
|---|---|
| Author | Kelly, Andrew D. Macdonald, Andrew Marriott, Kim Stuckey, Peter J. Yap, Roland H. C. |
| Description | Constraint Logic Programming (CLP) languages extend logic programming by allowing constraints from different domains such as real numbers or Boolean functions. They have proved to be ideal for expressing problems that require interactive mathematical modelling and complex combinatorial optimization problems. However, CLP languages have mainly been considered as research systems, useful for rapid prototyping, but not really competitive with more conventional programming languages when performance is crucial. One promising approach to improving the performance of CLP systems is the use of powerful program optimizations to reduce the cost of constraint solving. We extend work in this area by describing a new optimizing compiler for the CLP language CLP(R). The compiler implements six powerful optimizations: reordering of constraints, bypass of the constraint solver, splitting and dead code elimination, removal of redundant constraints, removal of redundant variables, and specialization of... In Proceedings of the Joint International Conference and Symposium on Logic Programming |
| File Format | |
| Language | English |
| Publisher | MIT Press |
| Publisher Date | 1996-01-01 |
| Access Restriction | Open |
| Subject Keyword | Different Domain Research System Redundant Constraint Conventional Programming Language Redundant Variable Powerful Optimization Compiler Implement Powerful Program Optimization Boolean Function Real Number Clp Language Logic Programming Clp System Constraint Logic Programming Rapid Prototyping Optimizing Compilation Constraint Solver Interactive Mathematical Modelling Clp Language Clp Dead Code Elimination Complex Combinatorial Optimization Problem |
| Content Type | Text |
| Resource Type | Article |