On the public citation graph

Extending Existential Quantification in Conjunctions of BDDs

https://doi.org/10.3233/sat190004
0 signed · 25 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.1002/j.1538-7305.1959.tb01585.xopenalex-snapshot
Representation of Switching Circuits by Binary-Decision Programs
inferredcites →https://doi.org/10.1007/11527695_19openalex-snapshot
Search vs. Symbolic Techniques in Satisfiability Solving
inferredcites →https://doi.org/10.1007/3-540-45578-7_9openalex-snapshot
Random 3-SAT and BDDs: The Plot Thickens Further
inferredcites →https://doi.org/10.1007/3-540-56992-8_22openalex-snapshot
Solving 3-satisfiability in less than 1, 579n steps
inferredcites →https://doi.org/10.1007/978-3-540-24605-3_30openalex-snapshot
SBSAT: a State-Based, BDD-Based Satisfiability Solver
inferredcites →https://doi.org/10.1007/bf00121264openalex-snapshot
Hiding propositional constants in BDDs
inferredcites →https://doi.org/10.1016/0166-218x(85)90050-2openalex-snapshot
Solving satisfiability in less than 2n steps
inferredcites →https://doi.org/10.1109/tc.1978.1675141openalex-snapshot
Binary Decision Diagrams
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1145/123186.123222openalex-snapshot
Efficient implementation of a BDD package
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
inferredcites →https://doi.org/10.1145/513918.514101openalex-snapshot
A proof engine approach to solving combinational design automation problems
inferredcites →https://doi.org/10.1145/514100.514101openalex-snapshot
A proof engine approach to solving combinational design automation problems
inferredcites →https://doi.org/10.3217/jucs-010-12-1655openalex-snapshot
Function-Complete Lookahead in Support of Efficient SAT Search Heuristics

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11499107_11openalex-snapshot
Resolution Tunnels for Improved SAT Solver Performance
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_31openalex-snapshot
Algorithms for the Satisfiability Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-63046-5_9openalex-snapshot
Short Proofs Without New Variables
inferred← citeshttps://doi.org/10.1007/978-3-642-22110-1_17openalex-snapshot
Existential Quantification as Incremental SAT
inferred← citeshttps://doi.org/10.1007/s10817-019-09516-0openalex-snapshot
Strong Extension-Free Proof Systems
inferred← citeshttps://doi.org/10.1109/models-c.2019.00077openalex-snapshot
Towards Reasoning About Product Lines with Design Choices
inferred← citeshttps://doi.org/10.1109/models.2017.3openalex-snapshot
Software Product Lines with Design Choices: Reasoning about Variability and Design Uncertainty
inferred← citeshttps://doi.org/10.1145/1837274.1837334openalex-snapshot
Towards scalable system-level reliability analysis
inferred← citeshttps://doi.org/10.1145/3595295openalex-snapshot
Generating Extended Resolution Proofs with a BDD-Based SAT Solver
inferred← citeshttps://doi.org/10.23919/jsee.2024.000066openalex-snapshot
A General Boolean Semantic Modelling Approach for Complex and Intelligent Industrial Systems in the Framework of DES
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25cebopenalex-snapshot
Generating Extended Resolution Proofs with a BDD-Based SAT Solver
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.