.png){kind=icon}
返回
CONSTRAINT SATISFACTION USING CONSTRAINT LOGIC PROGRAMMING
.png){kind=icon}
OA
AI
DOI：10.1016/0004-3702(92)90006-J.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Constraint logic programming (CLP) is a new class of declarative programming languages whose primitive operations are based on constraints (e.g. constraint solving and constraint entailment). CLP languages naturally combine constraint propagation with nondeterministic choices. As a consequence, they are particularly appropriate for solving a variety of combinatorial search problems, using the global search paradigm, with short development time and efficiency comparable to procedural tools based on the same approach. In this paper, we describe how the CLP language cc(FD), a successor of CHIP using consistency techniques over finite domains, can be used to solve two practical applications: test-pattern generation and car sequencing. For both applications, we present the cc(FD) program, describe how constraint solving is performed, report experimental results, and compare the approach with existing tools.
Keyword:
IMPLICIT ENUMERATION ALGORITHM
COMBINATORIAL PROBLEMS
TEST-GENERATION
SIMULATION
LANGUAGE
CONSISTENCY
CIRCUITS
NETWORKS
PROLOG
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.9
论文数:
6.1K
被引数:
1.9W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容