Graph decompositions and tree automata in reasoning with uncertainty (Q4286533): Difference between revisions

@@ Property / cites work @@
+Reduced State EnumerationߞAnother Algorithm for Reliability Evaluation
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
+Normal rank
@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+Easy problems for tree-decomposable graphs
@@ Property / cites work: Easy problems for tree-decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Characterization and Recognition of Partial 3-Trees
+Normal rank
@@ Property / cites work @@
+Linear time algorithms for NP-hard problems restricted to partial k- trees
+Normal rank
@@ Property / cites work @@
+Graph expressions and graph rewritings
@@ Property / cites work: Graph expressions and graph rewritings / rank @@
+Normal rank
@@ Property / cites work @@
+Nonserial dynamic programming
@@ Property / cites work: Nonserial dynamic programming / rank @@
+Normal rank
@@ Property / cites work @@
+Many hard examples for resolution
@@ Property / cites work: Many hard examples for resolution / rank @@
+Normal rank
@@ Property / cites work @@
+The computational complexity of probabilistic inference using Bayesian belief networks
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Characterization of partial 3-trees in terms of three structures
+Normal rank
@@ Property / cites work @@
+The Computational Complexity of Provability in Systems of Modal Propositional Logic
+Normal rank
@@ Property / cites work @@
+Q4273873
@@ Property / cites work: Q4273873 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms finding tree-decompositions of graphs
@@ Property / cites work: Algorithms finding tree-decompositions of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic logic
@@ Property / cites work: Probabilistic logic / rank @@
+Normal rank
@@ Property / cites work @@
+Dempster's rule of combination is {\#}P-complete
@@ Property / cites work: Dempster's rule of combination is {\#}P-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Q3997653
@@ Property / cites work: Q3997653 / rank @@
+Normal rank
@@ Property / cites work @@
+A Computational Approach to Approximate and Plausible Reasoning with Applications to Expert Systems
+Normal rank
@@ Property / cites work @@
+A logic for default reasoning
@@ Property / cites work: A logic for default reasoning / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the Reliability of Complex Networks
@@ Property / cites work: Computing the Reliability of Complex Networks / rank @@
+Normal rank
@@ Property / cites work @@
+On Spohn's rule for revision of beliefs
@@ Property / cites work: On Spohn's rule for revision of beliefs / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient reasoning about rich temporal domains
@@ Property / cites work: Efficient reasoning about rich temporal domains / rank @@
+Normal rank
@@ Property / cites work @@
+Intuitionistic propositional logic is polynomial-space complete
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank
@@ Property / cites work @@
+Q3740231
@@ Property / cites work: Q3740231 / rank @@
+Normal rank