The Constraint logic programming paradigm; declarativity, efficiency, and flexibility

摘要

Real-world applications of theories for planning, scheduling, and design, call for more powerful and expressive theories than those provided by 'classical" methods, which are based o a number of simplifying assumptions. Basic research on theories of constraint solving has made marked progress over the past few years. This paper sets out to show that the declarative nature of this new paradigm has significant advantages in software, engineering terms in the programming and maintenance phases. Moreover, the high efficiency of these methods allows the simulation of different strategies and supplies near-optimal solutions within a short time However, complex problems require the application of heuristics. Research results in this area are presented.