Zobrazeno 1 - 10
of 147
pro vyhledávání: '"Carsten Lutz"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 19, Issue 3 (2023)
We study the complexity of answer counting for ontology-mediated queries and for querying under constraints, considering conjunctive queries and unions thereof (UCQs) as the query language and guarded TGDs as the ontology and constraint language, res
Externí odkaz:
https://doaj.org/article/ff8e55450c5a457e9eccfc63a2e5f3c7
Publikováno v:
Logical Methods in Computer Science, Vol Volume 15, Issue 3 (2019)
In the context of ontology-mediated querying with description logics (DLs), we study the data complexity of queries in which selected predicates can be closed (OMQCs). We provide a non-uniform analysis, aiming at a classification of the complexity in
Externí odkaz:
https://doaj.org/article/2e8d9838c4c74994b086541091dbf03e
Publikováno v:
Logical Methods in Computer Science, Vol Volume 15, Issue 2 (2019)
We study rewritability of monadic disjunctive Datalog programs, (the complements of) MMSNP sentences, and ontology-mediated queries (OMQs) based on expressive description logics of the ALC family and on conjunctive queries. We show that rewritability
Externí odkaz:
https://doaj.org/article/d9432505a022457bb7a7ae3703b9163f
Autor:
Carsten Lutz, Frank Wolter
Publikováno v:
Logical Methods in Computer Science, Vol Volume 13, Issue 4 (2017)
We analyze the data complexity of ontology-mediated querying where the ontologies are formulated in a description logic (DL) of the ALC family and queries are conjunctive queries, positive existential queries, or acyclic conjunctive queries. Our appr
Externí odkaz:
https://doaj.org/article/556db47a82e447af9f5f35b6f0a8acf2
Publikováno v:
Logical Methods in Computer Science, Vol Volume 4, Issue 3 (2008)
The fully enriched μ-calculus is the extension of the propositional μ-calculus with inverse programs, graded modalities, and nominals. While satisfiability in several expressive fragments of the fully enriched μ-calculus is known to be decidable a
Externí odkaz:
https://doaj.org/article/f6b6cc73cb564a52aa375359579cb308
Autor:
Carsten Lutz, Frank Wolter
Publikováno v:
Logical Methods in Computer Science, Vol Volume 2, Issue 2 (2006)
Logical formalisms for reasoning about relations between spatial regions play a fundamental role in geographical information systems, spatial and constraint databases, and spatial reasoning in AI. In analogy with Halpern and Shoham's modal logic of t
Externí odkaz:
https://doaj.org/article/23b5f85e9d6c41aaa56f6c2b3ac1fff1
Publikováno v:
AAAI
We study two forms of least general generalizations in description logic, the least common subsumer (LCS) and most specific concept (MSC). While the LCS generalizes from examples that take the form of concepts, the MSC generalizes from individuals in
Publikováno v:
KR
We introduce and study several notions of approximation for ontology-mediated queries based on the description logics ALC and ALCI. Our approximations are of two kinds: we may (1) replace the ontology with one formulated in a tractable ontology langu
Publikováno v:
IJCAI
Scopus-Elsevier
Scopus-Elsevier
We consider the problem to learn a concept or a query in the presence of an ontology formulated in the description logic ELr, in Angluin's framework of active learning that allows the learning algorithm to interactively query an oracle (such as a dom
Autor:
Carsten Lutz, Leif Sabellek
Publikováno v:
Artificial Intelligence. 308:103709