ENGLISH

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

By Gerhard Goos , Jean-Pierre Jouannaud , Juris Hartmanis , Jan van Leeuwen , Ralf Treinen (auth.) , Hubert Comon , Claude Marché , Ralf Treinen (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2001
ISBN
978-3-540-41950-1, 978-3-540-45406-9
DOI
10.1007/3-540-45406-3
Language
english
Format
PDF
Filesize
3 MB (2757639 bytes)
Series
Lecture Notes in Computer Science 2002
Edition
1
Pages
316\320
Orientation
yes
Scanned
yes
Time added
2013-08-01 04:00:00
Mathematical Logic and Formal Languages; Artificia

Description

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.

Similar books