Constraints in Computational Logics: Theory and Applications International Summer School, CCL'99 Gif-sur-Yvette, France, September 5-8, 1999 Revised Lectures /

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 automa...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Comon, Hubert (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Marche, Claude (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Treinen, Ralf (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001.
Έκδοση:1st ed. 2001.
Σειρά:Lecture Notes in Computer Science, 2002
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
Πίνακας περιεχομένων:
  • 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.