Article3041: Unterschied zwischen den Versionen

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche
Veronika Thost (Diskussion | Beiträge)
(Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Veronika |ErsterAutorNachname=Thost }} {{Article |Referiert=1 |Title=Using Ontology-Based Data Access to Enable…“)
 
Veronika Thost (Diskussion | Beiträge)
Keine Bearbeitungszusammenfassung
Zeile 12: Zeile 12:
}}
}}
{{Publikation Details
{{Publikation Details
|Abstract=Ontologies may capture the terminology of an application domain and describe domain knowledge in a machine-processable way. Formal ontology languages, such as description logics, additionally provide semantics to these specifications. Systems for ontology-based data access (OBDA) may thus apply logical reasoning to answer queries over given data; they use the ontological knowledge to infer new information that is implicit in the data.  
|Abstract=Ontology-based data access (OBDA) augments classical query answering in databases by including domain knowledge provided by an ontology. An ontology captures the terminology of an application domain and describes domain knowledge in a machine-processable way. Formal ontology languages additionally provide semantics to these specifications. Systems for OBDA thus may apply logical reasoning to answer queries; they use the ontological knowledge to infer new information, which is only implicitly given in the data. Moreover, they usually employ the open-world assumption, which means that knowledge not stated explicitly in the data or inferred is neither assumed to be true nor false. Classical OBDA regards the knowledge however only w.r.t. a single moment, which means that information about time is not used for reasoning and hence lost; in particular, the queries generally cannot express temporal aspects.
The classical OBDA setting regards however only a single moment, which means that information about time is not used for reasoning, and the queries cannot express temporal aspects.
 
We investigate temporal query languages that allow to access temporal data through classical ontologies. In particular, we study the computational complexity of temporal query answering regarding ontologies written in lightweight description logics, which are known to allow for efficient reasoning in the atemporal setting and are successfully applied in practice. Furthermore, we present a so-called rewritability result for ontology-based temporal query answering, which suggests ways for implementation. Our results may thus guide the choice of a query language for temporal OBDA in data-intensive applications that require fast processing, such as context recognition.
We investigate temporal query languages that allow to access temporal data through classical ontologies. In particular, we study the computational complexity of temporal query answering regarding ontologies written in lightweight description logics, which are known to allow for efficient reasoning in the atemporal setting and are successfully applied in practice. Furthermore, we present a so-called rewritability result for ontology-based temporal query answering, which suggests ways for implementation. Our results may thus guide the choice of a query language for temporal OBDA in data-intensive applications that require fast processing.
|Projekt=Cfaed, HAEC, HAEC B02, HAEC B08
|Projekt=Cfaed, HAEC, HAEC B02, HAEC B08
|Forschungsgruppe=Automatentheorie, Wissensbasierte Systeme
|Forschungsgruppe=Automatentheorie, Wissensbasierte Systeme
}}
}}

Version vom 2. Oktober 2017, 10:31 Uhr

Toggle side column

Using Ontology-Based Data Access to Enable Context Recognition in the Presence of Incomplete Information (Extended Abstract)

Veronika ThostVeronika Thost
Using Ontology-Based Data Access to Enable Context Recognition in the Presence of Incomplete Information (Extended Abstract)


Veronika Thost
Using Ontology-Based Data Access to Enable Context Recognition in the Presence of Incomplete Information (Extended Abstract)
KI Journal, to appear
  • KurzfassungAbstract
    Ontology-based data access (OBDA) augments classical query answering in databases by including domain knowledge provided by an ontology. An ontology captures the terminology of an application domain and describes domain knowledge in a machine-processable way. Formal ontology languages additionally provide semantics to these specifications. Systems for OBDA thus may apply logical reasoning to answer queries; they use the ontological knowledge to infer new information, which is only implicitly given in the data. Moreover, they usually employ the open-world assumption, which means that knowledge not stated explicitly in the data or inferred is neither assumed to be true nor false. Classical OBDA regards the knowledge however only w.r.t. a single moment, which means that information about time is not used for reasoning and hence lost; in particular, the queries generally cannot express temporal aspects. We investigate temporal query languages that allow to access temporal data through classical ontologies. In particular, we study the computational complexity of temporal query answering regarding ontologies written in lightweight description logics, which are known to allow for efficient reasoning in the atemporal setting and are successfully applied in practice. Furthermore, we present a so-called rewritability result for ontology-based temporal query answering, which suggests ways for implementation. Our results may thus guide the choice of a query language for temporal OBDA in data-intensive applications that require fast processing, such as context recognition.
  • Projekt:Project: CfaedHAECHAEC B02HAEC B08
  • Forschungsgruppe:Research Group: AutomatentheorieAutomata TheoryWissensbasierte SystemeKnowledge-Based Systems
@article{T2017,
  author  = {Veronika Thost},
  title   = {Using Ontology-Based Data Access to Enable Context Recognition in
             the Presence of Incomplete Information (Extended Abstract)},
  journal = {KI Journal},
  year    = {2017},
  month   = {September}
}