Constraint processing : selected papers
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 199...
Enregistré dans:
| Andre forfattere: | |
|---|---|
| Format: | Livre numérique |
| Sprog: | Anglais |
| Udgivet: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serier: | Lecture notes in computer science
923 |
| Fag: | |
| Online adgang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Kommentar: |
Actes de deux séminaires tenus en 1993 et 1994, d'après la préface Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Constraint processing, selected papers, Manfred Meyer (Ed.), Berlin, Springer-Verlag, 1995, 1 vol. (287 p.), Lecture notes in computer science, 3-540-59479-5 • Constraint Processing, Texte imprimé, 9783662177044 |
Indholdsfortegnelse:
- 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.