Applications of CHIP to industrial and engineering problems
IEA/AIE '88 Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 2
Concrete mathematics: a foundation for computer science
Concrete mathematics: a foundation for computer science
SIAM Journal on Computing
A dynamic algorithm for placing rectangles without overlapping
Journal of Information Processing
Artificial Intelligence - Special issue on knowledge representation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Extending chip in order to solve complex scheduling and placement problems
Mathematical and Computer Modelling: An International Journal
Computers and Operations Research
Local consistency for extended CSPs
Theoretical Computer Science
The conjunction of interval among constraints
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
An optimal arc consistency algorithm for a chain of atmost constraints with cardinality
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Explaining circuit propagation
Constraints
Hi-index | 0.98 |
The purpose of this paper is to show how the introduction of new primitive constraints (e.g., among, diffn, cycle) over finite domains in the constraint logic programming system CHIP result in finding very rapidly good solutions for a large class of difficult sequencing, scheduling, geometrical placement and vehicle routing problems. The among constraint allows us to specify sequencing constraints in a very concise way. For the first time, the diffn constraint allows us to express and to solve directly multi-dimensional placement problems, where one has to consider nonoverlapping constraints between n-dimensional objects (e.g., rectangles, parallelepipeds). The cycle constraint makes it possible to specify a wide range of graph partitioning problems that could not yet be expressed by using current constraint logic programming languages. One of the main advantages of all these new primitives is to take into account more globally a set of elementary constraints. Finally, we point out that all the previous primitive constraints enhance the power of the CHIP system significantly, allowing us to solve real life problems that were not within reach of constraint technology before.