Capturing Homomorphism-Closed Decidable Queries with Existential Rules (Extended Abstract)
Research output: Contribution to book/conference proceedings/anthology/report › Conference contribution › Contributed › peer-review
Contributors
Abstract
Existential rules are a very popular ontology-mediated query language for which the chase represents a generic computational approach for query answering. It is straightforward that existential rule queries exhibiting chase termination are decidable and can only recognize properties that are preserved under homomorphisms. This paper is an extended abstract of our eponymous publication at KR 2021 where we show the converse: every decidable query that is closed under homomorphism can be expressed by an existential rule set for which the standard chase universally terminates. Membership in this fragment is not decidable, but we show via a diagonalisation argument that this is unavoidable.
Details
Original language | English |
---|---|
Title of host publication | Proceedings of the 31st International Joint Conference on Artificial Intelligence, IJCAI 2022 |
Editors | Luc De Raedt, Luc De Raedt |
Publisher | International Joint Conferences on Artificial Intelligence |
Pages | 5269-5273 |
Number of pages | 5 |
ISBN (electronic) | 978-1-956792-00-3 |
Publication status | Published - 2022 |
Peer-reviewed | Yes |
Publication series
Series | IJCAI International Joint Conference on Artificial Intelligence |
---|---|
ISSN | 1045-0823 |
Conference
Title | 31st International Joint Conference on Artificial Intelligence, IJCAI 2022 |
---|---|
Duration | 23 - 29 July 2022 |
City | Vienna |
Country | Austria |