
Constraint Programming: Basics and Trends
1994 Chatillon Spring School, Chatillon-sur-Seine, France, May 16 - 20, 1994. Selected Papers
Andreas Podelski(Editor)
Springer (Publisher)
Published on 20. March 1995
Book
Paperback/Softback
XIII, 323 pages
978-3-540-59155-9 (ISBN)
Description
This book contains thoroughly revised versions of the papers presented at the 1994 Châtillon Spring School held in May 1994. This spring school was the 22nd event in a series of advanced seminars presenting important new areas of research to the theoretical computer science community.
The interdisciplinary area of constraint (logic) programming and constraint-based systems has recently developed a discernible identity, which is promising both in terms of simple and general foundations and in terms of significant practical applications. The 15 papers presented in this volume make the new area accessible to all interested computer scientists and report the state of the art in this exciting new field, particularly in the subfield of constraint logic programming.
The interdisciplinary area of constraint (logic) programming and constraint-based systems has recently developed a discernible identity, which is promising both in terms of simple and general foundations and in terms of significant practical applications. The 15 papers presented in this volume make the new area accessible to all interested computer scientists and report the state of the art in this exciting new field, particularly in the subfield of constraint logic programming.
More details
Series
Edition
1995 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
XIII, 323 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 19 mm
Weight
511 gr
ISBN-13
978-3-540-59155-9 (9783540591559)
DOI
10.1007/3-540-59155-9
Schweitzer Classification
Content
Interval constraint logic programming.- Solving pseudo-Boolean constraints.- Enhancing the constraint-solving power of clp(FD) by means of path-consistency methods.- Constraints in term algebras an overview of constraint solving techniques.- Constructive negation by pruning and optimization higher-order predicates for CLP and CC languages.- Constraint handling rules.- Linear constraint solving in CLP-Languages.- On the use of constraints in automated deduction.- Abstract interpretation and finite domain symbolic constraints.- Concurrency and Concurrent Constraint Programming.- Toupie: A constraint language for model checking.- Imagining CLP(?,???).- An architecture for cooperating constraint solvers on reals.- The definition of Kernel Oz.- Design, implementation, and evaluation of the constraint language cc(FD).