The complexity of Bayesian networks specified by propositional and relational languages (Q1711881): Difference between revisions

@@ Property / cites work @@
+The DL-Lite Family and Relations
@@ Property / cites work: The DL-Lite Family and Relations / rank @@
+Normal rank
@@ Property / cites work @@
+Phase transitions of PP-complete satisfiability problems
+Normal rank
@@ Property / cites work @@
+The complexity of problems for quantified constraints
+Normal rank
@@ Property / cites work @@
+.1162/jmlr.2003.3.4-5.993
@@ Property / cites work: 10.1162/jmlr.2003.3.4-5.993 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5501802
@@ Property / cites work: Q5501802 / rank @@
+Normal rank
@@ Property / cites work @@
+Negative probabilities in probabilistic logic programs
+Normal rank
@@ Property / cites work @@
+Q4258566
@@ Property / cites work: Q4258566 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of weighted and unweighted \(\#\)CSP
+Normal rank
@@ Property / cites work @@
+Holographic reduction, interpolation and hardness
@@ Property / cites work: Holographic reduction, interpolation and hardness / rank @@
+Normal rank
@@ Property / cites work @@
+The Bayesian Description Logic ${\mathcal{BEL}}$
@@ Property / cites work: The Bayesian Description Logic ${\mathcal{BEL}}$ / rank @@
+Normal rank
@@ Property / cites work @@
+On probabilistic inference by weighted model counting
+Normal rank
@@ Property / cites work @@
+On the Semantics and Complexity of Probabilistic Logic Programs
+Normal rank
@@ Property / cites work @@
+The dichotomy of probabilistic inference for unions of conjunctive queries
+Normal rank
@@ Property / cites work @@
+A differential approach to inference in Bayesian networks
+Normal rank
@@ Property / cites work @@
+Modeling and Reasoning with Bayesian Networks
@@ Property / cites work: Modeling and Reasoning with Bayesian Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Q4411139
@@ Property / cites work: Q4411139 / rank @@
+Normal rank
@@ Property / cites work @@
+Soft computing in ontologies and semantic web.
@@ Property / cites work: Soft computing in ontologies and semantic web. / rank @@
+Normal rank
@@ Property / cites work @@
+Subtractive reductions and complete problems for counting complexity classes
+Normal rank
@@ Property / cites work @@
+Inductive Logic Programming
@@ Property / cites work: Inductive Logic Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Inference and learning in probabilistic logic programs using weighted Boolean formulas
+Normal rank
@@ Property / cites work @@
+The Parameterized Complexity of Counting Problems
@@ Property / cites work: The Parameterized Complexity of Counting Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3510469
@@ Property / cites work: Q3510469 / rank @@
+Normal rank
@@ Property / cites work @@
+PRL: a probabilistic relational language
@@ Property / cites work: PRL: a probabilistic relational language / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity of Probabilistic Turing Machines
+Normal rank
@@ Property / cites work @@
+Complexity of DNF minimization and isomorphism testing for monotone formulas
+Normal rank
@@ Property / cites work @@
+Asymptotic Conditional Probabilities: The Unary Case
+Normal rank
@@ Property / cites work @@
+Q4451078
@@ Property / cites work: Q4451078 / rank @@
+Normal rank
@@ Property / cites work @@
+Complex probabilistic modeling with recursive relational Bayesian networks
+Normal rank
@@ Property / cites work @@
+Lower complexity bounds for lifted inference
@@ Property / cites work: Lower complexity bounds for lifted inference / rank @@
+Normal rank
@@ Property / cites work @@
+Managing and mining uncertain data
@@ Property / cites work: Managing and mining uncertain data / rank @@
+Normal rank
@@ Property / cites work @@
+Q3655273
@@ Property / cites work: Q3655273 / rank @@
+Normal rank
@@ Property / cites work @@
+The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks
+Normal rank
@@ Property / cites work @@
+Polynomial Space Counting Problems
@@ Property / cites work: Polynomial Space Counting Problems / rank @@
+Normal rank
@@ Property / cites work @@
+MEBN: a language for first-order Bayesian knowledge bases
+Normal rank
@@ Property / cites work @@
+Complexity results for classes of quantificational formulas
+Normal rank
@@ Property / cites work @@
+Elements of finite model theory.
@@ Property / cites work: Elements of finite model theory. / rank @@
+Normal rank
@@ Property / cites work @@
+A Simple FPTAS for Counting Edge Covers
@@ Property / cites work: A Simple FPTAS for Counting Edge Covers / rank @@
+Normal rank
@@ Property / cites work @@
+FPTAS for Counting Weighted Edge Covers
@@ Property / cites work: FPTAS for Counting Weighted Edge Covers / rank @@
+Normal rank
@@ Property / cites work @@
+The effect of combination functions on the complexity of relational Bayesian networks
+Normal rank
@@ Property / cites work @@
+Answering queries from context-sensitive probabilistic knowledge bases
+Normal rank
@@ Property / cites work @@
+A complexity theory for feasible closure properties
+Normal rank
@@ Property / cites work @@
+A note on succinct representations of graphs
@@ Property / cites work: A note on succinct representations of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3651576
@@ Property / cites work: Q3651576 / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic Horn abduction and Bayesian networks
+Normal rank
@@ Property / cites work @@
+The independent choice logic for modelling multiple agents under uncertainty
+Normal rank
@@ Property / cites work @@
+The Independent Choice Logic and Beyond
@@ Property / cites work: The Independent Choice Logic and Beyond / rank @@
+Normal rank
@@ Property / cites work @@
+Q2996258
@@ Property / cites work: Q2996258 / rank @@
+Normal rank
@@ Property / cites work @@
+Bayesian Networks
@@ Property / cites work: Bayesian Networks / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
+Normal rank
@@ Property / cites work @@
+Logical and Relational Learning
@@ Property / cites work: Logical and Relational Learning / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Learning Theory
@@ Property / cites work: Algorithmic Learning Theory / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of approximate reasoning
@@ Property / cites work: On the hardness of approximate reasoning / rank @@
+Normal rank
@@ Property / cites work @@
+Q4533365
@@ Property / cites work: Q4533365 / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic Databases
@@ Property / cites work: Probabilistic Databases / rank @@
+Normal rank
@@ Property / cites work @@
+Q4954172
@@ Property / cites work: Q4954172 / rank @@
+Normal rank
@@ Property / cites work @@
+PP is as Hard as the Polynomial-Time Hierarchy
@@ Property / cites work: PP is as Hard as the Polynomial-Time Hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P
+Normal rank
@@ Property / cites work @@
+Complexity classes defined by counting quantifiers
+Normal rank
@@ Property / cites work @@
+The Complexity of Counting in Sparse, Regular, and Planar Graphs
+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 @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank
@@ Property / cites work @@
+The complexity of combinatorial problems with succinct input representation
+Normal rank
@@ Property / cites work @@
+Theory and Applications of Models of Computation
@@ Property / cites work: Theory and Applications of Models of Computation / rank @@
+Normal rank