On the public citation graph
Using DPLL for Efficient OBDD Construction
0 signed · 60 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/3-540-44676-1_32openalex-snapshot
A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth
inferredcites →https://doi.org/10.1007/978-3-540-39724-3_32openalex-snapshot
The ROBDD Size of Simple CNF Formulas
inferredcites →https://doi.org/10.1016/0020-0190(92)90234-mopenalex-snapshot
The vertex separation number of a graph equals its path-width
inferredcites →https://doi.org/10.1016/0095-8956(83)90079-5openalex-snapshot
Graph minors. I. Excluding a forest
inferredcites →https://doi.org/10.1109/hldvt.2001.972824openalex-snapshot
Using cutwidth to improve symbolic simulation and Boolean satisfiability
inferredcites →https://doi.org/10.1109/iccad.2001.968669openalex-snapshot
Faster SAT and smaller BDDs via common function structure
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
inferredcites →https://doi.org/10.1145/774572.774637openalex-snapshot
Conflict driven learning in a quantified Boolean Satisfiability solver
inferredcites →https://doi.org/10.1613/jair.601openalex-snapshot
The Good Old Davis-Putnam Procedure Helps Counting Models
inferredcites →https://doi.org/10.5555/603095.603187openalex-snapshot
Faster SAT and smaller BDDs via common function structure
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11591191_34openalex-snapshot
Treewidth in Verification: Local vs. Global
inferred← citeshttps://doi.org/10.1007/978-3-030-58475-7_21openalex-snapshot
Phase Transition Behavior in Knowledge Compilation
inferred← citeshttps://doi.org/10.1007/978-3-031-75778-5_12openalex-snapshot
Compiling Binary Decision Diagrams with Interrupt-Based Downsizing
inferred← citeshttps://doi.org/10.1007/978-3-319-15612-5_28openalex-snapshot
Superset Generation on Decision Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-540-30210-0_7openalex-snapshot
A Decision Procedure for Equality Logic with Uninterpreted Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-87993-0_26openalex-snapshot
Using OBDDs for Efficient Query Evaluation on Probabilistic Databases
inferred← citeshttps://doi.org/10.1007/978-3-642-39091-3_11openalex-snapshot
Compiling Probabilistic Graphical Models Using Sentential Decision Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-642-40627-0_33openalex-snapshot
Solving QBF with Free Variables
inferred← citeshttps://doi.org/10.1007/s00224-014-9553-9openalex-snapshot
Estimating the Volume of Solution Space for Satisfiability Modulo Linear Real Arithmetic
inferred← citeshttps://doi.org/10.1007/s10817-016-9370-8openalex-snapshot
On Preprocessing Techniques and Their Impact on Propositional Model Counting
inferred← citeshttps://doi.org/10.1016/j.artint.2025.104346openalex-snapshot
Disjoint projected enumeration for SAT and SMT without blocking clauses
inferred← citeshttps://doi.org/10.1109/ddecs.2018.00028openalex-snapshot
Augmenting All Solution SAT Solving for Circuits with Structural Information
inferred← citeshttps://doi.org/10.1109/ictai.2004.115openalex-snapshot
Toward good elimination orders for symbolic SAT solving
inferred← citeshttps://doi.org/10.1109/tr.2020.3014012openalex-snapshot
SATMCS: An Efficient SAT-Based Algorithm and Its Improvements for Computing Minimal Cut Sets
inferred← citeshttps://doi.org/10.1145/1739041.1739082openalex-snapshot
Bridging the gap between intensional and extensional query evaluation in probabilistic databases
inferred← citeshttps://doi.org/10.1145/2274576.2274603openalex-snapshot
On the tractability of query compilation and bounded treewidth
inferred← citeshttps://doi.org/10.1145/2695664.2695941openalex-snapshot
BDD construction for all solutions SAT and efficient caching mechanism
inferred← citeshttps://doi.org/10.1145/2975585openalex-snapshot
Implementing Efficient All Solutions SAT Solvers
inferred← citeshttps://doi.org/10.1145/317825.317964openalex-snapshot
Symbolic manipulation of Boolean functions using a graphical representation
inferred← citeshttps://doi.org/10.1145/3377024.3377025openalex-snapshot
Evaluating #SAT solvers on industrial feature models
inferred← citeshttps://doi.org/10.1145/3646548.3676538openalex-snapshot
Configuring BDD Compilation Techniques for Feature Models
inferred← citeshttps://doi.org/10.1145/3744915.3748473openalex-snapshot
Exploring the Computational Complexity of Uniform Random Sampling and SAT Counting with Phase Transitions
inferred← citeshttps://doi.org/10.14778/2350229.2350236openalex-snapshot
Probabilistic databases with MarkoViews
inferred← citeshttps://doi.org/10.1609/aaai.v26i1.8221openalex-snapshot
Basing Decisions on Sentences in Decision Diagrams
inferred← citeshttps://doi.org/10.1609/aaai.v27i1.8690openalex-snapshot
Dynamic Minimization of Sentential Decision Diagrams
inferred← citeshttps://doi.org/10.1609/aaai.v36i5.20496openalex-snapshot
Lower Bounds on Intermediate Results in Bottom-Up Knowledge Compilation
inferred← citeshttps://doi.org/10.1609/aaai.v37i4.25517openalex-snapshot
Fast Converging Anytime Model Counting
inferred← citeshttps://doi.org/10.1609/aaai.v38i8.28652openalex-snapshot
Disjoint Partial Enumeration without Blocking Clauses
inferred← citeshttps://doi.org/10.1613/jair.1.11201openalex-snapshot
An Exhaustive DPLL Algorithm for Model Counting
inferred← citeshttps://doi.org/10.1613/jair.1.16870openalex-snapshot
On CNF Conversion for SAT and SMT Enumeration
inferred← citeshttps://doi.org/10.1613/jair.2905openalex-snapshot
Interactive Cost Configuration Over Decision Diagrams
inferred← citeshttps://doi.org/10.1613/jair.5271openalex-snapshot
New Canonical Representations by Augmenting OBDDs with Conjunctive Decomposition
inferred← citeshttps://doi.org/10.21236/ada346061openalex-snapshot
Verification of Floating-Point Adders
inferred← citeshttps://doi.org/10.21236/ada382689openalex-snapshot
Boolean Satisfiability with Transitivity Constraints
inferred← citeshttps://doi.org/10.2197/ipsjjip.25.459openalex-snapshot
Exploiting Functional Dependencies of Variables in All Solutions SAT Solvers
inferred← citeshttps://doi.org/10.2197/ipsjjip.29.630openalex-snapshot
Interval-based Counterexample Analysis for Error Explanation
inferred← citeshttps://doi.org/10.2298/fuee0703381wopenalex-snapshot
Building free Binary Decision Diagrams using SAT solvers
inferred← citeshttps://doi.org/10.24963/ijcai.2021/617openalex-snapshot
Hybrid Probabilistic Inference with Logical and Algebraic Constraints: a Survey
inferred← citeshttps://doi.org/10.24963/ijcai.2022/259openalex-snapshot
AllSATCC: Boosting AllSAT Solving with Efficient Component Analysis
inferred← citeshttps://doi.org/10.3233/978-1-60750-606-5-3openalex-snapshot
Top-Down Algorithms for Constructing Structured DNNF: Theoretical and Practical Implications
inferred← citeshttps://doi.org/10.3233/978-1-60750-606-5-9openalex-snapshot
On Decomposability and Interaction Functions
inferred← citeshttps://doi.org/10.70675/10b79942z0379z46a4zbb33z9331f6eae3dbopenalex-snapshot
Des fonctions difficiles en compilation de connaissances : bornes inférieures et applications
inferred← citeshttps://doi.org/10.70675/a36833c8z1bc0z4551zb63dz225c3eaee819openalex-snapshot
Compilation de préférences : application à la configuration de produit
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.