Solving a cutting-stock problem with the constraint logic programming language chip

Dincbas, Mehmet; Simonis, Helmut; Hentenryck, Pascal Van

doi:10.1016/0895-7177(92)90081-u

Cited by 96 publications

(131 citation statements)

References 7 publications

Supporting

Mentioning

128

Contrasting

Unclassified

Order By: Relevance

“…• cars: solve a car sequencing problem with 10 cars (Dincbas et al 1988). This benchmark deals with 100 Boolean variables (i.e., finite domain variables ranging over [0,1]), 10 finite domain variables ranging over [1,6], 6 atmost constraints, 50 element constraints, and 49 linear disequations.…”

Section: The Benchmarksmentioning

confidence: 99%

Constraint functional logic programming over finite domains

Fernández¹,

Hortalá-González²,

Sáenz-Pérez³

et al. 2007

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CF LP (FD) ) with a lazy functional logic programming language which seamlessly embodies finite domain (FD) constraints. This proposal increases the expressiveness and power of constraint logic programming over finite domains (CLP (FD) ) by combining functional and relational notation, curried expressions, higher-order functions, patterns, partial applications, non-determinism, lazy evaluation, logical variables, types, domain variables, constraint composition, and finite domain constraints.We describe the syntax of the language, its type discipline, and its declarative and operational semantics. We also describe T OY(FD), an implementation for CF LP (FD) , and a comparison of our approach with respect to CLP (FD) from a programming point of view, showing the new features we introduce. And, finally, we show a performance analysis which demonstrates that our implementation is competitive with respect to existing CLP (FD) systems and that clearly outperforms the closer approach to CF LP (FD) .

show abstract

Section: The Benchmarksmentioning

confidence: 99%

Constraint functional logic programming over finite domains

Fernández¹,

Hortalá-González²,

Sáenz-Pérez³

et al. 2007

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

show abstract

“…In particular, they assume a total ordering on the domain D for reasons that will become clear later. 5 The additional sophistication is necessary to achieve the bound O(ed) for monotonic constraints. The primitive operations on domains are assumed to take constant time.…”

Section: Representation Of Domainsmentioning

confidence: 99%

“…Some symbolic constraints are also provided to increase expressiveness and, in addition, users can define their own constraints. This computation domain is available in CHIP [5] and its constraint solver is based on consistency techniques, arithmetic reasoning, and branch and bound. It has been applied to numerous problems in combinatorial optimization such as graph coloring, warehouse location, scheduling and sequencing, cutting stock, assignment problems, and microcode labeling to name a few (see for instance [4,24]).…”

Section: Applicationmentioning

confidence: 99%

See 1 more Smart Citation

A generic arc-consistency algorithm and its specializations

Hentenryck

Deville

Teng

1992

Artificial Intelligence

289

135

View full text Add to dashboard Cite

“…This paper defines the model semantics of Starlog based on the stable model semantics [17]. Unlike other CLP languages such as [22,10,12,11,30,5,46], Starlog uses an explicit parameter for time. This can be thought of putting timestamps on truth values.…”

Section: Starlog Languagementioning

confidence: 99%