On the public citation graph

Cost-Effective Hyper-Resolution for Preprocessing CNF Formulas

0 signed · 27 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/11499107_34openalex-snapshot
Cost-Effective Hyper-Resolution for Preprocessing CNF Formulas
inferredcites →https://doi.org/10.1007/11527695_25openalex-snapshot
Fifty-Five Solvers in Vancouver: The SAT 2004 Competition
inferredcites →https://doi.org/10.1007/978-3-540-24605-3_26openalex-snapshot
Effective Preprocessing with Hyper-Resolution and Equality Reduction
inferredcites →https://doi.org/10.1007/s10472-004-9424-1openalex-snapshot
The SAT2002 Competition
inferredcites →https://doi.org/10.1090/dimacs/026/27openalex-snapshot
Satisfiability testing with more reasoning and less guessing
inferredcites →https://doi.org/10.1109/tsmcb.2002.805807openalex-snapshot
A Simplifier for Propositional Formulas With Many Binary Clauses
inferredcites →https://doi.org/10.1145/378239.379017openalex-snapshot
Chaff

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11513988_32openalex-snapshot
Yet Another Decision Procedure for Equality Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-09284-3_7openalex-snapshot
Conditional Lower Bounds for Failed Literals and Related Techniques
inferred← citeshttps://doi.org/10.1007/978-3-319-24318-4_13openalex-snapshot
Preprocessing for DQBF
inferred← citeshttps://doi.org/10.1007/978-3-642-12002-2_10openalex-snapshot
Blocked Clause Elimination
inferred← citeshttps://doi.org/10.1007/978-3-642-14186-7_30openalex-snapshot
Reconstructing Solutions after Blocked Clause Elimination
inferred← citeshttps://doi.org/10.1007/978-3-642-16242-8_26openalex-snapshot
Clause Elimination Procedures for CNF Formulas
inferred← citeshttps://doi.org/10.1007/978-3-642-21581-0_17openalex-snapshot
Efficient CNF Simplification Based on Binary Implication Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-31365-3_28openalex-snapshot
Inprocessing Rules
inferred← citeshttps://doi.org/10.1007/978-3-642-31612-8_24openalex-snapshot
Interpolant Strength Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-36742-7_8openalex-snapshot
Formula Preprocessing in MUS Extraction
inferred← citeshttps://doi.org/10.1007/978-3-642-38171-3_6openalex-snapshot
Revisiting Hyper Binary Resolution
inferred← citeshttps://doi.org/10.1007/s10817-007-9074-1openalex-snapshot
Visualizing SAT Instances and Runs of the DPLL Algorithm
inferred← citeshttps://doi.org/10.1007/s10817-011-9239-9openalex-snapshot
Simulating Circuit-Level Simplifications on CNF
inferred← citeshttps://doi.org/10.1007/s10817-016-9364-6openalex-snapshot
Labelled Interpolation Systems for Hyper-Resolution, Clausal, and Local Proofs
inferred← citeshttps://doi.org/10.1007/s42514-023-00141-3openalex-snapshot
XHYPRE: a reliable parallel numerical algorithm library for solving large-scale sparse linear equations
inferred← citeshttps://doi.org/10.1080/09528130701475617openalex-snapshot
Weighting strategy for non-clausal resolution
inferred← citeshttps://doi.org/10.1613/jair.4694openalex-snapshot
Clause Elimination for SAT and QSAT
inferred← citeshttps://doi.org/10.3233/sat190013openalex-snapshot
Preface to the Special Volume on the SAT 2005 Competitions and Evaluations
inferred← citeshttps://doi.org/10.3233/sat190115openalex-snapshot
The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1
showing the first 19 of 20 · page through all 20
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.