Constraint Processing

Selected Papers
1995
ISBN: 978-3-540-59479-6
Verlag: Springer Berlin Heidelberg

Buch, Englisch, Band 923, 296 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 458 g

Reihe: Lecture Notes in Computer Science

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.

Zielgruppe

Research

Autoren/Hrsg.

Meyer, Manfred

Fachgebiete

• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Prozedurale Programmierung
• Mathematik | Informatik EDV | Informatik Daten / Datenbanken Datenkompression, Dokumentaustauschformate
• Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz Wissensbasierte Systeme, Expertensysteme
• Technische Wissenschaften Elektronik | Nachrichtentechnik Elektronik Robotik
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines

Inhaltsverzeichnis

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.