On Monotonic Determinacy and Rewritability for Recursive Queries and Views
From MaRDI portal
Publication:5886523
DOI10.1145/3572836OpenAlexW3011376106MaRDI QIDQ5886523
Michael Benedikt, Miguel Romero, Piotr Ostropolski-Nalewaja, Stanislav Kikot
Publication date: 5 April 2023
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.05898
Cites Work
- Unnamed Item
- Unnamed Item
- Determinacy and query rewriting for conjunctive queries and views
- Selecting and using views to compute aggregate queries
- On the equivalence of recursive and nonrecursive Datalog programs
- Rewriting of regular expressions and regular path queries
- View-based query processing: on the relationship between rewriting, answering and losslessness
- On the expressive power of Datalog: tools and a case study.
- Many-dimensional modal logics: theory and applications
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Generating Plans from Proofs: The Interpolation-based Approach to Query Reformulation
- Datalog Rewritings of Regular Path Queries using Views
- Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems
- Equivalence of Datalog queries is undecidable
- Products of modal logics, part 1
- The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable
- Querying Visible and Invisible Information
- Recursive query plans for data integration
- Monadic Datalog, Tree Validity, and Limited Access Containment
- Can One Escape Red Chains?
- On the Power of k-Consistency
- Back and forth between guarded and modal logics
- Guarded Negation
- Principles and Practice of Constraint Programming – CP 2004
This page was built for publication: On Monotonic Determinacy and Rewritability for Recursive Queries and Views
