Jung, J.C. and Ryzhikov, Vladislav and Wolter, F. and Zakhariyashchev, Michael (2024) Extremal separation problems for Temporal Instance Queries. In: Larson, K. (ed.) Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence. AAAI, pp. 3448-3456. ISBN 9781956792041.
|
Text
_IJCAI-24.pdf - Published Version of Record Download (345kB) | Preview |
Abstract
The separation problem for a class $\mathcal{Q}$ of database queries is to find a query in $\mathcal{Q}$ that distinguishes between a given set of `positive' and `negative' data examples. Separation provides explanations of examples and underpins the query-by-example paradigm to support database users in constructing and refining queries. As the space of all separating queries can be large, it is helpful to succinctly represent this space by means of its most specific (logically strongest) and general (weakest) members. We investigate this extremal separation problem for classes of instance queries formulated in linear temporal logic LTL with the operators conjunction, `next', and `eventually'. Our results range from tight complexity bounds for verifying and counting extremal separators to algorithms computing them.
Metadata
| Item Type: | Book Section |
|---|---|
| Additional Information: | Jeju, Korea, 3-9 August 2024 |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Vladislav Ryzhikov |
| Date Deposited: | 18 Dec 2024 17:07 |
| Last Modified: | 18 Dec 2024 23:08 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/53585 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
