Local probabilistic deduction from taxonomic and probabilistic knowledge-bases over conjunctive events

DOI10.1016/S0888-613X(99)00006-7zbMath0961.68135OpenAlexW1980191869WikidataQ126778512 ScholiaQ126778512MaRDI QIDQ1807597

Thomas Lukasiewicz

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

zbMATH Keywords

inference rulesknowledge-basesprobabilistic deduction

Mathematics Subject Classification ID

Trade models (91B60) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Related Items (14)

Probabilistic logic under coherence: complexity and algorithms ⋮ Possibilistic logic: a retrospective and prospective view ⋮ Nonmonotonic probabilistic logics under variable-strength inheritance with overriding: complexity, algorithms, and implementation ⋮ Weak nonmonotonic probabilistic logics ⋮ An anytime deduction algorithm for the probabilistic logic and entailment problems ⋮ Itemset frequency satisfiability: complexity and axiomatization ⋮ Merging the local and global approaches to probabilistic satisfiability ⋮ Automatic derivation of probabilistic inference rules ⋮ A general approach to reasoning with probabilities ⋮ Probabilistic logic under coherence, model-theoretic probabilistic logic, and default reasoning in SystemP ⋮ Unnamed Item ⋮ Nonmonotonic probabilistic reasoning under variable-strength inheritance with overriding ⋮ Axiomatization of frequent itemsets ⋮ Combining probabilistic logic programming with the power of maximum entropy

This page was built for publication: Local probabilistic deduction from taxonomic and probabilistic knowledge-bases over conjunctive events