Name
Abstract | ||
|---|---|---|
Constraint logic programming (CLP) is a relatively new programming paradigm. During its to years of existence, the theory of CLP has been increasingly understood and the two different approaches, domain technology and incremental linear solving, have been implemented in various CLP systems. Meanwhile, the commercial attractivity of CLP has been growing. Since 1989, a couple of commercial CLP systems appeared on the software market and have been successfully used in many real-life applications. The power of CLP stems from its ability to solve hard combinatorial problems such as planning, scheduling, resource allocation, and many others. How CLP originated from two declarative paradigms (constraint solving and logic programming) is informally explained, and the relationship between the different approaches in CLP is presented. The main part of the article presents a real-life scheduling application for the largest Slovak metallurgy company using the CLP system ECL(i)PS(e). |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1080/088395197118343 | APPLIED ARTIFICIAL INTELLIGENCE |
Keywords | Field | DocType |
programming paradigm | Scheduling resource allocation,Programming paradigm,Scheduling (computing),Computer science,Theoretical computer science,Software,Constraint logic programming,AND gate | Journal |
Volume | Issue | ISSN |
11 | 1 | 0883-9514 |
Citations | PageRank | References |
2 | 0.41 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Julius Csontó | 1 | 2 | 1.09 |
| Jan Paralic | 2 | 56 | 13.96 |