Constraints in computational logics : theory and applications : international summer school, CCL'99, Gif-sur-Yvette, France, September 5-8, 1999, revised lectures / Hubert Comon, Claude Marché, Ralf Treinen (eds.).

Contributor(s):

Material type: Text

text

Media type:

computer

Carrier type:

online resource

ISBN:

9783540454069
3540454063
9788354045403
8354045404

Subject(s): Additional physical formats: Print version:: Constraints in computational logics : theory and applications : international summer school, CCL'99, Gif-sur-Yvette, France, September 5-8, 1999, revised lecturesDDC classification:

005.1/1 21

LOC classification:

QA76.612 .C693 2001

Other classification:

31.10
SS 4800
DAT 706f
DAT 540f

Online resources:

Click here to access online

Contents:

1. Constraints and Constraint Solving: An Introduction / Jean-Pierre Jouannaud and Ralf Treinen. A First Approach to Constraint Based Calculi. A Case Study of a Constraint System: Feature Constraints. Programming with Incomplete Constraint Solvers. Committed Choice: A More Realistic Approach -- 2. Constraint Solving on Terms / Hubert Comon and Claude Kirchner. The Principle of Syntactic Methods. Unification Problems. Dis-Unification Problems. Ordering Constraints. Matching Constraints. Principles of Automata Based Constraint Solving. Presburger Arithmetic and Classical Word Automata. Typing Constraints and Tree Automata. Set Constraints and Tree Set Automata. Examples of Other Constraint Systems Using Tree Automata -- 3. Combining Constraint Solving / Franz Baader and Klaus U. Schulz. Classification of Constraint Systems and Combination Approaches. The Nelson-Oppen Combination Procedure. Combination of E-Unification Algorithms. The Logical and Algebraic Perspective.

In: Springer Nature eBookSummary: 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.

Holdings ( 1 )
Title notes ( 5 )

Holdings
Item type	Current library	Collection	Call number	Status	Date due	Barcode	Item holds
eBook	e-Library	eBook LNCS		Available

Total holds: 0

Lectures at the summer school organized by the ESPRIT CCL Working Group in Gif-sur-Yvette, France, September 1999.

Includes bibliographical references.

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.

English.