Zobrazeno 1 - 10
of 689
pro vyhledávání: '"Frank Wolter"'
Autor:
Simonis, Udo E.
Internationales Asienforum, Bd. 9 Nr. 3-4 (1978): Internationales Asienforum
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d998876990e6fea792a963a5d1231233
Autor:
Hainsworth, G. B.
Publikováno v:
Pacific Affairs, 1977 Dec 01. 50(4), 733-735.
Externí odkaz:
https://www.jstor.org/stable/2757872
Autor:
POULALION, Gabriel
Publikováno v:
Revue d'économie politique, 1984 May 01. 94(3), 419-420.
Externí odkaz:
https://www.jstor.org/stable/24697986
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
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
Autor:
Alessandro Artale, Roman Kontchakov, Alisa Kovtunova, Vladislav Ryzhikov, Frank Wolter, Michael Zakharyaschev
Publikováno v:
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence.
We argue that linear temporal logic LTL in tandem with monadic first-order logic can be used as a ba- sic language for ontology-based access to tempo- ral data and obtain a classification of the resulting ontology-mediated queries according to the ty
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 35:6193-6201
The Craig interpolation property (CIP) states that an interpolant for an implication exists iff it is valid. The projective Beth definability property (PBDP) states that an explicit definition exists iff a formula stating implicit definability is val
Autor:
Marie Fortin, Boris Konev, Vladislav Ryzhikov, Yury Savateev, Frank Wolter, Michael Zakharyaschev
We aim to determine which temporal instance queries can be uniquely characterised by a (polynomial-size) set of positive and negative temporal data examples. We start by considering queries formulated in fragments of propositional linear temporal log
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ffad6c44f86b04ca4de1426cdfab6460
http://arxiv.org/abs/2205.01651
http://arxiv.org/abs/2205.01651
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
Autor:
Vladislav Ryzhikov, Alessandro Artale, Michael Zakharyaschev, Frank Wolter, Roman Kontchakov, Alisa Kovtunova
Publikováno v:
Artificial Intelligence
We investigate ontology-based data access to temporal data. We consider temporal ontologies given in linear temporal logic LTL interpreted over discrete time ( Z , ) . Queries are given in LTL or MFO ( ) , monadic first-order logic with a built-in li
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0e6b11e6db2004f78f062b5bde178a9d
https://eprints.bbk.ac.uk/id/eprint/44873/1/LTL-main.pdf
https://eprints.bbk.ac.uk/id/eprint/44873/1/LTL-main.pdf