default search action
13th CP 2007: Providence, RI, USA
- Christian Bessiere:
Principles and Practice of Constraint Programming - CP 2007, 13th International Conference, CP 2007, Providence, RI, USA, September 23-27, 2007, Proceedings. Lecture Notes in Computer Science 4741, Springer 2007, ISBN 978-3-540-74969-1
Invited Lectures
- Fahiem Bacchus:
Caching in Backtracking Search. 1 - Matthew L. Ginsberg:
Of Mousetraps and Men: A Cautionary Tale. 2
Application Papers
- Grégory Beaumet, Gérard Verfaillie, Marie-Claire Charmeau:
Estimation of the Minimal Duration of an Attitude Change for an Autonomous Agile Earth-Observing Satellite. 3-17 - Raphaël Chenouard, Patrick Sébastian, Laurent Granvilliers:
Solving an Air Conditioning System Problem in an Embodiment Design Context Using Constraint Satisfaction Techniques. 18-32 - Chiu Wo Choi, Jimmy Ho-Man Lee:
Solving the Salinity Control Problem in a Potable Water System. 33-48 - Hélène Collavizza, Michel Rueher:
Exploring Different Constraint-Based Modelings for Program Verification. 49-63 - Andrew J. Davenport, Jayant Kalagnanam, Chandra Reddy, Stuart Siegel, John Hou:
An Application of Constraint Programming to Generating Detailed Operations Schedules for Steel Manufacturing. 64-76 - Antoine Gargani, Philippe Refalo:
An Efficient Model and Strategy for the Steel Mill Slab Design Problem. 77-89 - Rosella Gennari
, Ornella Mich:
Constraint-Based Temporal Reasoning for E-Learning with LODE. 90-104 - Roman van der Krogt, James Little, Kenneth Pulliam, Sue Hanhilammi, Yue Jin:
Scheduling for Cellular Manufacturing. 105-117
Full Research Papers
- Henrik Reif Andersen, Tarik Hadzic, John N. Hooker, Peter Tiedemann:
A Constraint Store Based on Multivalued Decision Diagrams. 118-132 - Fahiem Bacchus:
GAC Via Unit Propagation. 133-147 - Fahiem Bacchus, Kostas Stergiou:
Solution Directed Backjumping for QCSP. 148-163 - Kenneth M. Bayer, Martin Michalowski
Reformulating CSPs for Scalability with Application to Geospatial Reasoning. 164-179 - Nicolas Beldiceanu, Mats Carlsson, Emmanuel Poder, R. Sadek, Charlotte Truchet:
A Generic Geometrical Constraint Kernel in Space and Time for Handling Polymorphic k-Dimensional Objects. 180-194 - Belaid Benhamou, Mohamed Réda Saïdi:
Local Symmetry Breaking During Search in CSPs. 195-209 - Sebastian Brand, Nina Narodytska, Claude-Guy Quimper
Encodings of the Sequence Constraint. 210-224 - Sylvain Darras, Gilles Dequen, Laure Devendeville
On Inconsistent Clause-Subsets for Max-SAT Solving. 225-240 - Tristan Denmat, Arnaud Gotlieb, Mireille Ducassé:
An Abstract Interpretation Based Combinator for Modelling While Loops in Constraint Programming. 241-255 - Bistra Dilkina
Tradeoffs in the Complexity of Backdoor Detection. 256-270 - Grégoire Dooms, Pascal Van Hentenryck, Laurent Michel:
Model-Driven Visualizations of Constraint-Based Local Search. 271-285 - Mirco Gelain, Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable:
Dealing with Incomplete Preferences in Soft Constraint Problems. 286-300 - Alfonso Gerevini
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure. 301-316 - Éric Grégoire, Bertrand Mazure, Cédric Piette:
MUST: Provide a Finer-Grained Explanation of Unsatisfiability. 317-331 - Steven Halim, Roland H. C. Yap, Hoong Chuin Lau
An Integrated White+Black Box Approach for Designing and Tuning Stochastic Local Search. 332-347 - Matti Järvisalo
Limitations of Restricted Branching in Clause Learning. 348-363 - Philippe Jégou, Samba Ndiaye, Cyril Terrioux:
Dynamic Management of Heuristics for Solving Structured CSPs. 364-378 - George Katsirelos, Toby Walsh:
A Compression Algorithm for Large Arity Extensional Constraints. 379-393 - Mohand Ou Idir Khemmoudj, Hachemi Bennaceur:
Valid Inequality Based Lower Bounds for WCSP. 394-408 - Mikael Z. Lagerkvist, Christian Schulte:
Advisors for Incremental Propagation. 409-422 - Yat Chiu Law, Jimmy Ho-Man Lee, Toby Walsh, J. Y. K. Yip:
Breaking Symmetry of Interchangeable Variables and Values. 423-437 - Christophe Lecoutre, Stéphane Cardon
Path Consistency by Dual Consistency. 438-452 - Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal:
Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance. 453-467 - Michele Lombardi, Michela Milano:
Scheduling Conditional Task Graphs. 468-482 - João Marques-Silva, Inês Lynce:
Towards Robust CNF Encodings of Cardinality Constraints. 483-497 - Robert Mateescu, Radu Marinescu, Rina Dechter:
AND/OR Multi-valued Decision Diagrams for Constraint Optimization. 498-513 - Laurent Michel, Andrew See, Pascal Van Hentenryck:
Parallelizing Constraint Programs Transparently. 514-528 - Nicholas Nethercote, Peter J. Stuckey, Ralph Becket, Sebastian Brand, Gregory J. Duck
MiniZinc: Towards a Standard CP Modelling Language. 529-543 - Olga Ohrimenko, Peter J. Stuckey, Michael Codish
Propagation = Lazy Clause Generation. 544-558 - Matthieu Petit, Arnaud Gotlieb:
Boosting Probabilistic Choice Operators. 559-573 - Luca Pulina, Armando Tacchella
A Multi-engine Solver for Quantified Boolean Formulas. 574-589 - Claude-Guy Quimper
Decomposing Global Grammar Constraints. 590-604 - Miquel Ramírez
Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT. 605-619 - Pierre Schaus, Yves Deville, Pierre Dupont:
Bound-Consistent Deviation Constraint. 620-634 - Gilles Trombettoni, Gilles Chabert:
Constructive Interval Disjunction. 635-650 - Menkes van den Briel, J. Benton, Subbarao Kambhampati, Thomas Vossen:
An LP-Based Heuristic for Optimal Planning. 651-665 - Nic Wilson
A Cost-Based Model and Algorithms for Interleaving Solving and Elicitation of CSPs. 666-680 - Huayue Wu, Peter van Beek:
On Universal Restart Strategies for Backtracking Search. 681-695 - Lin Xu, Holger H. Hoos, Kevin Leyton-Brown:
Hierarchical Hardness Models for SAT. 696-711 - Lin Xu, Frank Hutter, Holger H. Hoos, Kevin Leyton-Brown
: The Design and Analysis of an Algorithm Portfolio for SAT. 712-727 - Stéphane Zampelli, Yves Deville, Christine Solnon, Sébastien Sorlin, Pierre Dupont:
Filtering for Subgraph Isomorphism. 728-742 - Alessandro Zanarini, Gilles Pesant:
Solution Counting Algorithms for Constraint-Centered Search Heuristics. 743-757 - Roie Zivan, Moshe Zazone, Amnon Meisels:
Min-Domain Ordering for Asynchronous Backtracking. 758-772
Short Research Papers
- Stefano Bistarelli
Answer Set Optimization for and/or Composition of CP-Nets: A Security Scenario. 773-781 - Stefano Bistarelli
Uncertainty in Bipolar Preference Problems. 782-789 - Lucas Bordeaux, Youssef Hamadi, Moshe Y. Vardi:
An Analysis of Slow Convergence in Interval Propagation. 790-797 - David A. Cohen, Peter Jeavons, Stanislav Zivný:
The Expressive Power of Valued Constraints: Hierarchies and Collapses. 798-805 - Jean-François Condotta, Gérard Ligozat, Mahmoud Saade:
Eligible and Frozen Constraints for Solving Temporal Qualitative Constraint Networks. 806-814 - Marco Gavanelli
The Log-Support Encoding of CSP into SAT. 815-822 - Ian P. Gent, Tom W. Kelsey, Stephen A. Linton, J. Pearson, Colva M. Roney-Dougal:
Groupoids and Conditional Symmetry. 823-830 - Diarmuid Grimes, Richard J. Wallace:
Sampling Strategies and Variable Selection in Weighted Degree Heuristics. 831-838 - Jinbo Huang:
A Case for Simple SAT Solvers. 839-846 - Zeynep Kiziltan, Andrea Lodi, Michela Milano, Fabio Parisini:
CP-Based Local Branching. 847-855 - Bart Peintner, Kristen Brent Venable, Neil Yorke-Smith:
Strong Controllability of Disjunctive Temporal Problems with Uncertainty. 856-863 - Vicente Ruiz de Angulo, Carme Torras
Exploiting Single-Cycle Symmetries in Branch-and-Prune algorithms. 864-871 - Barbara M. Smith, Stefano Bistarelli
Constraint Symmetry for the Soft CSP. 872-879 - Toby Walsh:
Breaking Value Symmetry. 880-887
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.
last updated on 2024-11-19 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: