an:04187091
Zbl 0719.68013
Dincbas, Mehmet; Simonis, Helmut; van Hentenryck, Pascal
Solving large combinatorial problems in logic programming
EN
J. Logic Program. 8, No. 1-2, 75-93 (1990).
00226930
1990
j
68N17 68R05 68T27 68R10 90C27
logic programming; scheduling
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.
T.M.Liebling (Lausanne)