P-CLASSIC: A tractable probabilistic description logic (1997) [67 citations — 4 self]
http://robotics.stanford.edu/~koller/papers/aaai97
http://www.cs.washington.edu/homes/alon/site/files
CACHED:
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Daphne Koller and Alon Levy and Avi Pfeffer},
title = {P-CLASSIC: A tractable probabilistic description logic},
booktitle = {In Proceedings of AAAI-97},
year = {1997},
pages = {390--397}
}
Years of Citing Articles
Bookmarks
OpenURL
Abstract:
Knowledge representation languages invariably reflect a trade-off between expressivity and tractability. Evidence suggests that the compromise chosen by description logics is a particularly successful one. However, description logic (as for all variants of first-order logic) is severely limited in its ability to express uncertainty. In this paper, we present P-CLASSIC, a probabilistic version of the description logic CLASSIC. In addition to terminological knowledge, the language utilizes Bayesian networks to express uncertainty about the basic properties of an individual, the number of fillers for its roles, and the properties of these fillers. We provide a semantics for P-CLASSIC and an effective inference procedure for probabilistic subsumption: computing the probability that a random individual in class C is also in class D. The effectiveness of the algorithm relies on independence assumptions and on our ability to execute lifted inference: reasoning about similar individuals as a ...
