↓ Skip to main content

Principles and Practice of Constraint Programming

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Dashed Strings and the Replace(-all) Constraint
  3. Altmetric Badge
    Chapter 2 Combinatorial Search in CP-Based Iterated Belief Propagation
  4. Altmetric Badge
    Chapter 3 Replication-Guided Enumeration of Minimal Unsatisfiable Subsets
  5. Altmetric Badge
    Chapter 4 Solving Satisfaction Problems Using Large-Neighbourhood Search
  6. Altmetric Badge
    Chapter 5 Quantum-Accelerated Global Constraint Filtering
  7. Altmetric Badge
    Chapter 6 Pure MaxSAT and Its Applications to Combinatorial Optimization via Linear Local Search
  8. Altmetric Badge
    Chapter 7 Tractable Fragments of Temporal Sequences of Topological Information
  9. Altmetric Badge
    Chapter 8 Strengthening Neighbourhood Substitution
  10. Altmetric Badge
    Chapter 9 Effective Encodings of Constraint Programming Models to SMT
  11. Altmetric Badge
    Chapter 10 Watched Propagation of $$0$$-$$1$$ Integer Linear Constraints
  12. Altmetric Badge
    Chapter 11 Bounding Linear Programs by Constraint Propagation: Application to Max-SAT
  13. Altmetric Badge
    Chapter 12 On Relation Between Constraint Propagation and Block-Coordinate Descent in Linear Programs
  14. Altmetric Badge
    Chapter 13 DPMC: Weighted Model Counting by Dynamic Programming on Project-Join Trees
  15. Altmetric Badge
    Chapter 14 Aggregation and Garbage Collection for Online Optimization
  16. Altmetric Badge
    Chapter 15 Treewidth-Aware Quantifier Elimination and Expansion for QCSP
  17. Altmetric Badge
    Chapter 16 A Time Leap Challenge for SAT-Solving
  18. Altmetric Badge
    Chapter 17 Breaking Symmetries with RootClique and LexTopSort
  19. Altmetric Badge
    Chapter 18 Towards Faster Reasoners by Using Transparent Huge Pages
  20. Altmetric Badge
    Chapter 19 The Argmax Constraint
  21. Altmetric Badge
    Chapter 20 Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems
  22. Altmetric Badge
    Chapter 21 Phase Transition Behavior in Knowledge Compilation
  23. Altmetric Badge
    Chapter 22 A Faster Exact Algorithm to Count X3SAT Solutions
  24. Altmetric Badge
    Chapter 23 Visualizations to Summarize Search Behavior
  25. Altmetric Badge
    Chapter 24 Parallelization of TSP Solving in CP
  26. Altmetric Badge
    Chapter 25 Using Resolution Proofs to Analyse CDCL Solvers
  27. Altmetric Badge
    Chapter 26 Core-Guided Model Reformulation
  28. Altmetric Badge
    Chapter 27 Filtering Rules for Flow Time Minimization in a Parallel Machine Scheduling Problem
  29. Altmetric Badge
    Chapter 28 MaxSAT-Based Postprocessing for Treedepth
  30. Altmetric Badge
    Chapter 29 Perturbing Branching Heuristics in Constraint Solving
  31. Altmetric Badge
    Chapter 30 Finding the Hardest Formulas for Resolution
  32. Altmetric Badge
    Chapter 31 HADDOCK: A Language and Architecture for Decision Diagram Compilation
  33. Altmetric Badge
    Chapter 32 Towards a Generic Interval Solver for Differential-Algebraic CSP
  34. Altmetric Badge
    Chapter 33 abstractXOR: A global constraint dedicated to differential cryptanalysis
  35. Altmetric Badge
    Chapter 34 In Pursuit of an Efficient SAT Encoding for the Hamiltonian Cycle Problem
  36. Altmetric Badge
    Chapter 35 Large Neighborhood Search for Temperature Control with Demand Response
  37. Altmetric Badge
    Chapter 36 Solving the Group Cumulative Scheduling Problem with CPO and ACO
  38. Altmetric Badge
    Chapter 37 A Branch-and-bound Algorithm to Rigorously Enclose the Round-Off Errors
  39. Altmetric Badge
    Chapter 38 Leveraging Reinforcement Learning, Constraint Programming and Local Search: A Case Study in Car Manufacturing
  40. Altmetric Badge
    Chapter 39 Computing the Local Aromaticity of Benzenoids Thanks to Constraint Programming
  41. Altmetric Badge
    Chapter 40 Using Constraint Programming to Generate Benzenoid Structures in Theoretical Chemistry
  42. Altmetric Badge
    Chapter 41 RobTest: A CP Approach to Generate Maximal Test Trajectories for Industrial Robots
  43. Altmetric Badge
    Chapter 42 A Two-Phase Constraint Programming Model for Examination Timetabling at University College Cork
  44. Altmetric Badge
    Chapter 43 Exact Approaches to the Multi-agent Collective Construction Problem
  45. Altmetric Badge
    Chapter 44 The Confidence Constraint: A Step Towards Stochastic CP Solvers
  46. Altmetric Badge
    Chapter 45 Parity (XOR) Reasoning for the Index Calculus Attack
  47. Altmetric Badge
    Chapter 46 Constraint-Based Software Diversification for Efficient Mitigation of Code-Reuse Attacks
  48. Altmetric Badge
    Chapter 47 Pushing Data into CP Models Using Graphical Model Learning and Solving
  49. Altmetric Badge
    Chapter 48 Generating Random Logic Programs Using Constraint Programming
  50. Altmetric Badge
    Chapter 49 Towards Formal Fairness in Machine Learning
  51. Altmetric Badge
    Chapter 50 Verifying Equivalence Properties of Neural Networks with ReLU Activation Functions
  52. Altmetric Badge
    Chapter 51 Learning the Satisfiability of Pseudo-Boolean Problem with Graph Neural Networks
  53. Altmetric Badge
    Chapter 52 A Machine Learning Based Splitting Heuristic for Divide-and-Conquer Solvers
  54. Altmetric Badge
    Chapter 53 Theoretical and Experimental Results for Planning with Learned Binarized Neural Network Transition Models
  55. Altmetric Badge
    Chapter 54 Omissions in Constraint Acquisition
  56. Altmetric Badge
    Chapter 55 Computing Optimal Decision Sets with SAT
