Local probabilistic deduction from taxonomic and probabilistic knowledge-bases over conjunctive events
DOI10.1016/S0888-613X(99)00006-7zbMATH Open0961.68135OpenAlexW1980191869WikidataQ126778512 ScholiaQ126778512MaRDI QIDQ1807597FDOQ1807597
Publication date: 9 February 2000
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0888-613x(99)00006-7
Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Trade models (91B60)
Cited In (14)
- Probabilistic logic under coherence, model-theoretic probabilistic logic, and default reasoning in SystemP
- An anytime deduction algorithm for the probabilistic logic and entailment problems
- Axiomatization of frequent itemsets
- Possibilistic logic: a retrospective and prospective view
- Title not available (Why is that?)
- Automatic derivation of probabilistic inference rules
- Merging the local and global approaches to probabilistic satisfiability
- Nonmonotonic probabilistic logics under variable-strength inheritance with overriding: complexity, algorithms, and implementation
- Itemset frequency satisfiability: complexity and axiomatization
- A general approach to reasoning with probabilities
- Weak nonmonotonic probabilistic logics
- Nonmonotonic probabilistic reasoning under variable-strength inheritance with overriding
- Combining probabilistic logic programming with the power of maximum entropy
- Probabilistic logic under coherence: complexity and algorithms
Recommendations
This page was built for publication: Local probabilistic deduction from taxonomic and probabilistic knowledge-bases over conjunctive events
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1807597)
