On the complexity of propositional and relational credal networks
From MaRDI portal
(Redirected from Publication:518627)
Recommendations
Cites work
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 5296741 (Why is no real title available?)
- scientific article; zbMATH DE number 48344 (Why is no real title available?)
- scientific article; zbMATH DE number 3467028 (Why is no real title available?)
- scientific article; zbMATH DE number 1216123 (Why is no real title available?)
- scientific article; zbMATH DE number 740144 (Why is no real title available?)
- scientific article; zbMATH DE number 1493045 (Why is no real title available?)
- scientific article; zbMATH DE number 1753155 (Why is no real title available?)
- scientific article; zbMATH DE number 965572 (Why is no real title available?)
- 2U: an exact interval propagation algorithm for polytrees with binary variables
- Abducing through negation as failure: stable models within the independent choice logic
- Answering queries from context-sensitive probabilistic knowledge bases
- Credal networks
- Elements of finite model theory.
- Graphical models for imprecise probabilities
- Independence for full conditional probabilities: structure, factorization, non-uniqueness, and Bayesian networks
- Independent natural extension
- Inference and learning in probabilistic logic programs using weighted Boolean formulas
- Introduction to imprecise probabilities
- Logical and Relational Learning
- Modeling and Reasoning with Bayesian Networks
- PP is closed under intersection
- Probabilistic Horn abduction and Bayesian networks
- Probabilistic graphical models.
- Probabilistic logic programming
- Probabilistic logic programming with conditional constraints
- Probabilistic logic with independence
- Scalable uncertainty management. Second international conference, SUM 2008, Naples, Italy, October 1--3, 2008. Proceedings
- Sets of probability distributions, independence, and convexity
- Stochastic independence in a coherent setting
- The Complexity of Enumeration and Reliability Problems
- The colossal book of mathematics. Classic puzzles, paradoxes, and problems. Number theory, algebra, geometry, probability, topology, game theory, infinity and other topics of recreational mathematics
- The independent choice logic for modelling multiple agents under uncertainty
- The theory of interval-probability as a unifying concept for uncertainty
- Tightly integrated probabilistic description logic programs for representing ontology mappings
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Updating beliefs with incomplete observations
Cited in
(12)- Inference in credal networks: Branch-and-bound methods and the A/R+ algorithm
- Probabilistic inference in credal networks: new complexity results
- The effect of combination functions on the complexity of relational Bayesian networks
- Efficient computation of counterfactual bounds
- Markov conditions and factorization in logical credal networks
- Languages for probabilistic modeling over structured and relational domains
- The descriptive complexity of Bayesian network specifications
- Thirty years of credal networks: specification, algorithms and complexity
- The complexity of Bayesian networks specified by propositional and relational languages
- Tractable inference in credal sentential decision diagrams
- The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws
- Representations of uncertainty in AI: beyond probability and possibility
This page was built for publication: On the complexity of propositional and relational credal networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q518627)
