Constraint logic programming
Constraint logic programming
复制标题
约束逻辑编程
DOI：
10.1017/s0269888900005798
复制
发表时间：
1991
期刊：
影响因子：
--
通讯作者：
Pascal Van Hentenryck
中科院分区：
文献类型：
--
作者：
Pascal Van Hentenryck
摘要约束逻辑程序设计（CLP）是逻辑程序设计（LP）的一种推广，其中LP语言的基本操作统一被约束系统中的约束处理所取代。由此产生的语言联合收割机结合LP（声明语义，非确定性，关系形式）的优势与约束求解算法的效率。对于某些类别的组合搜索问题，它们大大缩短了开发时间，同时保留了命令式语言的大部分效率。本文调查这类新的编程语言从他们的基本理论，他们的约束系统，并将其应用到组合问题。
Abstract Constraint logic programming (CLP) is a generalization of logic programming (LP) where unification, the basic operation of LP languages, is replaced by constraint handling in a constraint system. The resulting languages combine the advantages of LP (declarative semantics, nondeterminism, relational form) with the efficiency of constraint-solving algorithms. For some classes of combinatorial search problems, they shorten the development time significantly while preserving most of the efficiency of imperative languages. This paper surveys this new class of programming languages from their underlying theory, to their constraint systems, and to their applications to combinatorial problems.