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...
Κύριοι συγγραφείς: | 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, κ.ά.
Έκδοση: (2009) -
Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings.
ανά: Calì, A, κ.ά.
Έκδοση: (2008) -
Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings
ανά: Calì, A, κ.ά.
Έκδοση: (2008) -
Tightly integrated probabilistic description logic programs for representing ontology mappings.
ανά: Lukasiewicz, T, κ.ά.
Έκδοση: (2011) -
Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings
ανά: Lukasiewicz, T, κ.ά.
Έκδοση: (2011)