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.
Author(s): Andreas Podelski, Peter Van Roy (auth.), Manfred Meyer (eds.)
Series: Lecture Notes in Computer Science 923
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1995
Language: English
Pages: 296
Tags: Programming Techniques; Programming Languages, Compilers, Interpreters; Artificial Intelligence (incl. Robotics); Logics and Meanings of Programs; Mathematical Logic and Formal Languages; Information Storage and Retrieval
A detailed algorithm testing guards over feature trees....Pages 11-38
A generalized semantics for concurrent constraint languages and their abstract interpretation....Pages 39-49
High-level constraints over finite domains....Pages 51-66
Integrating constraints in an object-based knowledge representation system....Pages 67-83
A CLP approach for examination planning....Pages 85-101
The many paths to satisfaction....Pages 103-119
Directed arc consistency preprocessing....Pages 121-137
In search of exceptionally difficult constraint satisfaction problems....Pages 139-155
Using bidirectionality to speed up arc-consistency processing....Pages 157-169
Using metalevel constraint knowledge to reduce constraint checking....Pages 171-184
Forward checking with backmarking....Pages 185-204
Redundant hidden variables in finite domain constraint problems....Pages 205-223
Semantic properties of CHIP(FD)....Pages 225-245
Combining hill climbing and forward checking for handling disjunctive constraints....Pages 247-265
GA-easy and GA-hard constraint satisfaction problems....Pages 267-283
