On the public citation graph

The Language of Search

0 signed · 76 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_17openalex-snapshot
Heuristics for Fast Exact Model Counting
inferredcites →https://doi.org/10.1007/11527695_12openalex-snapshot
Aligning CNF- and Equivalence-Reasoning
inferredcites →https://doi.org/10.1007/11527695_13openalex-snapshot
Using DPLL for Efficient OBDD Construction
inferredcites →https://doi.org/10.1007/3-540-44652-4_17openalex-snapshot
Using Recursive Decomposition to Construct Elimination Orders, Jointrees, and Dtrees
inferredcites →https://doi.org/10.1007/3-540-45657-0_19openalex-snapshot
Applying SAT Methods in Unbounded Symbolic Model Checking
inferredcites →https://doi.org/10.1007/3-540-45657-0_2openalex-snapshot
The Quest for Efficient Boolean Satisfiability Solvers
inferredcites →https://doi.org/10.1007/3-540-48159-1_5openalex-snapshot
The Impact of Branching Heuristics in Propositional Satisfiability Algorithms
inferredcites →https://doi.org/10.1007/3-540-61474-5_93openalex-snapshot
Symbolic model checking
inferredcites →https://doi.org/10.1007/978-3-540-30201-8_56openalex-snapshot
The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting
inferredcites →https://doi.org/10.1007/978-3-540-30494-4_20openalex-snapshot
Memory Efficient All-Solutions SAT Solver and Its Application for Reachability Analysis
inferredcites →https://doi.org/10.1007/978-3-642-58940-9openalex-snapshot
Algorithms and Data Structures in VLSI Design
inferredcites →https://doi.org/10.1007/978-3-642-59615-5_6openalex-snapshot
Symbolic Model Checking
inferredcites →https://doi.org/10.1016/b978-1-4832-1452-8.50146-9openalex-snapshot
Tractable Databases: How to Make Propositional Unit Resolution Complete through Compilation
inferredcites →https://doi.org/10.1016/j.ijar.2005.10.001openalex-snapshot
Compiling relational Bayesian networks for exact inference
inferredcites →https://doi.org/10.1016/s0020-0190(80)90078-2openalex-snapshot
Equivalence of free boolean graphs can be decided probabilistically in polynomial time
inferredcites →https://doi.org/10.1016/s0898-1221(99)90407-8openalex-snapshot
Algorithms and data structures in VLSI design: OBDD—Foundations and applications
inferredcites →https://doi.org/10.1109/12.324545openalex-snapshot
Efficient Boolean manipulation with OBDD's can be extended to FBDD's
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/dac.2001.935565openalex-snapshot
Chaff: engineering an efficient SAT solver
inferredcites →https://doi.org/10.1109/date.2002.998262openalex-snapshot
BerkMin: A fast and robust SAT-solver
inferredcites →https://doi.org/10.1109/iccad.2001.968634openalex-snapshot
Efficient conflict driven learning in a Boolean satisfiability solver
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/sfcs.2003.1238208openalex-snapshot
Algorithms and complexity results for #SAT and Bayesian inference
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1109/tce.1953.6371932openalex-snapshot
The map method for synthesis of combinational logic circuits
inferredcites →https://doi.org/10.1145/123186.123222openalex-snapshot
Efficient implementation of a BDD package
inferredcites →https://doi.org/10.1145/226643.226644openalex-snapshot
Knowledge compilation and theory approximation
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
inferredcites →https://doi.org/10.1145/378239.379017openalex-snapshot
Chaff
inferredcites →https://doi.org/10.1184/r1/6612656openalex-snapshot
Using SAT based image computation for reachability analysis
inferredcites →https://doi.org/10.1613/jair.601openalex-snapshot
The Good Old Davis-Putnam Procedure Helps Counting Models
inferredcites →https://doi.org/10.2307/2274155openalex-snapshot
Handbook of mathematical logic, edited by Jon Barwise with the cooperation of H. J. Keisler, K. Kunen, Y. N. Moschovakis, and A. S. Troelstra, Studies in logic and the foundations of mathematics, vol. 90, North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1978 (© 1977), xi + 1165…
inferredcites →https://doi.org/10.2307/421131openalex-snapshot
The Complexity of Propositional Proofs
inferredcites →https://doi.org/10.3166/jancl.11.11-34openalex-snapshot
On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
inferredcites →https://doi.org/10.5555/1036843.1036858openalex-snapshot
Mixtures of deterministic-probabilistic networks and their AND/OR search space
inferredcites →https://doi.org/10.5555/603095.603187openalex-snapshot
Faster SAT and smaller BDDs via common function structure
inferredcites →https://doi.org/10.5555/777092.777189openalex-snapshot
A compiler for deterministic, decomposable negation normal form

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-1-4614-8265-9_80759openalex-snapshot
Uncertain Data Lineage
inferred← citeshttps://doi.org/10.1007/978-3-030-17728-7_9openalex-snapshot
Discrete-Event Systems Fault Diagnosis
inferred← citeshttps://doi.org/10.1007/978-3-030-24258-9_25openalex-snapshot
Verifying Binarized Neural Networks by Angluin-Style Learning
inferred← citeshttps://doi.org/10.1007/978-3-031-13185-1_18openalex-snapshot
A Scalable Shannon Entropy Estimator
inferred← citeshttps://doi.org/10.1007/978-3-031-43369-6_11openalex-snapshot
An Abstract CNF-to-d-DNNF Compiler Based on Chronological CDCL
inferred← citeshttps://doi.org/10.1007/978-3-031-71170-1_9openalex-snapshot
Parameter Learning Using Approximate Model Counting
inferred← citeshttps://doi.org/10.1007/978-3-032-32537-2_19openalex-snapshot
Quokka#: Quantum Computing with #SAT
inferred← citeshttps://doi.org/10.1007/978-3-319-10428-7_7openalex-snapshot
On Compiling CNF into Decision-DNNF
inferred← citeshttps://doi.org/10.1007/978-3-319-23540-0_6openalex-snapshot
On the Impact of Junction-Tree Topology on Weighted Model Counting
inferred← citeshttps://doi.org/10.1007/978-3-319-66158-2_12openalex-snapshot
Defining and Evaluating Heuristics for the Compilation of Constraint Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-03251-6_5openalex-snapshot
From Rules to Constraint Programs with the Rules2CP Modelling Language
inferred← citeshttps://doi.org/10.1007/978-3-642-21581-0_8openalex-snapshot
DPLL+ROBDD Derivation Applied to Inversion of Some Cryptographic Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-33558-7_10openalex-snapshot
Distributed Tree Decomposition with Privacy
inferred← citeshttps://doi.org/10.1007/s00224-018-9904-zopenalex-snapshot
On the Relative Succinctness of Sentential Decision Diagrams
inferred← citeshttps://doi.org/10.1007/s10115-012-0525-6openalex-snapshot
Reduced ordered binary decision diagram with implied literals: a new knowledge compilation approach
inferred← citeshttps://doi.org/10.1007/s10849-022-09377-8openalex-snapshot
On the (Complete) Reasons Behind Decisions
inferred← citeshttps://doi.org/10.1016/j.artint.2020.103271openalex-snapshot
CPCES: A planning framework to solve conformant planning problems through a counterexample guided refinement
inferred← citeshttps://doi.org/10.1016/j.dam.2024.10.021openalex-snapshot
On enumerating short projected models
inferred← citeshttps://doi.org/10.1109/iccad66269.2025.11240928openalex-snapshot
CoP&R: Co-Optimizing Place-and-Route for Standard Cell Layout via MCTS and AllSAT
inferred← citeshttps://doi.org/10.1145/2984632openalex-snapshot
Exact Model Counting of Query Expressions
inferred← citeshttps://doi.org/10.1145/3324884.3416569openalex-snapshot
Accelerating all-SAT computation with short blocking clauses
inferred← citeshttps://doi.org/10.1145/3375395.3389129openalex-snapshot
Probabilistic Databases for All
inferred← citeshttps://doi.org/10.1609/aaai.v24i1.7587openalex-snapshot
Knowledge Compilation in the Modal Logic S5
inferred← citeshttps://doi.org/10.1609/aaai.v35i5.16503openalex-snapshot
The Power of Literal Equivalence in Model Counting
inferred← citeshttps://doi.org/10.1609/aimag.v33i3.2430openalex-snapshot
AI@NICTA
inferred← citeshttps://doi.org/10.1613/jair.1.12756openalex-snapshot
On Quantifying Literals in Boolean Logic and its Applications to Explainable AI
inferred← citeshttps://doi.org/10.2197/ipsjjip.29.630openalex-snapshot
Interval-based Counterexample Analysis for Error Explanation
inferred← citeshttps://doi.org/10.24963/ijcai.2017/93openalex-snapshot
An Improved Decision-DNNF Compiler
inferred← citeshttps://doi.org/10.24963/kr.2020/86openalex-snapshot
On Tractable XAI Queries based on Compiled Representations
inferred← citeshttps://doi.org/10.48550/arxiv.1208.2852openalex-snapshot
Ordered {AND, OR}-Decomposition and Binary-Decision Diagram
inferred← citeshttps://doi.org/10.48550/arxiv.1309.6815openalex-snapshot
Lower Bounds for Exact Model Counting and Applications in Probabilistic Databases
inferred← citeshttps://doi.org/10.48550/arxiv.1506.02639openalex-snapshot
New Limits for Knowledge Compilation and Applications to Exact Model Counting
inferred← citeshttps://doi.org/10.48550/arxiv.1611.03553openalex-snapshot
The Sum-Product Theorem: A Foundation for Learning Tractable Models
inferred← citeshttps://doi.org/10.48550/arxiv.1805.07180openalex-snapshot
Approximate Model Counting by Partial Knowledge Compilation
inferred← citeshttps://doi.org/10.48550/arxiv.1912.11098openalex-snapshot
Towards Deterministic Decomposable Circuits for Safe Queries
inferred← citeshttps://doi.org/10.48550/arxiv.2107.01654openalex-snapshot
Efficient Explanations for Knowledge Compilation Languages
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/17f60f5aza03ez4c04zaf96z605fe438f7a6openalex-snapshot
Compilation de connaissances pour le comptage de modèles
inferred← citeshttps://doi.org/10.70675/1b6e4710z8c13z4f84zbb0az80e114bebb07openalex-snapshot
Recent advances in formal explainability
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.