Fortin, Marie, Konev, Boris 
ORCID: 0000-0002-6507-0494, Ryzhikov, Vladislav, Savateev, Yury, Wolter, Frank ORCID: 0000-0002-4470-606X and Zakharyaschev, Michael
(2022)
Unique Characterisability and Learnability of Temporal Instance Queries.
In: 19th International Conference on Principles of Knowledge Representation and Reasoning {KR-2022}, 2022-7-31 - 2022-8-5.
|
PDF
KR22-with-appendix.pdf - Author Accepted Manuscript Download (526kB) | Preview |
Abstract
<jats:p>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 logic LTL that correspond to conjunctive queries (CQs) or extensions thereof induced by the until operator. Not all of these queries admit polynomial characterisations, but by imposing a further restriction to path-shaped queries we identify natural classes that do. We then investigate how far the obtained characterisations can be lifted to temporal knowledge graphs queried by 2D languages combining LTL with concepts in description logics EL or ELI (i.e., tree-shaped CQs). While temporal operators in the scope of description logic constructors can destroy polynomial characterisability, we obtain general transfer results for the case when description logic constructors are within the scope of temporal operators. Finally, we apply our characterisations to establish (polynomial) learnability of temporal instance queries using membership queries in the active learning framework.</jats:p>
| Item Type: | Conference or Workshop Item (Unspecified) |
|---|---|
| Depositing User: | Symplectic Admin |
| Date Deposited: | 05 Oct 2022 07:21 |
| Last Modified: | 27 Nov 2023 04:03 |
| DOI: | 10.24963/kr.2022/17 |
| Related URLs: | |
| URI: | https://livrepository.liverpool.ac.uk/id/eprint/3165198 |
Dimensions
Dimensions
