↓ Skip to main content

Principles and Practice of Constraint Programming – CP 2000

Overview of attention for book
Cover of 'Principles and Practice of Constraint Programming – CP 2000'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Constraint-Based Agents: The ABC’s of CBA’s
  3. Altmetric Badge
    Chapter 2 Constraints for Interactive Graphical Applications
  4. Altmetric Badge
    Chapter 3 Meta-complexity Theorems: Talk Abstract
  5. Altmetric Badge
    Chapter 4 Automatic Generation of Propagation Rules for Finite Domains
  6. Altmetric Badge
    Chapter 5 Extending Forward Checking
  7. Altmetric Badge
    Chapter 6 Global Constraints as Graph Properties on a Structured Network of Elementary Constraints of the Same Type
  8. Altmetric Badge
    Chapter 7 Universally Quantified Interval Constraints
  9. Altmetric Badge
    Chapter 8 Constraint Propagation for Soft Constraints: Generalization and Termination Conditions
  10. Altmetric Badge
    Chapter 9 Constraints Inference Channels and Secure Databases
  11. Altmetric Badge
    Chapter 10 Refinements and Independence: A Simple Method for Identifying Tractable Disjunctive Constraints
  12. Altmetric Badge
    Chapter 11 A Language for Audiovisual Template Specification and Recognition
  13. Altmetric Badge
    Chapter 12 Random 3-SAT: The Plot Thickens
  14. Altmetric Badge
    Chapter 13 New Tractable Classes from Old
  15. Altmetric Badge
    Chapter 14 Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees
  16. Altmetric Badge
    Chapter 15 Cutting Planes in Constraint Programming: An Hybrid Approach
  17. Altmetric Badge
    Chapter 16 A Constraint-Based Framework for Prototyping Distributed Virtual Applications
  18. Altmetric Badge
    Chapter 17 A Scalable Linear Constraint Solver for User Interface Construction
  19. Altmetric Badge
    Chapter 18 A Constraint Programming Approach for Solving Rigid Geometric Systems
  20. Altmetric Badge
    Chapter 19 Maintaining Arc-Consistency within Dynamic Backtracking
  21. Altmetric Badge
    Chapter 20 New Search Heuristics for Max-CSP
  22. Altmetric Badge
    Chapter 21 Analysis of Random Noise and Random Walk Algorithms for Satisfiability Testing
  23. Altmetric Badge
    Chapter 22 Boosting Search with Variable Elimination
  24. Altmetric Badge
    Chapter 23 Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint
  25. Altmetric Badge
    Chapter 24 Practical Investigation of Constraints with Graph Views
  26. Altmetric Badge
    Chapter 25 A Hybrid Search Architecture Applied to Hard Random 3-SAT and Low-Autocorrelation Binary Sequences
  27. Altmetric Badge
    Chapter 26 Singleton Consistencies
  28. Altmetric Badge
    Chapter 27 Linear Formulation of Constraint Programming Models and Hybrid Solvers
  29. Altmetric Badge
    Chapter 28 A Global Constraint Combining a Sum Constraint and Difference Constraints
  30. Altmetric Badge
    Chapter 29 Efficient Querying of Periodic Spatiotemporal Objects
  31. Altmetric Badge
    Chapter 30 Arc Consistency for Soft Constraints
  32. Altmetric Badge
    Chapter 31 Optimal Anytime Constrained Simulated Annealing for Constrained Global Optimization
  33. Altmetric Badge
    Chapter 32 SAT v CSP
  34. Altmetric Badge
    Chapter 33 Instruction Scheduling with Timing Constraints on a Single RISC Processor with 0/1 Latencies
  35. Altmetric Badge
    Chapter 34 Arc Consistency on n -ary Monotonic and Linear Constraints
  36. Altmetric Badge
    Chapter 35 Some Observations on Durations, Scheduling and Allen’s Algebra
  37. Altmetric Badge
    Chapter 36 Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability
  38. Altmetric Badge
    Chapter 37 Finding Minimal Unsatisfiable Subformulae in Satisfiability Instances
  39. Altmetric Badge
    Chapter 38 Branching Constraint Satisfaction Problems for Solutions Robust under Likely Changes
  40. Altmetric Badge
    Chapter 39 Constraint Propagation: Between Abstract Models and ad hoc Strategies
  41. Altmetric Badge
    Chapter 40 How to Model and Verify Concurrent Algorithms for Distributed CSPs
  42. Altmetric Badge
    Chapter 41 The Phase Transition in Distributed Constraint Satisfaction Problems: First Results
  43. Altmetric Badge
    Chapter 42 Cooperating Constraint Solvers
  44. Altmetric Badge
    Chapter 43 An Empirical Study of Probabilistic Arc Consistency as a Variable Ordering Heuristic
  45. Altmetric Badge
    Chapter 44 On Dual Encodings for Non-binary Constraint Satisfaction Problems
  46. Altmetric Badge
    Chapter 45 Algebraic Simplification Techniques for Propositional Satisfiability
  47. Altmetric Badge
    Chapter 46 An Original Constraint Based Approach for Solving over Constrained Problems
  48. Altmetric Badge
    Chapter 47 An Efficient Approximate Algorithm for Winner Determination in Combinatorial Auctions
Attention for Chapter 18: A Constraint Programming Approach for Solving Rigid Geometric Systems
Altmetric Badge

About this Attention Score

  • Good Attention Score compared to outputs of the same age (67th percentile)
  • High Attention Score compared to outputs of the same age and source (86th percentile)

Mentioned by

twitter
1 X user
patent
1 patent

Citations

dimensions_citation
6 Dimensions

Readers on

mendeley
3 Mendeley
citeulike
1 CiteULike
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
A Constraint Programming Approach for Solving Rigid Geometric Systems
Chapter number 18
Book title
Principles and Practice of Constraint Programming – CP 2000
Published in
Lecture notes in computer science, September 2000
DOI 10.1007/3-540-45349-0_18
Book ISBNs
978-3-54-041053-9, 978-3-54-045349-9
Authors

Christophe Jermann, Gilles Trombettoni, Bertrand Neveu, Michel Rueher, Jermann, Christophe, Trombettoni, Gilles, Neveu, Bertrand, Rueher, Michel

X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 3 100%

Demographic breakdown

Readers by professional status Count As %
Professor 1 33%
Student > Ph. D. Student 1 33%
Professor > Associate Professor 1 33%
Student > Postgraduate 1 33%
Readers by discipline Count As %
Mathematics 1 33%
Business, Management and Accounting 1 33%
Computer Science 1 33%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 4. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 07 February 2015.
All research outputs
#6,949,323
of 22,787,797 outputs
Outputs from Lecture notes in computer science
#2,286
of 8,126 outputs
Outputs of similar age
#11,640
of 37,107 outputs
Outputs of similar age from Lecture notes in computer science
#2
of 15 outputs
Altmetric has tracked 22,787,797 research outputs across all sources so far. This one has received more attention than most of these and is in the 68th percentile.
So far Altmetric has tracked 8,126 research outputs from this source. They receive a mean Attention Score of 5.0. This one has gotten more attention than average, scoring higher than 70% of its peers.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 37,107 tracked outputs that were published within six weeks on either side of this one in any source. This one has gotten more attention than average, scoring higher than 67% of its contemporaries.
We're also able to compare this research output to 15 others from the same source and published within six weeks on either side of this one. This one has done well, scoring higher than 86% of its contemporaries.