Improving search for job-shop scheduling with CLP(FD)

Breitinger, Silvia; Lock, Hendrik C. R.

doi:10.1007/3-540-58402-1_20

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

1995

2016

Publication Types

Select...

Book2

Article1

Other1

Relationship

Self Cite0

Independent4

Authors

Journals

Cited by 4 publications

(1 citation statement)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Of course, the declarative reading of X<#Y is disentailed. For an exact de nition what you can expect if you use nite domain constraints in guards you are referred to Section 4 4. In other CLP languages the assignment of values to variables is called labeling.December 7, 1994 DRAFT…”

mentioning

confidence: 99%

Constraint Programming in Oz

Maluszy¿ski¹

1997

Logic Programming

View full text Add to dashboard Cite

Oz is a concurrent language providing for functional, object-oriented, and constraint programming. This report gives a tutorial introduction to constraint programming in Oz. We discuss nite domain constraints and search. We show along many examples how constraints and search may be combined to solve constraint problems elegantly and e ciently. The report contains a full description of the nite domain module and the semantics of nite domain expressions.

show abstract

mentioning

confidence: 99%