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...
Main Authors: | Calì, A, Lukasiewicz, T, Predoiu, L, Stuckenschmidt, H |
---|---|
מחברים אחרים: | Spaccapietra, S |
פורמט: | Journal article |
שפה: | English |
יצא לאור: |
Springer
2009
|
פריטים דומים
-
Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web
מאת: Calì, A, et al.
יצא לאור: (2009) -
Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings.
מאת: Calì, A, et al.
יצא לאור: (2008) -
Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings
מאת: Calì, A, et al.
יצא לאור: (2008) -
Tightly integrated probabilistic description logic programs for representing ontology mappings.
מאת: Lukasiewicz, T, et al.
יצא לאור: (2011) -
Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings
מאת: Lukasiewicz, T, et al.
יצא לאור: (2011)