On Monotonic Determinacy and Rewritability for Recursive Queries and Views
From MaRDI portal
(Redirected from Publication:5886523)
Cites work
- Back and forth between guarded and modal logics
- Can One Escape Red Chains?
- Datalog Rewritings of Regular Path Queries using Views
- Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems
- Determinacy and query rewriting for conjunctive queries and views
- Equivalence of Datalog queries is undecidable
- Generating plans from proofs. The interpolation-based approach to query reformulation
- Guarded negation
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- scientific article; zbMATH DE number 7104937 (Why is no real title available?)
- Many-dimensional modal logics: theory and applications
- Monadic Datalog, tree validity, and limited access containment
- On the equivalence of recursive and nonrecursive Datalog programs
- On the expressive power of Datalog: tools and a case study.
- On the Power of k-Consistency
- Principles and Practice of Constraint Programming – CP 2004
- Products of modal logics, part 1
- Querying visible and invisible information
- Recursive query plans for data integration
- Rewriting of regular expressions and regular path queries
- Selecting and using views to compute aggregate queries
- The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- View-based query processing: on the relationship between rewriting, answering and losslessness
This page was built for publication: On Monotonic Determinacy and Rewritability for Recursive Queries and Views
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5886523)
