On the public citation graph

AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models

0 signed · 42 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/3-540-55121-2_1openalex-snapshot
Approximating treewidth, pathwidth, and minimum elimination tree height
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-45193-8_48openalex-snapshot
Bounded Backtracking for the Valued Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1007/s100090100056openalex-snapshot
Binary decision diagrams in theory and practice
inferredcites →https://doi.org/10.1016/c2009-0-27609-4openalex-snapshot
Probabilistic Reasoning in Intelligent Systems
inferredcites →https://doi.org/10.1016/j.artint.2004.09.003openalex-snapshot
Adopt: asynchronous distributed constraint optimization with quality guarantees
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(02)00400-9openalex-snapshot
Hybrid backtracking bounded by tree-decomposition of constraint networks
inferredcites →https://doi.org/10.1016/s0004-3702(99)00059-4openalex-snapshot
Bucket elimination: A unifying framework for reasoning
inferredcites →https://doi.org/10.1016/s0167-9260(00)00003-1openalex-snapshot
Boolean function representation and spectral characterization using AND/OR graphs
inferredcites →https://doi.org/10.1023/b:cons.0000049204.75635.7eopenalex-snapshot
Compiling CSPs into Tree-Driven Automata for Interactive Solving
inferredcites →https://doi.org/10.1109/dac.1992.227813openalex-snapshot
Edge-valued binary decision for multi-level hierarchical verification
inferredcites →https://doi.org/10.1109/iccad.1990.129849openalex-snapshot
Algorithms for discrete function manipulation
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.1142/s0218488504002564openalex-snapshot
PROBABILISTIC DECISION GRAPHS — COMBINING VERIFICATION AND AI TECHNIQUES FOR PROBABILISTIC INFERENCE
inferredcites →https://doi.org/10.1145/226643.226644openalex-snapshot
Knowledge compilation and theory approximation
inferredcites →https://doi.org/10.1287/opre.40.3.463openalex-snapshot
Valuation-Based Systems for Bayesian Decision Analysis
inferredcites →https://doi.org/10.48550/arxiv.1206.5266openalex-snapshot
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Weighted Graphical Models
inferredcites →https://doi.org/10.48550/arxiv.1207.1407openalex-snapshot
The Relationship Between AND/OR Search and Variable Elimination
inferredcites →https://doi.org/10.48550/arxiv.1212.2452openalex-snapshot
Value Elimination: Bayesian Inference via Backtracking Search
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/1036843.1036890openalex-snapshot
Case-factor diagrams for structured probabilistic modeling

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-031-06773-0_42openalex-snapshot
The Power of Disjoint Support Decompositions in Decision Diagrams
inferred← citeshttps://doi.org/10.1007/978-981-15-3863-6_25openalex-snapshot
An Improved AdaBoost Algorithm for Handwriting Digits Recognition
inferred← citeshttps://doi.org/10.1007/s10472-009-9132-yopenalex-snapshot
Mixed deterministic and probabilistic networks
inferred← citeshttps://doi.org/10.1007/s11432-014-5154-0openalex-snapshot
Experimental analyses on phase transitions in compiling satisfiability problems
inferred← citeshttps://doi.org/10.1016/j.artint.2014.07.004openalex-snapshot
Disjunctive closures for knowledge compilation
inferred← citeshttps://doi.org/10.1016/j.artint.2024.104077openalex-snapshot
On the role of logical separability in knowledge compilation
inferred← citeshttps://doi.org/10.1016/j.cor.2021.105403openalex-snapshot
A variable depth neighborhood search algorithm for the Min–Max Arc Crossing Problem
inferred← citeshttps://doi.org/10.1016/j.cor.2024.106603openalex-snapshot
A fast path relinking algorithm for the min–max edge crossing problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2018.10.017openalex-snapshot
Heuristics for the Constrained Incremental Graph Drawing Problem
inferred← citeshttps://doi.org/10.1016/j.ijar.2017.08.003openalex-snapshot
Weighted positive binary decision diagrams for exact probabilistic inference
inferred← citeshttps://doi.org/10.1016/j.ijar.2021.07.007openalex-snapshot
A compositional approach to probabilistic knowledge compilation
inferred← citeshttps://doi.org/10.1016/j.jal.2016.11.031openalex-snapshot
Algebraic model counting
inferred← citeshttps://doi.org/10.1109/access.2019.2927041openalex-snapshot
Augmenting Negation Normal Form With Irrelevant Variables
inferred← citeshttps://doi.org/10.1109/case48305.2020.9216994openalex-snapshot
Compact Belief State Representation for Task Planning
inferred← citeshttps://doi.org/10.1109/ecows.2010.15openalex-snapshot
Decomposing the Service Composition Problem
inferred← citeshttps://doi.org/10.1109/icws.2011.110openalex-snapshot
Identifying Optimal Composite Services by Decomposing the Service Composition Problem
inferred← citeshttps://doi.org/10.70675/17f60f5aza03ez4c04zaf96z605fe438f7a6openalex-snapshot
Compilation de connaissances pour le comptage de modèles
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.