2017
DOI: 10.1007/978-3-319-68288-4_25
|View full text |Cite
|
Sign up to set email alerts
|

Attributed Description Logics: Ontologies for Knowledge Graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
18
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 11 publications
(18 citation statements)
references
References 16 publications
0
18
0
Order By: Relevance
“…We investigated the complexity of satisfiability and query answering in attributed DL-Lite R , for both the semantics introduced by Krötzsch et al (2017) and a new semantics based on provenance semirings, which allows to embed provenance polynomials into the query. In particular, we show that these problems are PSPACE-complete for the classical semantics and that in the case of simple ontologies, even query answering under the semirings-based semantics has the same complexity as query answering in DL-Lite R .…”
Section: Resultsmentioning
confidence: 99%
See 4 more Smart Citations
“…We investigated the complexity of satisfiability and query answering in attributed DL-Lite R , for both the semantics introduced by Krötzsch et al (2017) and a new semantics based on provenance semirings, which allows to embed provenance polynomials into the query. In particular, we show that these problems are PSPACE-complete for the classical semantics and that in the case of simple ontologies, even query answering under the semirings-based semantics has the same complexity as query answering in DL-Lite R .…”
Section: Resultsmentioning
confidence: 99%
“…The first section introduces attributed DL-Lite R , following the formalism given by Krötzsch et al (2017;. We then define attributed conjunctive queries and study the complexity of satisfiability and query answering in attributed DL-Lite R .…”
Section: While the Work Bymentioning
confidence: 99%
See 3 more Smart Citations