Constraints in Computational Logics: Theory and Applications
International Summer School, CCL'99 Gif-sur-Yvette, France, September 5-8, 1999 Revised Lectures
Seiten
2001
Springer Berlin (Verlag)
978-3-540-41950-1 (ISBN)
Springer Berlin (Verlag)
978-3-540-41950-1 (ISBN)
Constraints provide a declarative way of representing infinite sets of data. They are well suited for combining different logical or programming paradigms as has been known for constraint logic programming since the 1980s and more recently for functional programming. The use of constraints in automated deduction is more recent and has proved to be very successful, moving the control from the meta-level to the constraints, which are now first-class objects.
This monograph-like book presents six thoroughly reviewed and revised lectures given by leading researchers at the summer school organized by the ESPRIT CCL Working Group in Gif-sur-Yvette, France, in September 1999. The book offers coherently written chapters on constraints and constraint solving, constraint solving on terms, combining constraint solving, constraints and theorem proving, functional and constraint logic programming, and building industrial applications.
This monograph-like book presents six thoroughly reviewed and revised lectures given by leading researchers at the summer school organized by the ESPRIT CCL Working Group in Gif-sur-Yvette, France, in September 1999. The book offers coherently written chapters on constraints and constraint solving, constraint solving on terms, combining constraint solving, constraints and theorem proving, functional and constraint logic programming, and building industrial applications.
Constraints and Constraint Solving: An Introduction.- Constraint Solving on Terms.- Combining Constraint Solving.- Constraints and Theorem Proving.- Functional and Constraint Logic Programming.- Building Industrial Applications with Constraint Programming.
| Erscheint lt. Verlag | 18.4.2001 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science |
| Zusatzinfo | XII, 316 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 482 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
| Schlagworte | Automat • automated deduction • Computational Logics • Constraint Logic Programming • constraints • Constraint Solving • First-Order Logic • formale Sprachen • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Künstliche Intelligenz • Logic • Logic Programming • Logik • programming • proving • theorem proving |
| ISBN-10 | 3-540-41950-0 / 3540419500 |
| ISBN-13 | 978-3-540-41950-1 / 9783540419501 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Grundlagen – Anwendungen – Perspektiven
Buch | Softcover (2022)
Springer Vieweg (Verlag)
CHF 53,15
was jeder über Informatik wissen sollte
Buch (2024)
Springer Vieweg (Verlag)
CHF 53,15
Eine Einführung in die Systemtheorie
Buch | Softcover (2022)
UTB (Verlag)
CHF 34,95
