@article{ef596d2b80ae42f39d7b556d833421ec,
title = "On Monotonic Determinacy and Rewritability for Recursive Queries and Views",
abstract = "A query Q is monotonically determined over a set of views V if Q can be expressed as a monotonic function of the view image. In the case of relational algebra views and queries, monotonic determinacy coincides with rewritability as a union of conjunctive queries, and it is decidable in important special cases, such as for conjunctive query views and queries. We investigate the situation for views and queries in the recursive query language Datalog. We give both positive and negative results about the ability to decide monotonic determinacy, and also about the co-incidence of monotonic determinacy with Datalog rewritability.",
keywords = "Datalog, Views",
author = "Michael Benedikt and Stanislav Kikot and Piotr Ostropolski-Nalewaja and Miguel Romero",
note = "Funding Information: This research was funded in whole or in part by the Engineering and Physical Sciences Research Council, EP/M005852/1, EP/N014359/1, and P/L012138/1. For the purpose of Open Access, the author has applied a CC BY public copyright license to any Author Accepted Manuscript (AAM) version arising from this submission. P. Ostropolski-Nalewaja was supported by Polish National Science Centre (NCN) grant 2016/23/B/ST6/01438. M. Romero was funded by Fondecyt grant 11200956, the National Center for Artificial Intelligence CENIA FB210017, Basal ANID, and the Data Observatory Foundation. Publisher Copyright: {\textcopyright} 2023 Association for Computing Machinery.",
year = "2023",
month = mar,
day = "17",
doi = "10.1145/3572836",
language = "English",
volume = "24",
journal = "ACM Transactions on Computational Logic",
issn = "1529-3785",
publisher = "Association for Computing Machinery (ACM)",
number = "2",
}