On the complexity of propositional and relational credal networks

DOI10.1016/j.ijar.2016.10.008zbMath1404.68161OpenAlexW2592942097WikidataQ62046509 ScholiaQ62046509MaRDI QIDQ518627

Fabio Gagliardi Cozman, Denis Deratani Mauá

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

zbMATH Keywords

propositional logiccomplexity theorycredal networksfunction-free first-order logic

Mathematics Subject Classification ID

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)

Related Items (1)

Thirty years of credal networks: specification, algorithms and complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sets of probability distributions, independence, and convexity
• Tightly integrated probabilistic description logic programs for representing ontology mappings
• Independent natural extension
• Answering queries from context-sensitive probabilistic knowledge bases
• Elements of finite model theory.
• Updating beliefs with incomplete observations
• Scalable uncertainty management. Second international conference, SUM 2008, Naples, Italy, October 1--3, 2008. Proceedings
• Probabilistic logic programming
• 2U: an exact interval propagation algorithm for polytrees with binary variables
• Probabilistic Horn abduction and Bayesian networks
• The independent choice logic for modelling multiple agents under uncertainty
• Credal networks
• Stochastic independence in a coherent setting
• The theory of interval-probability as a unifying concept for uncertainty
• PP is closed under intersection
• Independence for full conditional probabilities: structure, factorization, non-uniqueness, and Bayesian networks
• Probabilistic logic with independence
• Graphical models for imprecise probabilities
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• Logical and Relational Learning
• Probabilistic logic programming with conditional constraints
• Modeling and Reasoning with Bayesian Networks
• The Complexity of Enumeration and Reliability Problems
• Abducing through negation as failure: stable models within the independent choice logic
• Inference and learning in probabilistic logic programs using weighted Boolean formulas
• Introduction to Imprecise Probabilities

This page was built for publication: On the complexity of propositional and relational credal networks