The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws (Q2283277): Difference between revisions

@@ Property / DOI @@
-.1016/j.ijar.2019.04.003
@@ Property / DOI: 10.1016/j.ijar.2019.04.003 / rank @@
-Normal rank
@@ Property / cites work @@
+Decidability and expressiveness for first-order logics of probability
+Normal rank
@@ Property / cites work @@
+Reachability is harder for directed than for undirected finite graphs
+Normal rank
@@ Property / cites work @@
+The DL-Lite Family and Relations
@@ Property / cites work: The DL-Lite Family and Relations / rank @@
+Normal rank
@@ Property / cites work @@
+Q5753550
@@ Property / cites work: Q5753550 / rank @@
+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 @@
+Negative probabilities in probabilistic logic programs
+Normal rank
@@ Property / cites work @@
+PR-OWL - a language for defining probabilistic ontologies
+Normal rank
@@ Property / cites work @@
+The complexity of Bayesian networks specified by propositional and relational languages
+Normal rank
@@ Property / cites work @@
+The descriptive complexity of Bayesian network specifications
+Normal rank
@@ Property / cites work @@
+On the Semantics and Complexity of Probabilistic Logic Programs
+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 @@
+Logical and Relational Learning
@@ Property / cites work: Logical and Relational Learning / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic inductive logic programming. Theory and applications
+Normal rank
@@ Property / cites work @@
+Marginals of DAG-Isomorphic Independence Models
@@ Property / cites work: Marginals of DAG-Isomorphic Independence Models / rank @@
+Normal rank
@@ Property / cites work @@
+Q4850061
@@ Property / cites work: Q4850061 / 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 @@
+Q4052071
@@ Property / cites work: Q4052071 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3286850
@@ Property / cites work: Q3286850 / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilities on finite models
@@ Property / cites work: Probabilities on finite models / rank @@
+Normal rank
@@ Property / cites work @@
+Inference and learning in probabilistic logic programs using weighted Boolean formulas
+Normal rank
@@ Property / cites work @@
+Concerning measures in first order calculi
@@ Property / cites work: Concerning measures in first order calculi / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilities over rich languages, testing and randomness
+Normal rank
@@ Property / cites work @@
+Q3510469
@@ Property / cites work: Q3510469 / rank @@
+Normal rank
@@ Property / cites work @@
+Random Graphs
@@ Property / cites work: Random Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5611005
@@ Property / cites work: Q5611005 / rank @@
+Normal rank
@@ Property / cites work @@
+Finite model theory and its applications.
@@ Property / cites work: Finite model theory and its applications. / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of the first-order theory of almost all finite structures
+Normal rank
@@ Property / cites work @@
+Q4451078
@@ Property / cites work: Q4451078 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4936134
@@ Property / cites work: Q4936134 / rank @@
+Normal rank
@@ Property / cites work @@
+Complex probabilistic modeling with recursive relational Bayesian networks
+Normal rank
@@ Property / cites work @@
+Model-Theoretic Expressivity Analysis
@@ Property / cites work: Model-Theoretic Expressivity Analysis / rank @@
+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 @@
+Q3655273
@@ Property / cites work: Q3655273 / rank @@
+Normal rank
@@ Property / cites work @@
+Elements of finite model theory.
@@ Property / cites work: Elements of finite model theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Networks
@@ Property / cites work: Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3997653
@@ Property / cites work: Q3997653 / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic Horn abduction and Bayesian networks
+Normal rank
@@ Property / cites work @@
+Q2996258
@@ Property / cites work: Q2996258 / rank @@
+Normal rank
@@ Property / cites work @@
+Markov properties for mixed graphs
@@ Property / cites work: Markov properties for mixed graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Descriptive complexity of \(\#\)P functions
@@ Property / cites work: Descriptive complexity of \(\#\)P functions / rank @@
+Normal rank
@@ Property / cites work @@
+Q4663408
@@ Property / cites work: Q4663408 / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic Databases
@@ Property / cites work: Probabilistic Databases / rank @@
+Normal rank
@@ Property / cites work @@
+The polynomial-time hierarchy
@@ Property / cites work: The polynomial-time hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity classes defined by counting quantifiers
+Normal rank
@@ Property / cites work @@
+The complexity of combinatorial problems with succinct input representation
+Normal rank
@@ Property / Wikidata QID @@
+Q128019482
@@ Property / Wikidata QID: Q128019482 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.IJAR.2019.04.003
@@ Property / DOI: 10.1016/J.IJAR.2019.04.003 / rank @@
+Normal rank