AND/OR search spaces for graphical models
type: Item
instance of: scholarly article
title: AND/OR search spaces for graphical models
zbMATH Open document ID: 1168.68549
author: Rina Dechter
author: Robert Mateescu
published in: Artificial Intelligence
publication date: 2009-07-09T00:00:00Z
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 5576659
zbMATH Keywords: search
zbMATH Keywords: AND/OR search
zbMATH Keywords: decomposition
zbMATH Keywords: graphical models
zbMATH Keywords: Bayesian networks
zbMATH Keywords: constraint networks
describes a project that uses: AIS-BN
MaRDI profile type: Publication
full work available at URL: j.artint.2006.11.003
OpenAlex ID: W2154055561
cites work: Q3856120
cites work: Q4012213
cites work: Q4484663
cites work: Adopt: asynchronous distributed constraint optimization with quality guarantees
cites work: Hybrid backtracking bounded by tree-decomposition of constraint networks
cites work: Principles and Practice of Constraint Programming – CP 2003
cites work: Recursive conditioning
cites work: Bucket elimination: A unifying framework for reasoning
cites work: Graph-Based Algorithms for Boolean Function Manipulation
cites work: Q4411139
cites work: A differential approach to inference in Bayesian networks
cites work: Case-factor diagrams for structured probabilistic modeling
cites work: Compiling CSPs into tree-driven automata for interactive solving
cites work: Tree clustering for constraint networks
cites work: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
cites work: Q4694712
cites work: Q4699283
cites work: Valuation-Based Systems for Bayesian Decision Analysis
cites work: Unifying tree decompositions for reasoning in graphical models
cites work: Network-based heuristics for constraint-satisfaction problems
cites work: Resolution versus search: Two strategies for SAT
cites work: GRASP: a search algorithm for propositional satisfiability
cites work: Graph minors. I. Excluding a forest
cites work: Quickly excluding a forest
cites work: Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs)
cites work: Backjump-based backtracking for constraint satisfaction problems
cites work: Interpolants and Symbolic Model Checking
cites work: Efficient Boolean manipulation with OBDD's can be extended to FBDD's
cites work: Graph driven BDDs -- a new data structure for Boolean functions
DOI: 10.1016/J.ARTINT.2006.11.003
Recommended article: Q4801473
Recommended article: AND/OR branch-and-bound search for combinatorial optimization in graphical models
Recommended article: Graph space: using both geometric and probabilistic structure to evaluate statistical graph models
Recommended article: Searching for the \(m\) best solutions in graphical models
Recommended article: Graphical Models: Queries, Complexity, Algorithms
Recommended article: Q4411162
Recommended article: Graphical models
Recommended article: Modelling and searching of combinatorial spaces based on Markov logic networks
description: scientific article; zbMATH DE number 5576659