Constraint processing : selected papers. Manfred Meyer (ed.) / Lecture notes in computer science ; Vol. 923

Meyer, Manfred

ISBN 10: 3540594795 / ISBN 13: 9783540594796

Editore: Berlin ; Heidelberg ; New York ; Barcelona ; Budapest ; Hong Kong ; London ; Milan ; Paris ; Tokyo : Springer, 1995

Riguardo questo articolo

287 S. : graph. Darst. ; 24 cm Sprache: Deutsch Gewicht in Gramm: 469.

Codice articolo 456530

Dati bibliografici

• Titolo: Constraint processing : selected papers. Manfred Meyer (ed.) / Lecture notes in computer science ; Vol. 923
• Editore: Berlin ; Heidelberg ; New York ; Barcelona ; Budapest ; Hong Kong ; London ; Milan ; Paris ; Tokyo : Springer
• Data di pubblicazione: 1995
• Lingua: Tedesco
• ISBN 10: 3540594795
• ISBN 13: 9783540594796
• Rilegatura: kart.
• Edizione: 1995.
• Condizione: Gut
• Peso: 469 grammi
• Cataloghi dei venditori:
  • Alle Bücher

Descrizione articolo

Riassunto

This volume contains 15 thoroughly refereed full research papers selected from the presentations given during two workshops on constraint processing; these workshops were held in conjunction with the International Congress on Computer Systems and Applied Mathematics (St. Petersburg, Russia, July 1993) and the European Conference on Artificial Intelligence (Amsterdam, The Netherlands, August 1994).
This volume essentially contributes to integrating the different approaches to the young and very active field of constraint processing by offering papers from logic programming, knowledge representation, expert systems, theoretical computer science, operations research, and other fields. Among contributions are two surveys, by Podelski and van Roy and by Freuder.

Contenuti

A detailed algorithm testing guards over feature trees.- A generalized semantics for concurrent constraint languages and their abstract interpretation.- High-level constraints over finite domains.- Integrating constraints in an object-based knowledge representation system.- A CLP approach for examination planning.- The many paths to satisfaction.- Directed arc consistency preprocessing.- In search of exceptionally difficult constraint satisfaction problems.- Using bidirectionality to speed up arc-consistency processing.- Using metalevel constraint knowledge to reduce constraint checking.- Forward checking with backmarking.- Redundant hidden variables in finite domain constraint problems.- Semantic properties of CHIP(FD).- Combining hill climbing and forward checking for handling disjunctive constraints.- GA-easy and GA-hard constraint satisfaction problems.