Applications and Efficient Execution of Constraint Logic Programming Over a Real-Number Domain

9619523约束逻辑编程（英语：Constraint logic programming，CLP）是一种基于谓词演算的编程语言，增加了基于约束的问题表示的表达能力。该家族中的每种语言都由程序变量的值域来区分。Prolog是家族中最著名的语言，可以被看作是无限树领域中的CLP。本文主要研究实数域上的CLP（CLP（R））。CLP（R）的实现通常将约束限制为线性方程和不等式，并且由此产生的语言已经被证明对于各种调度、仓库位置、削减库存、期权交易和船员排班问题以及AI难题具有足够的表达力。然而，CLP（R）的有用性受到大多数问题所需的大搜索空间和约束满足算法的复杂性的限制。简而言之，由于许多有用的问题需要很长时间才能解决，因此并非总能从中电的表达能力中获益。本研究的目标是确定CLP（R）应用程序，如果执行速度可以加快，将是可行的，并找到方法来减少执行时间，通过一个更有效的约束满足算法。***

9619523 Constraint logic programming (CLP) is a family of programming languages built upon predicate calculus, with the added expressiveness of constraint-based problem representations. Each language in the family is distinguished by the domain of values for the program variables. Prolog is the best-known language in the family and can be viewed as CLP in the domain of infinite trees. This research focuses on CLP over a real-number domain (CLP(R)). Implementations of CLP(R) generally restrict constraints to linear equations and inequalities, and the resulting languages have proven expressive enough for a variety of scheduling, warehouse location, cutting stock, options trading, and crew rostering problems, as well as AI puzzles. However, CLP(R)'s usefulness is limited by the large search space required for most problems and by the complexity of the constraint satisfaction algorithm. Stated more simply, it is not always possible to benefit from CLP's expressiveness, since many useful problems take too long to solve. The goal of this research is to identify CLP(R) applications that would be feasible if execution could be sped up, and to find ways to cut down on execution time through a more efficient constraint satisfaction algorithm. ***