↓ Skip to main content
What is this page? Embed badge

Principles and Practice of Constraint Programming - CP 2005

Overview of attention for book
Principles and Practice of Constraint Programming - CP 2005
Springer Berlin Heidelberg

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Search and Inference in AI Planning
  3. Altmetric Badge
    Chapter 2 OWL: A Description Logic Based Ontology Language
  4. Altmetric Badge
    Chapter 3 Preference Reasoning
  5. Altmetric Badge
    Chapter 4 The G12 Project: Mapping Solver Independent Models to Efficient Solutions
  6. Altmetric Badge
    Chapter 5 Symmetry Definitions for Constraint Satisfaction Problems
  7. Altmetric Badge
    Chapter 6 Dynamic Ordering for Asynchronous Backtracking on DisCSPs
  8. Altmetric Badge
    Chapter 7 Incremental Algorithms for Local Search from Existential Second-Order Logic
  9. Altmetric Badge
    Chapter 8 Inter-distance Constraint: An Extension of the All-Different Constraint for Scheduling Equal Length Jobs
  10. Altmetric Badge
    Chapter 9 Mind the Gaps: A New Splitting Strategy for Consistency Techniques
  11. Altmetric Badge
    Chapter 10 Graph Invariants as Necessary Conditions for Global Constraints
  12. Altmetric Badge
    Chapter 11 Allocation and Scheduling for MPSoCs via Decomposition and No-Good Generation
  13. Altmetric Badge
    Chapter 12 Sub-optimality Approximations
  14. Altmetric Badge
    Chapter 13 A Linear-Logic Semantics for Constraint Handling Rules
  15. Altmetric Badge
    Chapter 14 Distributed Stable Matching Problems
  16. Altmetric Badge
    Chapter 15 Beyond Hypertree Width: Decomposition Methods Without Decompositions
  17. Altmetric Badge
    Chapter 16 Ad-hoc Global Constraints for Life
  18. Altmetric Badge
    Chapter 17 Tractable Clones of Polynomials over Semigroups
  19. Altmetric Badge
    Chapter 18 CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
  20. Altmetric Badge
    Chapter 19 Interval Analysis in Scheduling
  21. Altmetric Badge
    Chapter 20 Assumption-Based Pruning in Conditional CSP
  22. Altmetric Badge
    Chapter 21 Conditional Symmetry Breaking
  23. Altmetric Badge
    Chapter 22 Symmetry and Consistency
  24. Altmetric Badge
    Chapter 23 Solving the MOLR and Social Golfers Problems
  25. Altmetric Badge
    Chapter 24 Advances in Polytime Isomorph Elimination for Configuration
  26. Altmetric Badge
    Chapter 25 Planning and Scheduling to Minimize Tardiness
  27. Altmetric Badge
    Chapter 26 Search Heuristics and Heavy-Tailed Behaviour
  28. Altmetric Badge
    Chapter 27 2 -Way vs.d -Way Branching for CSP
  29. Altmetric Badge
    Chapter 28 Maintaining Longest Paths in Cyclic Graphs
  30. Altmetric Badge
    Chapter 29 Applying Constraint Programming to Rigid Body Protein Docking
  31. Altmetric Badge
    Chapter 30 Maximum Constraint Satisfaction on Diamonds
  32. Altmetric Badge
    Chapter 31 Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
  33. Altmetric Badge
    Chapter 32 Generalized Conflict Learning for Hybrid Discrete/Linear Optimization
  34. Altmetric Badge
    Chapter 33 Parallel Local Search in Comet
  35. Altmetric Badge
    Chapter 34 Generating Corrective Explanations for Interactive Constraint Satisfaction
  36. Altmetric Badge
    Chapter 35 SPREAD: A Balancing Constraint Based on Statistics
  37. Altmetric Badge
    Chapter 36 Automatic Detection of Variable and Value Symmetries
  38. Altmetric Badge
    Chapter 37 Breaking All Value Symmetries in Surjection Problems
  39. Altmetric Badge
    Chapter 38 AC-*: A Configurable, Generic and Adaptive Arc Consistency Algorithm
  40. Altmetric Badge
    Chapter 39 Maintaining Arc Consistency Algorithms During the Search Without Additional Space Cost
  41. Altmetric Badge
    Chapter 40 Weak Composition for Qualitative Spatial and Temporal Reasoning
  42. Altmetric Badge
    Chapter 41 Boosting Distributed Constraint Satisfaction
  43. Altmetric Badge
    Chapter 42 Depth-First Mini-Bucket Elimination
  44. Altmetric Badge
    Chapter 43 Using SAT in QBF
  45. Altmetric Badge
    Chapter 44 Tree Decomposition with Function Filtering
  46. Altmetric Badge
    Chapter 45 On Solving Soft Temporal Constraints Using SAT Techniques
  47. Altmetric Badge
    Chapter 46 Principles and Practice of Constraint Programming - CP 2005
  48. Altmetric Badge
    Chapter 47 Caching Search States in Permutation Problems
  49. Altmetric Badge
    Chapter 48 Repair-Based Methods for Quantified CSPs
  50. Altmetric Badge
    Chapter 49 Principles and Practice of Constraint Programming - CP 2005
  51. Altmetric Badge
    Chapter 50 Solving Simple Planning Problems with More Inference and No Search
  52. Altmetric Badge
    Chapter 51 Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning
  53. Altmetric Badge
    Chapter 52 Factor Analytic Studies of CSP Heuristics
  54. Altmetric Badge
    Chapter 53 Lookahead Saturation with Restriction for SAT
  55. Altmetric Badge
    Chapter 54 Evolving Variable-Ordering Heuristics for Constrained Optimisation
  56. Altmetric Badge
    Chapter 55 Multi-point Constructive Search
  57. Altmetric Badge
    Chapter 56 Bounds of Graph Characteristics
  58. Altmetric Badge
    Chapter 57 Acquiring Parameters of Implied Global Constraints
  59. Altmetric Badge
    Chapter 58 Integrating Benders Decomposition Within Constraint Programming
  60. Altmetric Badge
    Chapter 59 Using Boolean Constraint Propagation for Sub-clauses Deduction
  61. Altmetric Badge
    Chapter 60 Extending Systematic Local Search for Job Shop Scheduling Problems
  62. Altmetric Badge
    Chapter 61 Interactive Reconfiguration in Power Supply Restoration
  63. Altmetric Badge
    Chapter 62 Neighbourhood Clause Weight Redistribution in Local Search for SAT
  64. Altmetric Badge
    Chapter 63 Computing and Exploiting Tree-Decompositions for Solving Constraint Networks
  65. Altmetric Badge
    Chapter 64 Encoding Requests to Web Service Compositions as Constraints
  66. Altmetric Badge
    Chapter 65 Test Instance Generation for MAX 2SAT
  67. Altmetric Badge
    Chapter 66 Consistency for Quantified Constraint Satisfaction Problems
  68. Altmetric Badge
    Chapter 67 Alternate Modeling in Sport Scheduling
  69. Altmetric Badge
    Chapter 68 Approximations in Distributed Optimization
  70. Altmetric Badge
    Chapter 69 Extremal CSPs
  71. Altmetric Badge
    Chapter 70 Beyond Finite Domains: The All Different and Global Cardinality Constraints
  72. Altmetric Badge
    Chapter 71 Views and Iterators for Generic Constraint Implementations
  73. Altmetric Badge
    Chapter 72 Approximated Consistency for the Automatic Recording Problem
  74. Altmetric Badge
    Chapter 73 Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
  75. Altmetric Badge
    Chapter 74 Approximate Constrained Subgraph Matching
  76. Altmetric Badge
    Chapter 75 Distributed Constraints for Large-Scale Scheduling Problems
  77. Altmetric Badge
    Chapter 76 Solving Over-Constrained Problems with SAT
  78. Altmetric Badge
    Chapter 77 A Constraint Based Agent for TAC–SCM
  79. Altmetric Badge
    Chapter 78 Solving the Car-Sequencing Problem as a Non-binary CSP
  80. Altmetric Badge
    Chapter 79 Dimensioning an Inbound Call Center Using Constraint Programming
  81. Altmetric Badge
    Chapter 80 Methods to Learn Abstract Scheduling Models
  82. Altmetric Badge
    Chapter 81 Automated Search for Heuristic Functions
  83. Altmetric Badge
    Chapter 82 Constraint-Based Inference: A Bridge Between Constraint Processing and Probability Inference
  84. Altmetric Badge
    Chapter 83 Scheduling Social Tournaments
  85. Altmetric Badge
    Chapter 84 Domain Reduction for the Circuit Constraint
  86. Altmetric Badge
    Chapter 85 Using Constraint Programming for Solving Distance CSP with Uncertainty
  87. Altmetric Badge
    Chapter 86 Improved Algorithm for Finding (a,b)-Super Solutions
  88. Altmetric Badge
    Chapter 87 Local Consistency in Weighted CSPs and Inference in Max-SAT
  89. Altmetric Badge
    Chapter 88 Modeling Constraint Programs with Software Technology Standards
  90. Altmetric Badge
    Chapter 89 Solution Equivalent Subquadrangle Reformulations of Constraint Satisfaction Problems
  91. Altmetric Badge
    Chapter 90 Mechanism Design for Preference Aggregation over Coalitions
  92. Altmetric Badge
    Chapter 91 LP as a Global Search Heuristic Across Different Constrainedness Regions
  93. Altmetric Badge
    Chapter 92 Consistency for Partially Defined Constraints
  94. Altmetric Badge
    Chapter 93 Subnet Generation Problem: A New Network Routing Problem
  95. Altmetric Badge
    Chapter 94 Partial Redundant Modeling
  96. Altmetric Badge
    Chapter 95 AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems
  97. Altmetric Badge
    Chapter 96 Weak Symmetries in Problem Formulations
  98. Altmetric Badge
    Chapter 97 Towards the Systematic Generation of Channelling Constraints
  99. Altmetric Badge
    Chapter 98 AND/OR Search Spaces and the Semantic Width of Constraint Networks
  100. Altmetric Badge
    Chapter 99 Statistical Modelling of CSP Solving Algorithms Performance
  101. Altmetric Badge
    Chapter 100 Probabilistic Arc Consistency
  102. Altmetric Badge
    Chapter 101 GOOSE – A Generic Object-Oriented Search Environment
  103. Altmetric Badge
    Chapter 102 Randomization for Multi-agent Constraint Optimization
  104. Altmetric Badge
    Chapter 103 Uncertainty in Soft Constraint Problems
  105. Altmetric Badge
    Chapter 104 Speeding Up Constrained Path Solvers with a Reachability Propagator
  106. Altmetric Badge
    Chapter 105 From Linear Relaxations to Global Constraint Propagation
  107. Altmetric Badge
    Chapter 106 Encoding HTN Planning as a Dynamic CSP
  108. Altmetric Badge
    Chapter 107 Specialised Constraints for Stable Matching Problems
  109. Altmetric Badge
    Chapter 108 Bounds-Consistent Local Search
  110. Altmetric Badge
    Chapter 109 Robust Constraint Solving Using Multiple Heuristics
  111. Altmetric Badge
    Chapter 110 Scheduling with Uncertain Start Dates
  112. Altmetric Badge
    Chapter 111 The Role of Redundant Clauses in Solving Satisfiability Problems
  113. Altmetric Badge
    Chapter 112 Applying Decomposition Methods to Crossword Puzzle Problems
  114. Altmetric Badge
    Chapter 113 Asymmetric Distributed Constraints Satisfaction Problems
  115. Altmetric Badge
    Chapter 114 Full Arc Consistency in WCSP and in Constraint Hierarchies with Finite Domains
  116. Altmetric Badge
    Chapter 115 CoJava: A Unified Language for Simulation and Optimization
  117. Altmetric Badge
    Chapter 116 Programming with $\mathcal{TOY}(\mathcal{FD})$
  118. Altmetric Badge
    Chapter 117 Computing Super-Schedules
  119. Altmetric Badge
    Chapter 118 Proterv-II: An Integrated Production Planning and Scheduling System
  120. Altmetric Badge
    Chapter 119 The Comet Programming Language and System
  121. Altmetric Badge
    Chapter 120 Random Stimuli Generation for Functional Hardware Verification as a CP Application
  122. Altmetric Badge
    Chapter 121 A BDD-Based Interactive Configurator for Modular Systems
Attention for Chapter 43: Using SAT in QBF
Altmetric Badge

Citations

dimensions_citation
16 Dimensions

Readers on

mendeley
7 Mendeley
citeulike
1 CiteULike
Summary Dimensions citations
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
Using SAT in QBF
Chapter number 43
Book title
Principles and Practice of Constraint Programming - CP 2005
Published by
Springer, Berlin, Heidelberg, October 2005
DOI 10.1007/11564751_43
Book ISBNs
978-3-54-029238-8, 978-3-54-032050-0
Authors

Horst Samulowitz, Fahiem Bacchus, Samulowitz, Horst, Bacchus, Fahiem

View on publisher site
Timeline

Login to access the full chart related to this output.

If you don’t have an account, click here to discover Explorer

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 7 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 3 43%
Researcher 2 29%
Student > Doctoral Student 2 29%
Readers by discipline Count As %
Computer Science 7 100%

This page is provided by Altmetric.