Constraint Programming (1996)
BibTeX
@MISC{Group96constraintprogramming,
author = {The Constraint Programming Working Group},
title = {Constraint Programming},
year = {1996}
}
OpenURL
Abstract
Machine, which has proven extremely successful in the context of logic programming. The WAM approach essentially provides a view of the compilation of these languages as a generalization of the standard techniques used in conventional languages, allowing most of the conventional optimizations. Global Analysis. As a result of the compilation-based approach the performance of current systems is quite acceptable when running code where generalpurpose constraint solving is performed. On the other hand, this approach alone cannot always provide performance in the control component that is competitive with other languages. In particular, their performance often does not reach that of traditional logic programming systems in symbolic applications and is generally far from that of traditional imperative programming languages in (non constraint related) numerical applications. The most generally accepted solution to this has been to develop advanced compilation technology capable of detecting ...







