On the public citation graph
Towards a Semantics of Unsatisfiability Proofs with Inprocessing
0 signed · 50 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11499107_5openalex-snapshot
Effective Preprocessing in SAT Through Variable and Clause Elimination
inferredcites →https://doi.org/10.1007/11527695_22openalex-snapshot
NiVER: Non-increasing Variable Elimination Resolution for Preprocessing SAT Instances
inferredcites →https://doi.org/10.1007/978-3-319-09284-3_22openalex-snapshot
Detecting Cardinality Constraints in CNF
inferredcites →https://doi.org/10.1007/978-3-319-09284-3_31openalex-snapshot
DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
inferredcites →https://doi.org/10.1007/978-3-319-11206-0_12openalex-snapshot
Formula Simplifications as DRAT Derivations
inferredcites →https://doi.org/10.1007/978-3-319-21401-6_40openalex-snapshot
Expressing Symmetry Breaking in DRAT Proofs
inferredcites →https://doi.org/10.1007/978-3-319-24246-0_7openalex-snapshot
An Expressive Model for Instance Decomposition Based Parallel SAT Solvers
inferredcites →https://doi.org/10.1007/978-3-319-40970-2_15openalex-snapshot
Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
inferredcites →https://doi.org/10.1007/978-3-319-40970-2_36openalex-snapshot
SpyBug: Automated Bug Detection in the Configuration Space of SAT Solvers
inferredcites →https://doi.org/10.1007/978-3-319-48758-8_27openalex-snapshot
DRAT Proofs for XOR Reasoning
inferredcites →https://doi.org/10.1007/978-3-319-63046-5_14openalex-snapshot
Efficient Certified RAT Verification
inferredcites →https://doi.org/10.1007/978-3-322-84809-3openalex-snapshot
Aussagenlogik: Deduktion und Algorithmen
inferredcites →https://doi.org/10.1007/978-3-642-02777-2_24openalex-snapshot
Extending SAT Solvers to Cryptographic Problems
inferredcites →https://doi.org/10.1007/978-3-642-12002-2_10openalex-snapshot
Blocked Clause Elimination
inferredcites →https://doi.org/10.1007/978-3-642-16242-8_26openalex-snapshot
Clause Elimination Procedures for CNF Formulas
inferredcites →https://doi.org/10.1007/978-3-642-21581-0_16openalex-snapshot
On Freezing and Reactivating Learnt Clauses
inferredcites →https://doi.org/10.1007/978-3-642-33558-7_28openalex-snapshot
Classifying and Propagating Parity Constraints
inferredcites →https://doi.org/10.1007/978-3-642-39071-5_4openalex-snapshot
Soundness of Inprocessing in Clause Sharing SAT Solvers
inferredcites →https://doi.org/10.1007/978-3-642-39611-3_14openalex-snapshot
Automated Reencoding of Boolean Formulas
inferredcites →https://doi.org/10.1007/978-3-642-39634-2_18openalex-snapshot
Mechanical Verification of SAT Refutations with Extended Resolution
inferredcites →https://doi.org/10.1007/978-3-662-54577-5_7openalex-snapshot
Efficient Certified Resolution Proof Checking
inferredcites →https://doi.org/10.1016/0304-3975(85)90144-6openalex-snapshot
The intractability of resolution
inferredcites →https://doi.org/10.1016/s0166-218x(99)00037-2openalex-snapshot
On a generalization of extended resolution
inferredcites →https://doi.org/10.1016/s0166-218x(99)00039-6openalex-snapshot
The symmetry rule in propositional logic
inferredcites →https://doi.org/10.1016/s0747-7171(86)80028-1openalex-snapshot
A Structure-preserving Clause Form Translation
inferredcites →https://doi.org/10.1017/cbo9780511529948openalex-snapshot
Bounded Arithmetic, Propositional Logic and Complexity Theory
inferredcites →https://doi.org/10.1109/12.769433openalex-snapshot
GRASP: a search algorithm for propositional satisfiability
inferredcites →https://doi.org/10.1109/dac.2002.1012719openalex-snapshot
Solving difficult SAT instances in the presence of symmetry
inferredcites →https://doi.org/10.1109/date.2003.1253718openalex-snapshot
Verification of proofs of unsatisfiability for CNF formulas
inferredcites →https://doi.org/10.1109/fmcad.2013.6679408openalex-snapshot
Trimming while checking clausal proofs
inferredcites →https://doi.org/10.1145/1670412.1670413openalex-snapshot
Fuzzing and delta-debugging SMT solvers
inferredcites →https://doi.org/10.1145/513918.514102openalex-snapshot
Solving difficult SAT instances in the presence of symmetry
inferredcites →https://doi.org/10.1613/jair.1410openalex-snapshot
Towards Understanding and Harnessing the Potential of Clause Learning
inferredcites →https://doi.org/10.1613/jair.4694openalex-snapshot
Clause Elimination for SAT and QSAT
inferredcites →https://doi.org/10.29007/6vwgopenalex-snapshot
Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers
inferredcites →https://doi.org/10.29007/8w4vopenalex-snapshot
Checking Unsatisfiability Proofs in Parallel
inferredcites →https://doi.org/10.29007/g7ssopenalex-snapshot
Enhanced Gaussian Elimination in DPLL-based SAT Solvers
inferredcites →https://doi.org/10.4230/lipics.cp.2024.37openalex-snapshot
Computing Small Rainbow Cycle Numbers with SAT Modulo Symmetries (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-319-94205-6_34openalex-snapshot
Extended Resolution Simulates DRAT
inferred← citeshttps://doi.org/10.1007/s10009-017-0459-0openalex-snapshot
Greedy pebbling for proof space compression
inferred← citeshttps://doi.org/10.1007/s10817-018-9490-4openalex-snapshot
Formally Verifying the Solution to the Boolean Pythagorean Triples Problem
inferred← citeshttps://doi.org/10.1007/s10817-020-09554-zopenalex-snapshot
Simulating Strong Practical Proof Systems with Extended Resolution
inferred← citeshttps://doi.org/10.1145/3372885.3373821openalex-snapshot
Frying the egg, roasting the chicken: unit deletions in DRAT proofs
inferred← citeshttps://doi.org/10.23919/fmcad.2018.8602993openalex-snapshot
Complete and Efficient DRAT Proof Checking
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25cebopenalex-snapshot
Generating Extended Resolution Proofs with a BDD-Based SAT Solver
inferred← citeshttps://doi.org/10.29007/tc7qopenalex-snapshot
A Theory of Satisfiability-Preserving Proofs in SAT Solving
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.