On the public citation graph

The Silent (R)evolution of SAT

0 signed · 55 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11564751_73openalex-snapshot
Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
inferredcites →https://doi.org/10.1007/978-3-030-30048-7_29openalex-snapshot
An Improved GPU-Based SAT Model Counter
inferredcites →https://doi.org/10.1007/978-3-030-58475-7_16openalex-snapshot
A Time Leap Challenge for SAT-Solving
inferredcites →https://doi.org/10.1007/978-3-319-94144-8_26openalex-snapshot
PySAT: A Python Toolkit for Prototyping with SAT Oracles
inferredcites →https://doi.org/10.1007/978-3-642-33558-7_67openalex-snapshot
Reasoning over Biological Networks Using Maximum Satisfiability
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_28openalex-snapshot
On the Complexity of Derivation in Propositional Calculus
inferredcites →https://doi.org/10.1016/j.artint.2010.10.002openalex-snapshot
On the power of clause-learning SAT solvers as resolution engines
inferredcites →https://doi.org/10.1016/j.jss.2012.02.018openalex-snapshot
Dependency solving: A separate concern in component evolution management
inferredcites →https://doi.org/10.1016/s0004-3702(99)00048-xopenalex-snapshot
Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
inferredcites →https://doi.org/10.1017/9781108637435openalex-snapshot
Beyond the Worst-Case Analysis of Algorithms
inferredcites →https://doi.org/10.1090/dimacs/035/01openalex-snapshot
Finding hard instances of the satisfiability problem: A survey
inferredcites →https://doi.org/10.1109/12.769433openalex-snapshot
GRASP: a search algorithm for propositional satisfiability
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1145/1536616.1536637openalex-snapshot
Boolean satisfiability from theoretical hardness to practical success
inferredcites →https://doi.org/10.1145/2578043openalex-snapshot
Boolean satisfiability
inferredcites →https://doi.org/10.1145/3107239openalex-snapshot
The science of brute force
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/3375395.3389131openalex-snapshot
Three Modern Roles for Logic in AI
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.13182/nse70-a19705openalex-snapshot
The Art of Computer Programming
inferredcites →https://doi.org/10.1609/aimag.v33i1.2395openalex-snapshot
The International SAT Solver Competitions
inferredcites →https://doi.org/10.1609/aimag.v35i2.2539openalex-snapshot
The MiniZinc Challenge 2008–2013
inferredcites →https://doi.org/10.1613/jair.1.11529openalex-snapshot
Dependency Learning for QBF
inferredcites →https://doi.org/10.1613/jair.3152openalex-snapshot
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
inferredcites →https://doi.org/10.1613/jair.989openalex-snapshot
A Knowledge Compilation Map
inferredcites →https://doi.org/10.24963/ijcai.2021/608openalex-snapshot
Reasoning-Based Learning of Interpretable ML Models
inferredcites →https://doi.org/10.3233/faia336openalex-snapshot
Handbook of Satisfiability
inferredcites →https://doi.org/10.4230/lipics.cp.2021.7openalex-snapshot
Towards Better Heuristics for Solving Bounded Model Checking Problems (Short Paper)
inferredcites →https://doi.org/10.4230/lipics.cp.2021.8openalex-snapshot
Integrating Tree Decompositions into Decision Heuristics of Propositional Model Counters (Short Paper)

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-032-17163-4_5openalex-snapshot
Configuration Technologies
inferred← citeshttps://doi.org/10.1007/978-3-032-22752-2_18openalex-snapshot
Real-time Proof Checking for Distributed Incremental SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-032-30612-8_13openalex-snapshot
The Strange Case of XOR-CNF Formulas: SAT Obfuscation and More
inferred← citeshttps://doi.org/10.1007/978-3-032-32589-1_8openalex-snapshot
Formally Verified Graph Generation with SAT Modulo Symmetries and Lean
inferred← citeshttps://doi.org/10.1007/s10878-026-01471-yopenalex-snapshot
Compact SAT encoding for power peak minimization in assembly line balancing
inferred← citeshttps://doi.org/10.1007/s11623-023-1804-yopenalex-snapshot
Lazily-Verifiable SAT Proof Checker in SPARK 2014
inferred← citeshttps://doi.org/10.1016/j.cosrev.2025.100868openalex-snapshot
Backdoors to satisfaction continued
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103520openalex-snapshot
SAT backdoors: Depth beats size
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103547openalex-snapshot
Backdoor DNFs
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.116020openalex-snapshot
A fast algorithm for maximum satisfiability above half number of clauses
inferred← citeshttps://doi.org/10.1073/pnas.2517297122openalex-snapshot
Advancing stochastic 3-SAT solvers by dissipating oversatisfied constraints
inferred← citeshttps://doi.org/10.1080/00207543.2025.2561190openalex-snapshot
Self-reconfiguration of manufacturing systems using Satisfiability Modulo Theory
inferred← citeshttps://doi.org/10.1103/mvrj-b33topenalex-snapshot
Defect positioning in combinatorial metamaterials
inferred← citeshttps://doi.org/10.1103/yfwq-yqmkopenalex-snapshot
Analyzing the Quantum Approximate Optimization Algorithm: Ansätze, Symmetries, and Lie Algebras
inferred← citeshttps://doi.org/10.1145/3603112openalex-snapshot
SAT-boosted Tabu Search for Coloring Massive Graphs
inferred← citeshttps://doi.org/10.1145/3635117openalex-snapshot
New Spectral Algorithms for Refuting Smoothed k-SAT
inferred← citeshttps://doi.org/10.1145/3655024openalex-snapshot
Strong Backdoors for Default Logic
inferred← citeshttps://doi.org/10.1145/3769869openalex-snapshot
Computing and Certifying Twin-Width Using Logic
inferred← citeshttps://doi.org/10.1145/3784987.3784998openalex-snapshot
Verified SAT Redundancy Checking in SPARK
inferred← citeshttps://doi.org/10.1145/3795095.3805177openalex-snapshot
On the Sufficiency of SAT Features for Genetic Algorithm Parameter Selection
inferred← citeshttps://doi.org/10.1515/itit-2024-0096openalex-snapshot
On the dissertation “Scalable SAT Solving and its Application”
inferred← citeshttps://doi.org/10.2139/ssrn.6989775openalex-snapshot
Sequent Calculus Proof Search with Reinforcement Learning
inferred← citeshttps://doi.org/10.2197/ipsjjip.33.990openalex-snapshot
Folding One Polyhedral Metric Graph into Another
inferred← citeshttps://doi.org/10.37394/23202.2026.25.49openalex-snapshot
Enduring Strengths of Knowledge-Based Methods in the Era of Machine Learning and Large Language Models: A Task-and-Architecture Perspective
inferred← citeshttps://doi.org/10.55056/ceur-ws.org/vol-4068/paper6openalex-snapshot
Attack Models for Industrial Control System Elements Based on a Graph Approach and Countermeasures
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.