Recent Advances in Constraints: 13th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2008, Rome, Italy, June 18-20, 2008, Revised Selected Papers
Angelo Oddi, François Fages, Francesca Rossi
Springer Science & Business Media, Jul 28, 2009 - Computers - 147 pages
This book constitutes the thoroughly refereed and extended post-workshop proceedings of the 13th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2008, held in Rome, Italy, in June 2008. The 9 revised full papers presented were carefully reviewed and selected from 14 initial submissions. The papers in this volume present original research results, as well as applications, in many aspects of constraint solving and constraint logic programming. Research topics that can be found in the papers are ¯rst-order constraints, symmetry breaking, global constraints, constraint optimization problems, distributed constraint solving problems, soft constraints, as well as the analysis of application domains such as cumulative resource problems and hybrid systems.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Solving CSPs with Naming Games
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Challenges in ConstraintBased Analysis of Hybrid Systems
From Rules to Constraint Programs with the Rules2CP Modelling Language
Combining Symmetry Breaking and Global Constraints
Other editions - View all
ADOPT search agents algorithm Artiﬁcial Intelligence assignment best lower bound best-ﬁrst search Best-ROB(P bin packing problems Boolean c-semiring coalition completely connected graph complexity Computer conﬂict constraint logic programming constraint programming constraint satisfaction constraint satisfaction problems cost cost-minimal solution Craig interpolant cycle graph DCOP problems decision procedure decomposable theories deﬁned deﬁnition depth-ﬁrst search diﬀerent empty et(Ai example ﬁnd ﬁnite ﬁrst ﬁrst-order ﬂattening free variables function global constraints Heidelberg heuristics hybrid systems IDB-ADOPT iﬀ instances integer interpolants iSAT Iteration lexicographically listeners LNCS makespan model checking naming game node normalized formula optimal solutions P-ROB(P path graph PKML precedence constraints preference propagator proposition quantiﬁers RCPSP/max represented rewriting root vertex rules satisﬁed scenario scheduling problem SCSP search tree Section semiring sequence soft constraint solver speaker speciﬁc Springer stable marriage problem stall step straints strategy Success update tconv threshold unstable upper bound vertex x1 xxxxxxx xxxxxxx xxxxxxx zero