Imprecise probabilistic query answering using measures of ignorance and degree of satisfaction
From MaRDI portal
Publication:454147
DOI10.1007/S10472-012-9286-XzbMATH Open1261.68040OpenAlexW2046739253MaRDI QIDQ454147FDOQ454147
Authors: Anbu Yue, Weiru Liu, Anthony Hunter
Publication date: 1 October 2012
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-012-9286-x
Recommendations
Cites Work
- Nonmonotonic reasoning, preferential models and cumulative logics
- Belief revision and information fusion on optimum entropy
- Probabilistic logic programming
- Anytime deduction for probabilistic logic
- Combining probabilistic logic programming with the power of maximum entropy
- Weak nonmonotonic probabilistic logics
- On the measurability of knowledge acquisition and query processing.
- Probabilistic logic programming with conditional constraints
- Using histograms to better answer queries to probabilistic logic programs
- From information to probability: An axiomatic approach-Inference is information processing
- Logic Programming
- Logic Programming and Nonmonotonic Reasoning
- CLP( $\cal{BN}$ ): Constraint Logic Programming for Probabilistic Knowledge
- Nonmonotonic probabilistic logics under variable-strength inheritance with overriding: complexity, algorithms, and implementation
Cited In (2)
Uses Software
This page was built for publication: Imprecise probabilistic query answering using measures of ignorance and degree of satisfaction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q454147)