On the public citation graph
Solving #SAT and Bayesian Inference with Backtracking Search
0 signed · 48 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/978-3-540-39879-0_3openalex-snapshot
Optimal Time—Space Tradeoff In Probabilistic Inference
inferredcites →https://doi.org/10.1007/978-3-540-85958-1_32openalex-snapshot
Exploiting Decomposition in Constraint Optimization Problems
inferredcites →https://doi.org/10.1016/0095-8956(91)90061-nopenalex-snapshot
Graph minors. X. Obstructions to tree-decomposition
inferredcites →https://doi.org/10.1016/0304-3975(91)90315-sopenalex-snapshot
Counting the number of solutions for instances of satisfiability
inferredcites →https://doi.org/10.1016/j.artint.2005.04.004openalex-snapshot
Unifying tree decompositions for reasoning in graphical models
inferredcites →https://doi.org/10.1016/j.artint.2007.11.002openalex-snapshot
On probabilistic inference by weighted model counting
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/s0004-3702(99)00059-4openalex-snapshot
Bucket elimination: A unifying framework for reasoning
inferredcites →https://doi.org/10.1109/ccc.2003.1214425openalex-snapshot
Memoization and DPLL: formula caching proof systems
inferredcites →https://doi.org/10.1109/dac.2001.935565openalex-snapshot
Chaff: engineering an efficient SAT solver
inferredcites →https://doi.org/10.1109/ictai.2004.67openalex-snapshot
Guiding real-world SAT solving with dynamic hypergraph separator decomposition
inferredcites →https://doi.org/10.1109/sfcs.1998.743514openalex-snapshot
Exponential separations between restricted resolution and cutting planes proof systems
inferredcites →https://doi.org/10.1109/sfcs.2002.1181983openalex-snapshot
Satisfiability, branch-width and Tseitin tautologies
inferredcites →https://doi.org/10.1109/sfcs.2003.1238208openalex-snapshot
Algorithms and complexity results for #SAT and Bayesian inference
inferredcites →https://doi.org/10.1137/0208032openalex-snapshot
The Complexity of Enumeration and Reliability Problems
inferredcites →https://doi.org/10.1613/jair.601openalex-snapshot
The Good Old Davis-Putnam Procedure Helps Counting Models
inferredcites →https://doi.org/10.48550/arxiv.1302.3562openalex-snapshot
Context-Specific Independence in Bayesian Networks
inferredcites →https://doi.org/10.5555/1036843.1036858openalex-snapshot
Mixtures of deterministic-probabilistic networks and their AND/OR search space
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-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-80223-3_11openalex-snapshot
ProCount: Weighted Projected Model Counting with Graded Project-Join Trees
inferred← citeshttps://doi.org/10.1007/978-3-031-33271-5_26openalex-snapshot
Generating Random Instances of Weighted Model Counting
inferred← citeshttps://doi.org/10.1007/978-3-319-19647-3_22openalex-snapshot
Approximate Model Counting via Extension Rule
inferred← citeshttps://doi.org/10.1007/978-3-319-24318-4_10openalex-snapshot
$$\#\exists $$SAT: Projected Model Counting
inferred← citeshttps://doi.org/10.1007/978-3-319-24318-4_17openalex-snapshot
Community Structure Inspired Algorithms for SAT and #SAT
inferred← citeshttps://doi.org/10.1007/978-3-319-66263-3_12openalex-snapshot
Improving MCS Enumeration via Caching
inferred← citeshttps://doi.org/10.1007/978-3-642-38171-3_7openalex-snapshot
Decision Diagrams and Dynamic Programming
inferred← citeshttps://doi.org/10.1007/s00453-015-0030-xopenalex-snapshot
Model Counting for CNF Formulas of Bounded Modular Treewidth
inferred← citeshttps://doi.org/10.1007/s10479-009-0680-7openalex-snapshot
Leveraging belief propagation, backtrack search, and statistics for model counting
inferred← citeshttps://doi.org/10.1007/s10618-020-00726-4openalex-snapshot
Learning tractable probabilistic models for moral responsibility and blame
inferred← citeshttps://doi.org/10.1007/s10994-021-06086-4openalex-snapshot
Handling epistemic and aleatory uncertainties in probabilistic circuits
inferred← citeshttps://doi.org/10.1007/s42484-024-00209-5openalex-snapshot
Quantum algorithms for weighted constrained sampling and weighted model counting
inferred← citeshttps://doi.org/10.1016/j.artint.2019.04.003openalex-snapshot
Advanced SMT techniques for weighted model integration
inferred← citeshttps://doi.org/10.1016/j.artint.2021.103460openalex-snapshot
New width parameters for SAT and #SAT
inferred← citeshttps://doi.org/10.1016/j.artint.2024.104067openalex-snapshot
Enhancing SMT-based Weighted Model Integration by structure awareness
inferred← citeshttps://doi.org/10.1016/j.dam.2025.12.035openalex-snapshot
New perspectives on semiring applications to dynamic programming
inferred← citeshttps://doi.org/10.1016/j.ijar.2020.08.001openalex-snapshot
Semiring programming: A semantic framework for generalized sum product problems
inferred← citeshttps://doi.org/10.1016/j.knosys.2020.105976openalex-snapshot
Abstracting probabilistic models: Relations, constraints and beyond
inferred← citeshttps://doi.org/10.1016/j.knosys.2020.106715openalex-snapshot
Fairness in machine learning with tractable models
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.04.047openalex-snapshot
Two approximate algorithms for model counting
inferred← citeshttps://doi.org/10.1109/ictai.2018.00115openalex-snapshot
Sum-of-Products with Default Values: Algorithms and Complexity Results
inferred← citeshttps://doi.org/10.1137/130914085openalex-snapshot
Time-Space Trade-offs in Resolution: Superpolynomial Lower Bounds for Superlinear Space
inferred← citeshttps://doi.org/10.1162/dint_a_00064openalex-snapshot
Probabilistic Tractable Models in Mixed Discrete-Continuous Domains
inferred← citeshttps://doi.org/10.1177/29498732251339951openalex-snapshot
On the Relevance of Logic for Artificial Intelligence, and the Promise of Neurosymbolic Learning
inferred← citeshttps://doi.org/10.1609/aaai.v35i14.17474openalex-snapshot
Learning Branching Heuristics for Propositional Model Counting
inferred← citeshttps://doi.org/10.29007/vgg4openalex-snapshot
Combining Conflict-Driven Clause Learning and Chronological Backtracking for Propositional Model Counting
inferred← citeshttps://doi.org/10.3389/frai.2021.644062openalex-snapshot
Closed-Form Results for Prior Constraints in Sum-Product Networks
inferred← citeshttps://doi.org/10.70675/5842ba53z380ez4b64z9aeczdee2a5b2e32fopenalex-snapshot
Fine-Grained and Parameterized Complexity of Graph Coloring Problems
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.