Cover Image

Optimally Rewriting Formulas and Database Queries: A Confluence of Term Rewriting, Structural Decomposition, and Complexity

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chen, Hubie, Mengel, Stefan
Format:	Preprint
Published:	2024
Subjects:	Logic in Computer Science Databases
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Rewriting with Acyclic Queries: Mind Your Head
by: Geck, Gaetano, et al.
Published: (2022)

On Complexity Bounds and Confluence of Parallel Term Rewriting
by: Baudon, Thaïs, et al.
Published: (2023)

Towards Practicable Algorithms for Rewriting Graph Queries beyond DL-Lite
by: Löhnert, Bianca, et al.
Published: (2024)

Confluence of Logically Constrained Rewrite Systems Revisited
by: Schöpf, Jonas, et al.
Published: (2024)

Confluence of Conditional Rewriting Modulo
by: Lucas, Salvador
Published: (2025)

Rule Rewriting Revisited: A Fresh Look at Static Filtering for Datalog and ASP
by: Hanisch, Philipp, et al.
Published: (2026)

Confluence Criteria for Logically Constrained Rewrite Systems (Full Version)
by: Schöpf, Jonas, et al.
Published: (2023)

The Importance of Parameters in Database Queries
by: Gilad, Amir, et al.
Published: (2024)

Structural Indexing of Relational Databases for the Evaluation of Free-Connex Acyclic Conjunctive Queries
by: Riveros, Cristian, et al.
Published: (2026)

Automated Strategy Invention for Confluence of Term Rewrite Systems
by: Zhang, Liao, et al.
Published: (2024)

Database Research needs an Abstract Relational Query Language
by: Gatterbauer, Wolfgang, et al.
Published: (2025)

Rewriting Consistent Answers on Annotated Data
by: Kolaitis, Phokion G., et al.
Published: (2024)

Logical Foundations and Complexity of 4QL, a Query Language with Unrestricted Negation
by: Maluszynski, Jan, et al.
Published: (2010)

Database Querying under Missing Values Governed by Missingness Mechanisms
by: Bertossi, Leopoldo, et al.
Published: (2026)

From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity
by: Kassing, Jan-Christoph, et al.
Published: (2024)

Drag Rewriting
by: Dershowitz, Nachum, et al.
Published: (2024)

A Dependency Pair Framework for Relative Termination of Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2024)

Small Term Reachability and Related Problems for Terminating Term Rewriting Systems
by: Baader, Franz, et al.
Published: (2024)

A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2023)

Properties for Paths in Graph Databases
by: Orejas, Fernando, et al.
Published: (2025)

Rewriting and Inductive Reasoning
by: Hajdu, Márton, et al.
Published: (2024)

Templates in Rewriting Induction
by: Hagens, Kasper, et al.
Published: (2026)

Tree Rewriting Calculi for Strictly Positive Logics
by: Santiago-Fernández, Sofía, et al.
Published: (2025)

Dichotomy for Axiomatising Inclusion Dependencies on K-Databases
by: Hannula, Miika, et al.
Published: (2026)

A Principled Solution to the Disjunction Problem of Diagrammatic Query Representations
by: Gatterbauer, Wolfgang
Published: (2024)

Efficient Evaluation of Arbitrary Relational Calculus Queries
by: Raszyk, Martin, et al.
Published: (2022)

Dependency Pairs for Expected Innermost Runtime Complexity and Strong Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2025)

A Simple Algorithm for Consistent Query Answering under Primary Keys
by: Figueira, Diego, et al.
Published: (2023)

Equational Theories and Validity for Logically Constrained Term Rewriting (Full Version)
by: Aoto, Takahito, et al.
Published: (2024)

From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2023)

Partial Rewriting and Value Interpretation of Logically Constrained Terms (Full Version)
by: Aoto, Takahito, et al.
Published: (2026)

Work-Efficient Query Evaluation in Constant Time with PRAMs
by: Keppeler, Jens, et al.
Published: (2023)

Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries
by: Kara, Ahmet, et al.
Published: (2019)

A Common Ancestor of PDL, Conjunctive Queries, and Unary Negation First-order
by: Figueira, Diego, et al.
Published: (2025)

Dung's Argumentation Framework: Unveiling the Expressive Power with Inconsistent Databases
by: Mahmood, Yasir, et al.
Published: (2024)

Queries With Exact Truth Values in Paraconsistent Description Logics
by: Bienvenu, Meghyn, et al.
Published: (2024)

Learning Aggregate Queries Defined by First-Order Logic with Counting
by: van Bergerem, Steffen, et al.
Published: (2024)

Localized RETE for Incremental Graph Queries with Nested Graph Conditions
by: Barkowsky, Matthias, et al.
Published: (2024)

A Comprehensive Tutorial on over 100 Years of Diagrammatic Representations of Logical Statements and Relational Queries
by: Gatterbauer, Wolfgang
Published: (2024)

A Topological Rewriting of Tarski's Mereogeometry
by: Barlatier, Patrick, et al.
Published: (2025)