![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
CSCLP 2007: Rocquencourt, Francel
- François Fages, Francesca Rossi, Sylvain Soliman
:
Recent Advances in Constraints, 12th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2007, Rocquencourt, France, June 7-8, 2007, Revised Selected Papers. Lecture Notes in Computer Science 5129, Springer 2008, ISBN 978-3-540-89811-5 - Krzysztof R. Apt, Francesca Rossi, Kristen Brent Venable:
A Comparison of the Notions of Optimality in Soft Constraints and Graphical Games. 1-16 - Roman Barták, Ondrej Cepek, Martin Hejna:
Temporal Reasoning in Nested Temporal Networks with Alternatives. 17-31 - Stefano Bistarelli
, Francesco Santini:
SCLP for Trust Propagation in Small-World Networks. 32-46 - Ismel Brito, Pedro Meseguer:
Improving ABT Performance by Adding Synchronization Points. 47-61 - Marco Correia, Pedro Barahona:
On the Integration of Singleton Consistencies and Look-Ahead Heuristics. 62-75 - Yves Deville
, Grégoire Dooms, Stéphane Zampelli:
Combining Two Structured Domains for Modeling Various Graph Matching Problems. 76-90 - Thom W. Frühwirth:
Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR. 91-108 - Ulrich Junker:
Preference-Based Problem Solving for Constraint Programming. 109-126 - Igor Razgon, Barry O'Sullivan, Gregory M. Provan:
Generalizing Global Constraints Based on Network Flows. 127-141 - Pavel Surynek:
A Global Filtration for Satisfying Goals in Mutual Exclusion Networks. 142-157
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.