Automatic derivation of probabilistic inference rules
From MaRDI portal
Publication:5952206
DOI10.1016/S0888-613X(01)00044-5zbMath0984.68157MaRDI QIDQ5952206
Publication date: 14 May 2002
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0888-613x(01)00044-5
68T37: Reasoning under uncertainty in the context of artificial intelligence
68T35: Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence
Related Items
Possibilistic logic: a retrospective and prospective view, Itemset frequency satisfiability: complexity and axiomatization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic logic
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- Boole's logic and probability. A critical exposition from the standpoint of contemporary algebra, logic and probability theory
- Anytime deduction for probabilistic logic
- Local probabilistic deduction from taxonomic and probabilistic knowledge-bases over conjunctive events
- A logic for reasoning about probabilities
- XII. On the theory of probabilities
- Best Possible Inequalities for the Probability of a Logical Function of Events