On the public citation graph

Boolean satisfiability

0 signed · 36 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 points at this work

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

inferred← citeshttps://doi.org/10.1002/cav.1688openalex-snapshot
Multi‐group motion planning in virtual environments
inferred← citeshttps://doi.org/10.1002/rsa.21168openalex-snapshot
The impact of heterogeneity and geometry on the proof complexity of random satisfiability
inferred← citeshttps://doi.org/10.1007/978-1-4939-6613-4_20openalex-snapshot
Parameterized Algorithmics for Finding Exact Solutions of NP-Hard Biological Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-04618-7_23openalex-snapshot
A New Algorithm Design Technique for Hard Problems, Building on Methods of Complexity Theory
inferred← citeshttps://doi.org/10.1007/978-3-030-24258-9_2openalex-snapshot
Short Proofs in QBF Expansion
inferred← citeshttps://doi.org/10.1007/978-3-030-26807-7_1openalex-snapshot
Chemical Reaction Networks and Stochastic Local Search
inferred← citeshttps://doi.org/10.1007/978-3-030-51825-7_28openalex-snapshot
Strong (D)QBF Dependency Schemes via Tautology-Free Resolution Paths
inferred← citeshttps://doi.org/10.1007/978-3-031-31414-8_2openalex-snapshot
Logic-Based Explainability in Machine Learning
inferred← citeshttps://doi.org/10.1007/978-3-319-24318-4_17openalex-snapshot
Community Structure Inspired Algorithms for SAT and #SAT
inferred← citeshttps://doi.org/10.1007/978-3-319-25007-6_19openalex-snapshot
R$$_2$$O$$_2$$: An Efficient Ranking-Based Reasoner for OWL Ontologies
inferred← citeshttps://doi.org/10.1007/s00339-022-06365-4openalex-snapshot
Unconventional computing based on magnetic tunnel junction
inferred← citeshttps://doi.org/10.1007/s10817-018-9482-4openalex-snapshot
Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF
inferred← citeshttps://doi.org/10.1007/s10817-020-09560-1openalex-snapshot
Building Strategies into QBF Proofs
inferred← citeshttps://doi.org/10.1007/s10817-025-09745-6openalex-snapshot
Runtime vs. Extracted Proof Size: An Exponential Gap for CDCL on QBFs
inferred← citeshttps://doi.org/10.1016/j.artint.2021.103460openalex-snapshot
New width parameters for SAT and #SAT
inferred← citeshttps://doi.org/10.1016/j.is.2019.07.002openalex-snapshot
Understanding and improving ontology reasoning efficiency through learning and ranking
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103547openalex-snapshot
Backdoor DNFs
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.03.012openalex-snapshot
A new algorithm design technique for hard problems
inferred← citeshttps://doi.org/10.1109/cig.2014.6932882openalex-snapshot
Solving Physical Traveling Salesman Problems with policy adaptation
inferred← citeshttps://doi.org/10.1109/formalise.2015.8openalex-snapshot
On the Heroism of Really Pursuing Formal Methods
inferred← citeshttps://doi.org/10.1109/iccad45719.2019.8942096openalex-snapshot
Unlocking the Power of Formal Hardware Verification with CoSA and Symbolic QED: Invited Paper
inferred← citeshttps://doi.org/10.1137/1.9781611976465.4openalex-snapshot
The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability
inferred← citeshttps://doi.org/10.1145/2668064.2668090openalex-snapshot
Motion planning with rigid-body dynamics for generalized traveling salesman tours
inferred← citeshttps://doi.org/10.1145/2668084.2668090openalex-snapshot
Motion planning with rigid-body dynamics for generalized traveling salesman tours
inferred← citeshttps://doi.org/10.1145/2699878openalex-snapshot
Degree Reduction in Labeled Graph Retrieval
inferred← citeshttps://doi.org/10.1145/2902251.2902305openalex-snapshot
A Theory of Regular Queries
inferred← citeshttps://doi.org/10.1145/3373718.3394793openalex-snapshot
Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution
inferred← citeshttps://doi.org/10.1145/3500921openalex-snapshot
When satisfiability solving meets symbolic computation
inferred← citeshttps://doi.org/10.1145/3560469openalex-snapshot
The Silent (R)evolution of SAT
inferred← citeshttps://doi.org/10.1145/3565286openalex-snapshot
Hardness Characterisations and Size-width Lower Bounds for QBF Resolution
inferred← citeshttps://doi.org/10.1145/3603112openalex-snapshot
SAT-boosted Tabu Search for Coloring Massive Graphs
inferred← citeshttps://doi.org/10.1145/3689345openalex-snapshot
Strong (D)QBF Dependency Schemes via Implication-free Resolution Paths
inferred← citeshttps://doi.org/10.3233/sat-231507openalex-snapshot
Proof Complexity of Propositional Model Counting
inferred← citeshttps://doi.org/10.3390/a12090188openalex-snapshot
A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy
inferred← citeshttps://doi.org/10.5555/2820126.2820128openalex-snapshot
On the heroism of really pursuing formal methods: title inspired by Dijkstra's "On the Cruelty of Really Teaching Computing Science"
inferred← citeshttps://doi.org/10.70675/9574fbc5zea00z4774zbd87zee73ba8839a2openalex-snapshot
Logique de requêtes à la XPath : systèmes de preuve et pertinence pratique
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.