The use of constraints had its scientific and commercial breakthrough in the 1990s. Programming with constraints makes it possible to model and specify problems with uncertain, incomplete information and to solve combi natorial problems, as they are abundant in industry and commerce, such as scheduling, planning, transportation, resource allocation, layout, design, and analysis. This book is a short, concise, and complete presentation of constraint programming and reasoning, covering theoretical foundations, algorithms, implementations, examples, and applications. It is based on more than a decade of experience in teaching and research about this subject. This book is intended primarily for graduate students, researchers, and practitioners in diverse areas of computer science and related fields, including programming languages, computational logic, symbolic computation, and ar tificial intelligence. The book is complemented by a web-page with teaching material, software, links, and more. We take the reader on a step-by-step journey through the world of constraint-based programming and constraint reasoning. Feel free to join in . . . Acknowledgements Thorn thanks his wife Andrea and his daughter Anna - for everything. He dedicates his contribution to the book to the memory of his mother, Grete. Slim thanks his wife N abila and his daughters Shirine and Amira for their ongoing support and patience.
Inhaltsverzeichnis
1. Introduction. - I. Constraint Programming. - 2. Algorithm = Logic + Control. - 3. Preliminaries of Syntax and Semantics. - 4. Logic Programming. - 5. Constraint Logic Programming. - 6. Concurrent Constraint Logic Programming. - 7. Constraint Handling Rules. - II. Constraint Systems. - 8. Constraint Systems and Constraint Solvers. - 9. Boolean Algebra B. - 10. Rational Trees RT. - 11. Linear Polynomial Equations R. - 12. Finite Domains FD. - 13. Non-linear Equations I. - III. Applications. - 14. Market Overview. - 15. Optimal Sender Placement for Wireless Communication. - 16. The Munich Rent Advisor. - 17. University Course Timetabling. - IV. Appendix. - A. Foundations from Logic. - A. 1 First-Order Logic: Syntax and Semantics. - A. 2 Basic Calculi and Normal Forms. - A. 2. 1 Substitutions. - A. 2. 2 Negation Normal Form and Prenex Form. - A. 2. 3 Skolemization. - A. 2. 4 Clauses. - A. 2. 5 Resolution. - List of Figures. - References.