Attention for Chapter 16: A Time Leap Challenge for SAT-Solving
Altmetric Badge

About this Attention Score

  • In the top 5% of all research outputs scored by Altmetric
  • Among the highest-scoring outputs from this source (#30 of 8,174)
  • High Attention Score compared to outputs of the same age (97th percentile)
  • High Attention Score compared to outputs of the same age and source (91st percentile)

Mentioned by

twitter
172 X users

Citations

dimensions_citation
3 Dimensions

Readers on

mendeley
13 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
A Time Leap Challenge for SAT-Solving
Chapter number 16
Book title
Principles and Practice of Constraint Programming
Published in
Lecture notes in computer science, September 2020
DOI 10.1007/978-3-030-58475-7_16
Book ISBNs
978-3-03-058474-0, 978-3-03-058475-7
Authors

Johannes K. Fichte, Markus Hecher, Stefan Szeider, Fichte, Johannes K., Hecher, Markus, Szeider, Stefan

X Demographics

X Demographics

The data shown below were collected from the profiles of 172 X users 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 13 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 13 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 2 15%
Researcher 2 15%
Student > Master 2 15%
Student > Bachelor 1 8%
Other 1 8%
Other 2 15%
Unknown 3 23%
Readers by discipline Count As %
Computer Science 7 54%
Engineering 2 15%
Physics and Astronomy 1 8%
Unknown 3 23%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 127. 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 03 November 2022.
All research outputs
#336,207
of 25,872,466 outputs
Outputs from Lecture notes in computer science
#30
of 8,174 outputs
Outputs of similar age
#10,173
of 427,467 outputs
Outputs of similar age from Lecture notes in computer science
#1
of 12 outputs
Altmetric has tracked 25,872,466 research outputs across all sources so far. Compared to these this one has done particularly well and is in the 98th percentile: it's in the top 5% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 8,174 research outputs from this source. They typically receive a little more attention than average, with a mean Attention Score of 5.3. This one has done particularly well, scoring higher than 99% 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 427,467 tracked outputs that were published within six weeks on either side of this one in any source. This one has done particularly well, scoring higher than 97% of its contemporaries.
We're also able to compare this research output to 12 others from the same source and published within six weeks on either side of this one. This one has done particularly well, scoring higher than 91% of its contemporaries.