A framework for building knowledge-bases under uncertainty
From MaRDI portal
Recommendations
Cites work
- A linear constraint satisfaction approach to cost-based abduction
- Approximating probabilistic inference in Bayesian belief networks is NP- hard
- Cost-based abduction and MAP explanation
- Exploiting case-based independence for approximating marginal probabilities
- Finding MAPs for belief networks is NP-hard
- scientific article; zbMATH DE number 48812 (Why is no real title available?)
- scientific article; zbMATH DE number 3560492 (Why is no real title available?)
- Hybrid algorithms for approximate belief updating in Bayes nets
- Modelling cyclicity and generalized cost-based abduction using linear constraint satisfaction
- Probabilistic logic
- The role of relevance in explanation. I: Irrelevance as statistical independence
- The role of relevance in explanation. II: Disjunctive assignments and approximate independence
Cited in
(10)- Implicitly preserving semantics during incremental knowledge base acquisition under uncertainty.
- Reasoning with BKBs -- algorithms and complexity
- Automatic emergence detection in complex systems
- Cost-based temporal reasoning
- Bayesian knowledge base tuning
- Verification and validation of Bayesian knowledge-bases
- scientific article; zbMATH DE number 4047188 (Why is no real title available?)
- THE SYSTEMIC FORMALIZATION OF KNOWLEDGE INVOLVING UNCERTAINTY
- scientific article; zbMATH DE number 2096815 (Why is no real title available?)
- scientific article; zbMATH DE number 4189238 (Why is no real title available?)
This page was built for publication: A framework for building knowledge-bases under uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4421246)