Constraint Processing: Selected Papers by Manfred MeyerConstraint Processing: Selected Papers by Manfred Meyer

Constraint Processing: Selected Papers

EditorManfred Meyer

Paperback | June 20, 1995

Pricing and Purchase Info

$114.32 online 
$128.95 list price save 11%
Earn 572 plum® points

Prices and offers may vary in store


In stock online

Ships free on orders over $25

Not available in stores


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.
Title:Constraint Processing: Selected PapersFormat:PaperbackDimensions:293 pages, 9.25 × 6.1 × 0 inPublished:June 20, 1995Publisher:Springer Berlin Heidelberg

The following ISBNs are associated with this title:

ISBN - 10:3540594795

ISBN - 13:9783540594796

Look for similar items by category:


Table of Contents

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.