On the complexity of propositional and relational credal networks
DOI10.1016/J.IJAR.2016.10.008zbMATH Open1404.68161OpenAlexW2592942097WikidataQ62046509 ScholiaQ62046509MaRDI QIDQ518627FDOQ518627
Authors: Fabio Gagliardi Cozman, D. D. Maua 
Publication date: 29 March 2017
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2016.10.008
Recommendations
Analysis of algorithms and problem complexity (68Q25) Reasoning under uncertainty in the context of artificial intelligence (68T37) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Title not available (Why is that?)
- Probabilistic graphical models.
- Modeling and Reasoning with Bayesian Networks
- Title not available (Why is that?)
- Stochastic independence in a coherent setting
- The theory of interval-probability as a unifying concept for uncertainty
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Introduction to imprecise probabilities
- The Complexity of Enumeration and Reliability Problems
- Elements of finite model theory.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Updating beliefs with incomplete observations
- The independent choice logic for modelling multiple agents under uncertainty
- Probabilistic logic programming
- Probabilistic Horn abduction and Bayesian networks
- Sets of probability distributions, independence, and convexity
- Abducing through negation as failure: stable models within the independent choice logic
- Title not available (Why is that?)
- Inference and learning in probabilistic logic programs using weighted Boolean formulas
- Independent natural extension
- Credal networks
- PP is closed under intersection
- Graphical models for imprecise probabilities
- Logical and Relational Learning
- 2U: an exact interval propagation algorithm for polytrees with binary variables
- 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
- Tightly integrated probabilistic description logic programs for representing ontology mappings
- Title not available (Why is that?)
- Probabilistic logic programming with conditional constraints
- Scalable uncertainty management. Second international conference, SUM 2008, Naples, Italy, October 1--3, 2008. Proceedings
- Probabilistic logic with independence
- Independence for full conditional probabilities: structure, factorization, non-uniqueness, and Bayesian networks
- Title not available (Why is that?)
- Answering queries from context-sensitive probabilistic knowledge bases
Cited In (12)
- 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
- Representations of uncertainty in AI: beyond probability and possibility
- The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws
- Inference in credal networks: Branch-and-bound methods and the A/R+ algorithm
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)
