Imprecise probabilistic query answering using measures of ignorance and degree of satisfaction
From MaRDI portal
Publication:454147
DOI10.1007/s10472-012-9286-xzbMath1261.68040OpenAlexW2046739253MaRDI QIDQ454147
Weiru Liu, Anthony Hunter, Anbu Yue
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
Related Items (2)
A distance-based framework for inconsistency-tolerant reasoning and inconsistency measurement in DL-Lite ⋮ Unnamed Item
Uses Software
Cites Work
- Combining probabilistic logic programming with the power of maximum entropy
- Nonmonotonic probabilistic logics under variable-strength inheritance with overriding: complexity, algorithms, and implementation
- Nonmonotonic reasoning, preferential models and cumulative logics
- Probabilistic logic programming
- Anytime deduction for probabilistic logic
- On the measurability of knowledge acquisition and query processing.
- Weak nonmonotonic probabilistic logics
- Belief revision and information fusion on optimum entropy
- 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
This page was built for publication: Imprecise probabilistic query answering using measures of ignorance and degree of satisfaction
