Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web.
We present a novel approach to probabilistic description logic programs for the Semantic Web in which disjunctive logic programs under the answer set semantics are tightly coupled with description logics and Bayesian probabilities. The approach has several nice features. In particular, it is a logic...
Huvudupphovsmän: | Calì, A, Lukasiewicz, T, Predoiu, L, Stuckenschmidt, H |
---|---|
Övriga upphovsmän: | Spaccapietra, S |
Materialtyp: | Journal article |
Språk: | English |
Publicerad: |
Springer
2009
|
Liknande verk
Liknande verk
-
Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web
av: Calì, A, et al.
Publicerad: (2009) -
Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings.
av: Calì, A, et al.
Publicerad: (2008) -
Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings
av: Calì, A, et al.
Publicerad: (2008) -
Tightly integrated probabilistic description logic programs for representing ontology mappings.
av: Lukasiewicz, T, et al.
Publicerad: (2011) -
Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings
av: Lukasiewicz, T, et al.
Publicerad: (2011)