Graph decompositions and tree automata in reasoning with uncertainty
From MaRDI portal
Publication:4286533
DOI10.1080/09528139308953776zbMath0802.68143OpenAlexW2026831733MaRDI QIDQ4286533
Publication date: 11 December 1994
Published in: Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09528139308953776
Bayesian inferencetree automatapossibilistic logictree-widthprobabilistic logicdecomposable graphsmodel preference reasoning
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Logic in artificial intelligence (68T27) Probability and inductive logic (03B48)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of computing the permanent
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Probabilistic logic
- Characterization of partial 3-trees in terms of three structures
- Efficient reasoning about rich temporal domains
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- A logic for default reasoning
- Intuitionistic propositional logic is polynomial-space complete
- Nonserial dynamic programming
- Dempster's rule of combination is {\#}P-complete
- The computational complexity of probabilistic inference using Bayesian belief networks
- On Spohn's rule for revision of beliefs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Algorithms finding tree-decompositions of graphs
- Easy problems for tree-decomposable graphs
- Many hard examples for resolution
- A Computational Approach to Approximate and Plausible Reasoning with Applications to Expert Systems
- Characterization and Recognition of Partial 3-Trees
- Complexity of Finding Embeddings in a k-Tree
- Graph expressions and graph rewritings
- Reduced State EnumerationߞAnother Algorithm for Reliability Evaluation
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- Computing the Reliability of Complex Networks
