SOLVING LARGE COMBINATORIAL PROBLEMS IN LOGIC PROGRAMMING

被引：58

作者：

DINCBAS, M ^{[1
]}

SIMONIS, H ^{[1
]}

VANHENTENRYCK, P ^{[1
]}

机构：

[1] EUROPEAN COMP RES CTR,W-8000 MUNICH 81,GERMANY

来源：

JOURNAL OF LOGIC PROGRAMMING | 1990年 / 8卷 / 1-2期

关键词：

D O I：

10.1016/0743-1066(90)90052-7

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Many problems in operations research and hardware design are combinatorial problems which can be seen as search problems with constraints. We present an application of CHIP (Constraint Handling In Prolog) to large problems in disjunctive scheduling, graph coloring, and firmware design. chip is a constraint logic-programming language combining the declarative aspects of PROLOG with the efficiency of constraint-solving techniques. It is shown that it allows a natural expression of problems to be executed as efficiently as special-purpose programs written in procedural languages. © 1990.

引用

页码：75 / 93

页数：19