↓ Skip to main content

Principles and practice of constraint programming--CP 2007 : 13th international conference, CP 2007, Providence, RI, USA, September 23-27, 2007 : proceedings

Overview of attention for book
Cover of 'Principles and practice of constraint programming--CP 2007 : 13th international conference, CP 2007, Providence, RI, USA, September 23-27, 2007 : proceedings'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Caching in Backtracking Search
  3. Altmetric Badge
    Chapter 2 Of Mousetraps and Men: A Cautionary Tale
  4. Altmetric Badge
    Chapter 3 Estimation of the Minimal Duration of an Attitude Change for an Autonomous Agile Earth-Observing Satellite
  5. Altmetric Badge
    Chapter 4 Solving an Air Conditioning System Problem in an Embodiment Design Context Using Constraint Satisfaction Techniques
  6. Altmetric Badge
    Chapter 5 Solving the Salinity Control Problem in a Potable Water System
  7. Altmetric Badge
    Chapter 6 Exploring Different Constraint-Based Modelings for Program Verification
  8. Altmetric Badge
    Chapter 7 An Application of Constraint Programming to Generating Detailed Operations Schedules for Steel Manufacturing
  9. Altmetric Badge
    Chapter 8 An Efficient Model and Strategy for the Steel Mill Slab Design Problem
  10. Altmetric Badge
    Chapter 9 Constraint-Based Temporal Reasoning for E-Learning with LODE
  11. Altmetric Badge
    Chapter 10 Scheduling for Cellular Manufacturing
  12. Altmetric Badge
    Chapter 11 A Constraint Store Based on Multivalued Decision Diagrams
  13. Altmetric Badge
    Chapter 12 GAC Via Unit Propagation
  14. Altmetric Badge
    Chapter 13 Solution Directed Backjumping for QCSP
  15. Altmetric Badge
    Chapter 14 Reformulating CSPs for Scalability with Application to Geospatial Reasoning
  16. Altmetric Badge
    Chapter 15 A Generic Geometrical Constraint Kernel in Space and Time for Handling Polymorphic k -Dimensional Objects
  17. Altmetric Badge
    Chapter 16 Local Symmetry Breaking During Search in CSPs
  18. Altmetric Badge
    Chapter 17 Encodings of the Sequence Constraint
  19. Altmetric Badge
    Chapter 18 On Inconsistent Clause-Subsets for Max-SAT Solving
  20. Altmetric Badge
    Chapter 19 An Abstract Interpretation Based Combinator for Modelling While Loops in Constraint Programming
  21. Altmetric Badge
    Chapter 20 Tradeoffs in the Complexity of Backdoor Detection
  22. Altmetric Badge
    Chapter 21 Model-Driven Visualizations of Constraint-Based Local Search
  23. Altmetric Badge
    Chapter 22 Dealing with Incomplete Preferences in Soft Constraint Problems
  24. Altmetric Badge
    Chapter 23 Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
  25. Altmetric Badge
    Chapter 24 MUST: Provide a Finer-Grained Explanation of Unsatisfiability
  26. Altmetric Badge
    Chapter 25 An Integrated White+Black Box Approach for Designing and Tuning Stochastic Local Search
  27. Altmetric Badge
    Chapter 26 Limitations of Restricted Branching in Clause Learning
  28. Altmetric Badge
    Chapter 27 Dynamic Management of Heuristics for Solving Structured CSPs
  29. Altmetric Badge
    Chapter 28 A Compression Algorithm for Large Arity Extensional Constraints
  30. Altmetric Badge
    Chapter 29 Valid Inequality Based Lower Bounds for WCSP
  31. Altmetric Badge
    Chapter 30 Advisors for Incremental Propagation
  32. Altmetric Badge
    Chapter 31 Breaking Symmetry of Interchangeable Variables and Values
  33. Altmetric Badge
    Chapter 32 Path Consistency by Dual Consistency
  34. Altmetric Badge
    Chapter 33 Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance
  35. Altmetric Badge
    Chapter 34 Scheduling Conditional Task Graphs
  36. Altmetric Badge
    Chapter 35 Towards Robust CNF Encodings of Cardinality Constraints
  37. Altmetric Badge
    Chapter 36 AND/OR Multi-valued Decision Diagrams for Constraint Optimization
  38. Altmetric Badge
    Chapter 37 Parallelizing Constraint Programs Transparently
  39. Altmetric Badge
    Chapter 38 MiniZinc: Towards a Standard CP Modelling Language
  40. Altmetric Badge
    Chapter 39 Propagation = Lazy Clause Generation
  41. Altmetric Badge
    Chapter 40 Boosting Probabilistic Choice Operators
  42. Altmetric Badge
    Chapter 41 A Multi-engine Solver for Quantified Boolean Formulas
  43. Altmetric Badge
    Chapter 42 Decomposing Global Grammar Constraints
  44. Altmetric Badge
    Chapter 43 Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT
  45. Altmetric Badge
    Chapter 44 Bound-Consistent Deviation Constraint
  46. Altmetric Badge
    Chapter 45 Constructive Interval Disjunction
  47. Altmetric Badge
    Chapter 46 An LP-Based Heuristic for Optimal Planning
  48. Altmetric Badge
    Chapter 47 A Cost-Based Model and Algorithms for Interleaving Solving and Elicitation of CSPs
  49. Altmetric Badge
    Chapter 48 On Universal Restart Strategies for Backtracking Search
  50. Altmetric Badge
    Chapter 49 Hierarchical Hardness Models for SAT
  51. Altmetric Badge
    Chapter 50 SATzilla-07 : The Design and Analysis of an Algorithm Portfolio for SAT
  52. Altmetric Badge
    Chapter 51 Filtering for Subgraph Isomorphism
  53. Altmetric Badge
    Chapter 52 Solution Counting Algorithms for Constraint-Centered Search Heuristics
  54. Altmetric Badge
    Chapter 53 Min-Domain Ordering for Asynchronous Backtracking
  55. Altmetric Badge
    Chapter 54 Answer Set Optimization for and/or Composition of CP-Nets: A Security Scenario
  56. Altmetric Badge
    Chapter 55 Uncertainty in Bipolar Preference Problems
  57. Altmetric Badge
    Chapter 56 An Analysis of Slow Convergence in Interval Propagation
  58. Altmetric Badge
    Chapter 57 The Expressive Power of Valued Constraints: Hierarchies and Collapses
  59. Altmetric Badge
    Chapter 58 Eligible and Frozen Constraints for Solving Temporal Qualitative Constraint Networks
  60. Altmetric Badge
    Chapter 59 The Log-Support Encoding of CSP into SAT
  61. Altmetric Badge
    Chapter 60 Principles and Practice of Constraint Programming – CP 2007
  62. Altmetric Badge
    Chapter 61 Sampling Strategies and Variable Selection in Weighted Degree Heuristics
  63. Altmetric Badge
    Chapter 62 A Case for Simple SAT Solvers
  64. Altmetric Badge
    Chapter 63 CP-Based Local Branching
  65. Altmetric Badge
    Chapter 64 Strong Controllability of Disjunctive Temporal Problems with Uncertainty
  66. Altmetric Badge
    Chapter 65 Exploiting Single-Cycle Symmetries in Branch-and-Prune algorithms
  67. Altmetric Badge
    Chapter 66 Constraint Symmetry for the Soft CSP
  68. Altmetric Badge
    Chapter 67 Breaking Value Symmetry
Attention for Chapter 43: Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT
Altmetric Badge

Citations

dimensions_citation
5 Dimensions

Readers on

mendeley
8 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT
Chapter number 43
Book title
Principles and Practice of Constraint Programming – CP 2007
Published by
Springer, Berlin, Heidelberg, September 2007
DOI 10.1007/978-3-540-74970-7_43
Book ISBNs
978-3-54-074969-1, 978-3-54-074970-7
Authors

Miquel Ramírez, Hector Geffner

Mendeley readers

The data shown below were compiled from readership statistics for 8 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Spain 1 13%
United States 1 13%
Italy 1 13%
Unknown 5 63%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 4 50%
Researcher 1 13%
Lecturer 1 13%
Other 1 13%
Unknown 1 13%
Readers by discipline Count As %
Computer Science 7 88%
Unknown 1 13%