Skip to main content

Stratified Probabilistic Description Logic Programs

Thomas Lukasiewicz


In previous work, we have introduced probabilistic description logic programs (or pdl-programs), which are a combination of description logic programs (or dl-programs) under the answer set and well-founded semantics with Poole's independent choice logic. Such programs are directed towards sophisticated representation and reasoning techniques that allow for probabilistic uncertainty in the Rules, Logic, and Proof layers of the Semantic Web. In this paper, we continue this line of research. We concentrate on the special case of stratified probabilistic description logic programs (or spdl-programs). In particular, we present an algorithm for query processing in such pdl-programs, which is based on a reduction to computing the canonical model of stratified dl-programs.

Book Title
Proceedings of the ISWC Workshop on Uncertainty Reasoning for the Semantic Web‚ URSW 2005‚ Galway‚ Ireland‚ November 7‚ 2005
Paulo Cesar G. da Costa and Kathryn B. Laskey and Kenneth J. Laskey and Michael Pool