Recent Advances in Constraints: 12th Annual ERCIM International Workshop on Constraint Solving and Contraint Logic Programming, CSCLP 2007 Rocquencourt, France, June 7-8, 2007 Revised Selected Papers
François Fages, Francesca Rossi, Sylvain Soliman
Springer Science & Business Media, Dec 1, 2008 - Computers - 159 pages
Constraint programming supports a great ambition for computer programming: the one of making programming essentially a modeling task, with equations, constraints,and logicalformulas. This ?eld emerged in the mid-1980sborrowing conceptsfromlogicprogramming,operationsresearch,andarti?cialintelligence. Its foundation is the use of relations on mathematical variables to compute with partial information systems. The successes of constraint programming for so- ing combinatorial optimization problems in industry or commerce are related to the advances made in the ?eld on new constraint propagationtechniques and on declarativelanguageswhich allowcontrolonthe mixing of heterogeneousreso- tiontechniquessuchasnumerical,symbolic,deductive,andheuristictechniques. This volumecontainsthe papers selectedfor the post-proceedingsof the12th International Workshop on Constraint Solving and Constraint Logic Progr- ming (CSCLP 2007) held during June 7–8, 2008 in Rocquencourt, France. This workshop, open to all, was organized as the 12th meeting of the working group onConstraintsofthe EuropeanResearchConsortiumfor Informaticsand Ma- ematics (ERCIM), continuing a series of workshops organized since the creation of the working group in 1997. A selection of papers of these annual workshops have been published since 2002 in a series of books which illustrate the evo- tion of the ?eld, under the title “Recent Advances in Constraints”in the Lecture Notes in Arti?cial Intelligence series. This year, there were 16 submissions, most of them being extended and - vised versions of papers presented at the workshop, plus some new papers. Each submission was reviewed by three reviewers. The Program Committee decided to accept ten papers for publication in this book.
What people are saying - Write a review
We haven't found any reviews in the usual places.
A Comparison of the Notions of Optimality in Soft Constraints and Graphical Games
Temporal Reasoning in Nested Temporal Networks with Alternatives
SCLP for Trust Propagation in SmallWorld Networks
Improving ABT Performance by Adding Synchronization Points
On the Integration of Singleton Consistencies and LookAhead Heuristics
Combining Two Structured Domains for Modeling Various Graph Matching Problems
agent view and-or graph arc-consistency assignment backtracking bijective functions Boolean c-semiring cardinalities clique computation concurrent planning conﬂict connectors consider Constraint Handling Rules Constraint Logic Programming constraint programming constraint satisfaction constraint satisfaction problem corresponding criteria deﬁned deﬁnition diﬀerent DisCSP domain edges eﬃcient joint strategies elements example ﬁnd ﬁnding ﬁnite ﬁrst ﬂow French Riviera global constraints goal satisfaction problems graph matching graphical games Heidelberg heuristics instances isomorphism LNCS Logic Programming map variable maximal minimal monomorphism mutex network mutual exclusion network Nash equilibria Nested TNAs ngd message nogood store NP-complete operations optimal solutions optimization problems optional nodes P/A graph Pareto eﬃcient joint Pareto-optimal payoﬀ player preferences priority agents projection consistency random relations represent rules satisﬁes SCLP SCSP semiring singleton consistency small-world small-world network soft constraints solving speciﬁed sub-graph surjective functions temporal constraints Temporal Networks TFOS model TFOS problem trust metrics vertex