Finding New Diamonds : Temporal Minimal-World Query Answering over Sparse ABoxes
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
In: http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa2-785040
- Erschienen in
-
LTCS-Report ; 19-12
- Ereignis
-
Veröffentlichung
- (wo)
-
Dresden
- (wer)
-
Technische Universität Dresden
- (wann)
-
2023
- Urheber
- URN
-
urn:nbn:de:bsz:14-qucosa2-887820
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.0202, 06:20 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Borgwardt, Stefan
- Forkel, Walter
- Kovtunova, Alisa
- Technische Universität Dresden
Entstanden
- 2023
Ähnliche Objekte (12)
Temporal Query Answering in EL
Temporal Query Answering in DL-Lite with Negation
On the Complexity of Temporal Query Answering
Temporal Query Answering w.r.t. DL-Lite-Ontologies
Fuzzy description logics with general concept inclusions
Ontology-Mediated Query Answering over Log-Linear Probabilistic Data : Extended Version
Preferential Query Answering in the Semantic Web with Possibilistic Networks
Concise Justifications Versus Detailed Proofs for Description Logic Entailments
The Complexity of Fuzzy Description Logics over Finite Lattices with Nominals
Query Rewriting for DL-Lite with n-ary Concrete Domains : Extended Version
Consistency in Fuzzy Description Logics over Residuated De Morgan Lattices
Complementation and Inclusion of Weighted Automata on Infinite Trees : Revised Version
Temporal Query Answering in EL
Temporal Query Answering in DL-Lite with Negation
On the Complexity of Temporal Query Answering
Temporal Query Answering w.r.t. DL-Lite-Ontologies
Fuzzy description logics with general concept inclusions
Ontology-Mediated Query Answering over Log-Linear Probabilistic Data : Extended Version
Preferential Query Answering in the Semantic Web with Possibilistic Networks
Concise Justifications Versus Detailed Proofs for Description Logic Entailments
The Complexity of Fuzzy Description Logics over Finite Lattices with Nominals
Query Rewriting for DL-Lite with n-ary Concrete Domains : Extended Version
Consistency in Fuzzy Description Logics over Residuated De Morgan Lattices
Complementation and Inclusion of Weighted Automata on Infinite Trees : Revised Version
Temporal Query Answering in EL
Temporal Query Answering in DL-Lite with Negation
On the Complexity of Temporal Query Answering
Temporal Query Answering w.r.t. DL-Lite-Ontologies
Fuzzy description logics with general concept inclusions
Ontology-Mediated Query Answering over Log-Linear Probabilistic Data : Extended Version
Preferential Query Answering in the Semantic Web with Possibilistic Networks
Concise Justifications Versus Detailed Proofs for Description Logic Entailments
The Complexity of Fuzzy Description Logics over Finite Lattices with Nominals
Query Rewriting for DL-Lite with n-ary Concrete Domains : Extended Version
Consistency in Fuzzy Description Logics over Residuated De Morgan Lattices