The recently introduced Datalog+/– family of tractable ontology languages is suitable for representing and reasoning over lightweight ontologies, such as EL and the DL-Lite family of description logics. In this paper, we explore the use of Datalog+/– for information integration based on probabilistic data exchange. More specifically, we study the previously introduced probabilistic data exchange problem consisting of a probabilistic database as a source, source-to-target mappings in Datalog+/– and a target Datalog+/– ontology. We provide a complexity analysis for deciding the existence of (deterministic and probabilistic (universal)) solutions in the context of data exchange. In particular, we show that tractability is preserved for simple ...
The recently introduced Datalog+/- family of ontology languages is especially useful for representin...
We apply the distribution semantics for probabilistic ontologies (named DISPONTE) to the Datalog+/- ...
We study the complexity of threshold query answering in the logical framework for probabilistic onto...
The recently introduced Datalog+⁄− family of tractable knowledge representation formalisms is able t...
We study the complexity of exchanging probabilistic data between ontology-based probabilistic databa...
We study the complexity of exchanging probabilistic data between ontology-based probabilistic databa...
We investigate the problem of exchanging probabilistic data between ontology-based probabilistic dat...
In previous work, we have introduced probabilistic description logic programs for the Semantic Web, ...
The Datalog+/- family of ontology languages is especially useful for representing and reasoning over...
Probabilistic description logic programs are a powerful tool for knowledge representation in the Sem...
The recently introduced Datalog+/- family of ontology languages is especially useful for representin...
In logic programming the distribution semantics is one of the most popular approaches for dealing wi...
Creating mappings between ontologies is a common way of approaching the semantic heterogeneity probl...
We present a framework for probabilistic Information Processing on the Semantic Web that is capable ...
Abstract. Creating mappings between ontologies is a common way of approaching the semantic heterogen...
The recently introduced Datalog+/- family of ontology languages is especially useful for representin...
We apply the distribution semantics for probabilistic ontologies (named DISPONTE) to the Datalog+/- ...
We study the complexity of threshold query answering in the logical framework for probabilistic onto...
The recently introduced Datalog+⁄− family of tractable knowledge representation formalisms is able t...
We study the complexity of exchanging probabilistic data between ontology-based probabilistic databa...
We study the complexity of exchanging probabilistic data between ontology-based probabilistic databa...
We investigate the problem of exchanging probabilistic data between ontology-based probabilistic dat...
In previous work, we have introduced probabilistic description logic programs for the Semantic Web, ...
The Datalog+/- family of ontology languages is especially useful for representing and reasoning over...
Probabilistic description logic programs are a powerful tool for knowledge representation in the Sem...
The recently introduced Datalog+/- family of ontology languages is especially useful for representin...
In logic programming the distribution semantics is one of the most popular approaches for dealing wi...
Creating mappings between ontologies is a common way of approaching the semantic heterogeneity probl...
We present a framework for probabilistic Information Processing on the Semantic Web that is capable ...
Abstract. Creating mappings between ontologies is a common way of approaching the semantic heterogen...
The recently introduced Datalog+/- family of ontology languages is especially useful for representin...
We apply the distribution semantics for probabilistic ontologies (named DISPONTE) to the Datalog+/- ...
We study the complexity of threshold query answering in the logical framework for probabilistic onto...