Imprecise probabilistic query answering using measures of ignorance and degree of satisfaction
From MaRDI portal
(Redirected from Publication:454147)
Recommendations
Cites work
- Anytime deduction for probabilistic logic
- Belief revision and information fusion on optimum entropy
- CLP( $\cal{BN}$ ): Constraint Logic Programming for Probabilistic Knowledge
- Combining probabilistic logic programming with the power of maximum entropy
- From information to probability: An axiomatic approach-Inference is information processing
- Logic Programming
- Logic Programming and Nonmonotonic Reasoning
- Nonmonotonic probabilistic logics under variable-strength inheritance with overriding: complexity, algorithms, and implementation
- Nonmonotonic reasoning, preferential models and cumulative logics
- On the measurability of knowledge acquisition and query processing.
- Probabilistic logic programming
- Probabilistic logic programming with conditional constraints
- Using histograms to better answer queries to probabilistic logic programs
- Weak nonmonotonic probabilistic logics
Cited in
(2)
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)