Farid Ajili (auth.), Ugo Montanari, Francesca Rossi (eds.)3540602992, 9783540602996
The 33 refereed full papers included were selected out of 108 submissions and constitute the main part of the book; in addition there is a 60-page documentation of the four invited papers and a section presenting industrial reports. Thus besides having a very strong research component, the volume will be attractive for practitioners. The papers are organized in sections on efficient constraint handling, constraint logic programming, concurrent constraint programming, computational logic, applications, and operations research.
Table of contents :
Complete solving of linear Diophantine equations and inequations without adding variables….Pages 1-17
From Elliott-MacMahon to an algorithm for general linear constraints on naturals….Pages 18-35
The progressive party problem: Integer linear programming and constraint programming compared….Pages 36-52
From local to global consistency in temporal constraint networks….Pages 53-69
Scaling effects in the CSP phase transition….Pages 70-87
Asynchronous weak-commitment search for solving distributed constraint satisfaction problems….Pages 88-102
Optimization-based heuristics for maximal constraint satisfaction….Pages 103-120
First-order definability over constraint databases….Pages 121-136
On similarity queries for time-series data: Constraint specification and implementation….Pages 137-153
Safe stratified datalog with integer order programs….Pages 154-169
Constrained dependencies….Pages 170-185
Solving linear, min and max constraint systems using CLP based on relational interval arithmetic….Pages 186-203
Debugging constraint programs….Pages 204-221
An optimizing compiler for CLP(ℛ)….Pages 222-239
Local and global relational consistency….Pages 240-257
Dynamic variable ordering in CSPs….Pages 258-275
A unifying framework for tractable constraints….Pages 276-291
On the forward checking algorithm….Pages 292-309
A confluent calculus for concurrent constraint programming with guarded choice….Pages 310-327
Situated simplification….Pages 328-344
Guarded constructive disjunction: Angel or demon?….Pages 345-361
Domain independent ask approximation in CCP….Pages 362-379
On the combination of symbolic constraints, solution domains, and constraint solvers….Pages 380-397
Constraint propagation in model generation….Pages 398-414
Normalizing narrowing for weakly terminating and confluent systems….Pages 415-430
On termination of constraint logic programs….Pages 431-448
Modelling producer/consumer constraints….Pages 449-462
A constraint-based approach to diagnosing software problems in computer networks….Pages 463-480
Solving crew scheduling problems by constraint programming….Pages 481-498
A visual constraint-programming environment….Pages 499-514
Polynomial restrictions of SAT: What can be done with an efficient implementation of the Davis and Putnam’s procedure?….Pages 515-532
Improved branch and bound in constraint logic programming….Pages 533-548
Reducing domains for search in CLP(FD) and its application to job-shop scheduling….Pages 549-562
What is symbolic computation?….Pages 563-563
Constraint solving for combinatorial search problems: A tutorial….Pages 564-587
The concurrent constraint programming research programmes….Pages 588-588
Automatic generation of invariants and intermediate assertions….Pages 589-623
The OTI constraint solver: A constraint library for constructing interactive graphical user interfaces….Pages 624-628
Model-based computing: Using concurrent constraint programming for modeling and model compilation….Pages 629-635
CLP in ECRC….Pages 636-639
Constraint programming and industrial applications….Pages 640-642
The CHIP system and its applications….Pages 643-646
Applications of constraint programming….Pages 647-650
Reviews
There are no reviews yet.