Solving the Car-Sequencing Problem in Constraint Logic Programming

  title={Solving the Car-Sequencing Problem in Constraint Logic Programming},
  author={Mehmet Dincbas and Helmut Simonis and Pascal Van Hentenryck},
CHIP is a new constraint logic programming language combining the declarative aspect of logic programming with the efficiency of constraint manipulation techniques. In the present paper, we show an application of CHIP to the car-sequencing problem which occurs in assembly line scheduling in car manufacturing. This problem is highly combinatorial and has been presented recently as a "challenge" lor Artificial Intelligence (Al) systems. We present the approach taken to solve this problem in CHIP… CONTINUE READING
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS


Publications citing this paper.
Showing 1-10 of 112 extracted citations

Logic Programming

Lecture Notes in Computer Science • 2001
View 9 Excerpts
Highly Influenced

Chapter 11 Modelling

View 8 Excerpts
Highly Influenced

Constraint satisfaction problems: Algorithms and applications

European Journal of Operational Research • 1999
View 6 Excerpts
Highly Influenced


Publications referenced by this paper.
Showing 1-10 of 19 references

" CAR WARS : The ( Almost ) Binh of an Expert System "

B. D. Parrello
Al Expert • 1988

Extending Equation Solving and Constraint Handling in Logic Programming

M. Dincbas, H. Simonis, P. Van Hentenryck
Proceedings of Colloquium on the Resolution of Equations in Algebraic Structures ( CREAS ) • 1987

' lob - Shop Scheduling Using Automated Reasoning : A Case Study of the Car - Sequencing Problem "

8. D. Parrello, W. C. Kabat, L. Wos
Journalof Automated Reasoning • 1986

Constraints , Logic Programming and Deductive Databases

M. Dincbas

" lncreasing tree search efficiency for constraint satisfaction problems

R. M. Haralick, G. L. Elliot
Artificial intelligence • 1980

Similar Papers

Loading similar papers…