On the public citation graph
Ordered Binary Decision Diagrams and the Davis-Putnam procedure
0 signed · 80 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-53162-9_39openalex-snapshot
Propositional calculus problems in CHIP
inferredcites →https://doi.org/10.1007/bf00881842openalex-snapshot
Introduction to the OBDD algorithm for the ATP community
inferredcites →https://doi.org/10.1016/0004-3702(85)90074-8openalex-snapshot
Refutational theorem proving using term-rewriting systems
inferredcites →https://doi.org/10.1016/0890-5401(92)90017-aopenalex-snapshot
Symbolic model checking: 1020 States and beyond
inferredcites →https://doi.org/10.1016/0898-1221(94)00219-bopenalex-snapshot
Automated reasoning and exhaustive search: Quasigroup existence problems
inferredcites →https://doi.org/10.1016/b978-0-444-88771-9.50007-6openalex-snapshot
The Use of Renaming to Improve the Efficiency of Clausal Theorem Proving
inferredcites →https://doi.org/10.1016/s0747-7171(87)80065-2openalex-snapshot
Embedding boolean expressions into logic programming
inferredcites →https://doi.org/10.1023/a:1008647823331openalex-snapshot
Multi-Terminal Binary Decision Diagrams: An Efficient Data Structure for Matrix Representation
inferredcites →https://doi.org/10.1109/12.53586openalex-snapshot
Finding the optimal variable ordering for binary decision diagrams
inferredcites →https://doi.org/10.1109/12.73590openalex-snapshot
On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
inferredcites →https://doi.org/10.1109/43.277617openalex-snapshot
Comparing two-level and ordered binary decision diagram representations of logic functions
inferredcites →https://doi.org/10.1109/iccad.1992.279335openalex-snapshot
A new algorithm for the binate covering problem and its application to the minimization of Boolean relations
inferredcites →https://doi.org/10.1109/iccad.1993.580029openalex-snapshot
Dynamic variable ordering for ordered binary decision diagrams
inferredcites →https://doi.org/10.1109/iccad.1993.580054openalex-snapshot
Algebraic decision diagrams and their applications
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/127601.127705openalex-snapshot
Heuristics to compute variable orderings for efficient manipulation of ordered binary decision diagrams
inferredcites →https://doi.org/10.1145/136035.136043openalex-snapshot
Symbolic Boolean manipulation with ordered binary-decision diagrams
inferredcites →https://doi.org/10.1145/157485.164888openalex-snapshot
Reducing BDD size by exploiting functional dependencies
inferredcites →https://doi.org/10.1145/157485.164981openalex-snapshot
Linking BDD-based symbolic evaluation to interactive theorem-proving
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
inferredcites →https://doi.org/10.1145/37888.37930openalex-snapshot
Application of term rewriting techniques to hardware design verification
inferredcites →https://doi.org/10.5555/259794.259802openalex-snapshot
Dynamic variable ordering for ordered binary decision diagrams
inferredcites →https://doi.org/10.7551/mitpress/4316.003.0039openalex-snapshot
Notes on the Design of an Open Boolean Solver
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1999.2850openalex-snapshot
Building Decision Procedures for Modal Logics from Propositional Decision Procedures: The Case Study of Modal K(m)
inferred← citeshttps://doi.org/10.1007/1-4020-2530-0_2openalex-snapshot
Advancements in Mixed BDD and SAT Techniques
inferred← citeshttps://doi.org/10.1007/11527695_19openalex-snapshot
Search vs. Symbolic Techniques in Satisfiability Solving
inferred← citeshttps://doi.org/10.1007/11753728_60openalex-snapshot
Extended Resolution Proofs for Conjoining BDDs
inferred← citeshttps://doi.org/10.1007/11814948_8openalex-snapshot
Extended Resolution Proofs for Symbolic SAT Solving with Quantification
inferred← citeshttps://doi.org/10.1007/3-540-36377-7_20openalex-snapshot
From Type Inference to Configuration
inferred← citeshttps://doi.org/10.1007/3-540-45349-0_12openalex-snapshot
Random 3-SAT: The Plot Thickens
inferred← citeshttps://doi.org/10.1007/3-540-45575-2_5openalex-snapshot
Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially
inferred← citeshttps://doi.org/10.1007/3-540-45578-7_9openalex-snapshot
Random 3-SAT and BDDs: The Plot Thickens Further
inferred← citeshttps://doi.org/10.1007/3-540-45643-0_3openalex-snapshot
A Compressed Breadth-First Search for Satisfiability
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_26openalex-snapshot
Evaluating Search Heuristics and Optimization Techniques in Propositional Satisfiability
inferred← citeshttps://doi.org/10.1007/3-540-46238-4_8openalex-snapshot
Applying the Davis-Putnam procedure to non-clausal formulas
inferred← citeshttps://doi.org/10.1007/3-540-58402-1_18openalex-snapshot
Clp(B): Combining simplicity and efficiency in boolean Constraint solving
inferred← citeshttps://doi.org/10.1007/3-540-61208-4_1openalex-snapshot
On sets, types, fixed points, and checkerboards
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_115openalex-snapshot
Building decision procedures for modal logics from propositional decision procedures — The case study of modal K
inferred← citeshttps://doi.org/10.1007/3-540-69778-0_24openalex-snapshot
Simplification A General Constraint Propagation Technique for Propositional and Modal Tableaux
inferred← citeshttps://doi.org/10.1007/978-1-4020-5571-3_3openalex-snapshot
Symbolic Techniques in Satisfiability Solving
inferred← citeshttps://doi.org/10.1007/978-3-030-58475-7_13openalex-snapshot
DPMC: Weighted Model Counting by Dynamic Programming on Project-Join Trees
inferred← citeshttps://doi.org/10.1007/978-3-030-72016-2_5openalex-snapshot
Generating Extended Resolution Proofs with a BDD-Based SAT Solver
inferred← citeshttps://doi.org/10.1007/978-3-030-80223-3_11openalex-snapshot
ProCount: Weighted Projected Model Counting with Graded Project-Join Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-30201-8_34openalex-snapshot
Symbolic Decision Procedures for QBF
inferred← citeshttps://doi.org/10.1007/978-3-540-32275-7_20openalex-snapshot
Evaluating QBFs via Symbolic Skolemization
inferred← citeshttps://doi.org/10.1007/978-94-017-1737-3_3openalex-snapshot
Consequence Finding Algorithms
inferred← citeshttps://doi.org/10.1007/bf00247670openalex-snapshot
A simple and efficient boolean solver for Constraint Logic Programming
inferred← citeshttps://doi.org/10.1007/bfb0105407openalex-snapshot
Stålmarck’s algorithm as a HOL derived rule
inferred← citeshttps://doi.org/10.1007/s10515-009-0059-7openalex-snapshot
Finding robust solutions in requirements models
inferred← citeshttps://doi.org/10.1007/s10515-010-0072-xopenalex-snapshot
Automatically finding the control variables for complex system behavior
inferred← citeshttps://doi.org/10.1007/s10817-005-9009-7openalex-snapshot
Symbolic Techniques in Satisfiability Solving
inferred← citeshttps://doi.org/10.1016/j.dam.2006.11.012openalex-snapshot
Extended resolution simulates binary decision diagrams
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00409-2openalex-snapshot
A satisfiability procedure for quantified Boolean formulae
inferred← citeshttps://doi.org/10.1016/s0950-5849(02)00120-9openalex-snapshot
Detection of dynamic execution errors in IBM system automation's rule-based expert system
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00331-7openalex-snapshot
Formal Verification based on Boolean Expression Diagrams
inferred← citeshttps://doi.org/10.1023/a:1025671026963openalex-snapshot
Random 3-SAT: The Plot Thickens
inferred← citeshttps://doi.org/10.1023/b:amai.0000038313.15152.5copenalex-snapshot
On Stratified Belief Base Compilation
inferred← citeshttps://doi.org/10.1109/43.771175openalex-snapshot
Equivalence checking of combinational circuits using Boolean expression diagrams
inferred← citeshttps://doi.org/10.1109/ccc.2008.34openalex-snapshot
On the Relative Efficiency of Resolution-Like Proofs and Ordered Binary Decision Diagram Proofs
inferred← citeshttps://doi.org/10.1109/hldvt.2003.1252474openalex-snapshot
Integrating CNF and BDD based SAT solvers
inferred← citeshttps://doi.org/10.1109/ictai.2004.115openalex-snapshot
Toward good elimination orders for symbolic SAT solving
inferred← citeshttps://doi.org/10.1109/ijcnn.2004.1380155openalex-snapshot
Transferring domain rules in a constructive network: introducing RBCC
inferred← citeshttps://doi.org/10.1145/3595295openalex-snapshot
Generating Extended Resolution Proofs with a BDD-Based SAT Solver
inferred← citeshttps://doi.org/10.13140/2.1.1691.2648openalex-snapshot
Improvements to SAT-Based Conformant Planning
inferred← citeshttps://doi.org/10.1609/aaai.v34i02.5505openalex-snapshot
ADDMC: Weighted Model Counting with Algebraic Decision Diagrams
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25cebopenalex-snapshot
Generating Extended Resolution Proofs with a BDD-Based SAT Solver
inferred← citeshttps://doi.org/10.3233/sat190074openalex-snapshot
Ordered Binary Decision Diagrams, Pigeonhole Formulas and Beyond1
inferred← citeshttps://doi.org/10.33915/etd.4595openalex-snapshot
The robust optimization of non-linear requirements models
inferred← citeshttps://doi.org/10.48550/arxiv.1701.02275openalex-snapshot
Resolution Simulates Ordered Binary Decision Diagrams for Formulas in Conjunctive Normal Form
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0701054openalex-snapshot
Nearly-Exponential Size Lower Bounds for Symbolic Quantifier Elimination Algorithms and OBDD-Based Proofs of Unsatisfiability
inferred← citeshttps://doi.org/10.6100/ir526346openalex-snapshot
Nonlinear approaches to satisfiability problems
inferred← citeshttps://doi.org/10.70675/5732022dzaf3bz44e9zae98z41d4facf3deaopenalex-snapshot
Contributions à la résolution du problème de la Satisfiabilité Propositionnelle
inferred← citeshttps://doi.org/10.70675/6ef488bbz240ez4bcdz98e9z9b15980a474copenalex-snapshot
Informatique ubiquitaire : techniques de curage d'informations perverties
inferred← citeshttps://doi.org/10.70675/90961a35z8128z45eaz9859z1d246d7621d4openalex-snapshot
Max-résolution et apprentissage pour la résolution du problème de satisfiabilité maximum
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.