On monotonic determinacy and rewritability for recursive queries and views

IF 0.7 4区数学 Q3 COMPUTER SCIENCE, THEORY & METHODS

ACM Transactions on Computational Logic Pub Date : 2023-01-05 DOI:https://dl.acm.org/doi/10.1145/3572836

Michael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja, Miguel Romero

引用次数: 0

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 CQ views and queries [11, 30]. 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.

查看原文本刊更多论文

递归查询和视图的单调确定性和可重写性

如果Q可以表示为视图图像的单调函数，则查询Q是在一组视图V上单调确定的。在关系代数视图和查询的情况下，单调确定性与作为合取查询的联合的可重写性是一致的，并且在重要的特殊情况下是可判定的，例如对于CQ视图和查询[11,30]。我们研究了递归查询语言Datalog中视图和查询的情况。我们给出了确定单调确定性的能力的正反两个结果，以及单调确定性与数据可重写性的共同关系。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

ACM Transactions on Computational Logic 工程技术-计算机：理论方法

CiteScore

2.30

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： TOCL welcomes submissions related to all aspects of logic as it pertains to topics in computer science. This area has a great tradition in computer science. Several researchers who earned the ACM Turing award have also contributed to this field, namely Edgar Codd (relational database systems), Stephen Cook (complexity of logical theories), Edsger W. Dijkstra, Robert W. Floyd, Tony Hoare, Amir Pnueli, Dana Scott, Edmond M. Clarke, Allen E. Emerson, and Joseph Sifakis (program logics, program derivation and verification, programming languages semantics), Robin Milner (interactive theorem proving, concurrency calculi, and functional programming), and John McCarthy (functional programming and logics in AI). Logic continues to play an important role in computer science and has permeated several of its areas, including artificial intelligence, computational complexity, database systems, and programming languages. The Editorial Board of this journal seeks and hopes to attract high-quality submissions in all the above-mentioned areas of computational logic so that TOCL becomes the standard reference in the field. Both theoretical and applied papers are sought. Submissions showing novel use of logic in computer science are especially welcome.