Tightly integrated probabilistic description logic programs for the Semantic Web

21Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a novel approach to probabilistic description logic programs for the Semantic Web, where a tight integration of disjunctive logic programs under the answer set semantics with description logics is generalized by probabilistic uncertainty. The approach has a number of nice features. In particular, it allows for a natural probabilistic data integration and for a natural representation of ontology mappings under probabilistic uncertainty and inconsistency. It also provides a natural integration of a situation-calculus based language for reasoning about actions with both description logics and probabilistic uncertainty. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Calì, A., & Lukasiewicz, T. (2007). Tightly integrated probabilistic description logic programs for the Semantic Web. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4670 LNCS, pp. 428–429). Springer Verlag. https://doi.org/10.1007/978-3-540-74610-2_30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free