Efficient Global Probabilistic Deduction from Taxonomic and Probabilistic Knowledge−Bases over Conjunctive Events
We present a new, efficient linear programming approach to probabilistic deduction from probabilistic knowledge bases over conjunctive events. We show that this approach enables us to solve the classical problem of probabilistic deduction along a chain of basic events in polynomial time in the length of the chain. We then elaborate how taxonomic knowledge can be exploited in our new approach for an increased efficiency. We also present important new results for the classical linear programming approach to probabilistic deduction under taxonomic knowledge.
Proceedings of the 6th International Conference on Information and Knowledge Management‚ CIKM 1997‚ Las Vegas‚ Nevada‚ November 10−14‚ 1997
Forouzan Golshani and Kia Makki