Guarded Negation Transitive Closure Logic
Fuente:
arXiv
Saved in:
| Main Authors: | Figueira, Diego, Figueira, Santiago, Nakamura, Yoshiki |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
A Common Ancestor of PDL, Conjunctive Queries, and Unary Negation First-order
by: Figueira, Diego, et al.
Published: (2025)
by: Figueira, Diego, et al.
Published: (2025)
A Simple Algorithm for Consistent Query Answering under Primary Keys
by: Figueira, Diego, et al.
Published: (2023)
by: Figueira, Diego, et al.
Published: (2023)
Semantic Tree-Width and Path-Width of Conjunctive Regular Path Queries
by: Figueira, Diego, et al.
Published: (2022)
by: Figueira, Diego, et al.
Published: (2022)
Derivatives on Graphs for the Positive Calculus of Relations with Transitive Closure
by: Nakamura, Yoshiki
Published: (2024)
by: Nakamura, Yoshiki
Published: (2024)
Existential Calculi of Relations with Transitive Closure: Complexity and Edge Saturations
by: Nakamura, Yoshiki
Published: (2023)
by: Nakamura, Yoshiki
Published: (2023)
Logical Foundations and Complexity of 4QL, a Query Language with Unrestricted Negation
by: Maluszynski, Jan, et al.
Published: (2010)
by: Maluszynski, Jan, et al.
Published: (2010)
Fixpoint Semantics for DatalogMTL with Negation
by: Pollaci, Samuele
Published: (2026)
by: Pollaci, Samuele
Published: (2026)
Note on a Translation from First-Order Logic into the Calculus of Relations Preserving Validity and Finite Validity
by: Nakamura, Yoshiki
Published: (2023)
by: Nakamura, Yoshiki
Published: (2023)
Provenance Analysis and Semiring Semantics for First-Order Logic
by: Grädel, Erich, et al.
Published: (2024)
by: Grädel, Erich, et al.
Published: (2024)
Queries With Exact Truth Values in Paraconsistent Description Logics
by: Bienvenu, Meghyn, et al.
Published: (2024)
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)
by: van Bergerem, Steffen, et al.
Published: (2024)
Euler/X: A Toolkit for Logic-based Taxonomy Integration
by: Chen, Mingmin, et al.
Published: (2014)
by: Chen, Mingmin, et al.
Published: (2014)
Constructive Interpolation and Concept-Based Beth Definability for Description Logics via Sequents
by: Lyon, Tim S., et al.
Published: (2024)
by: Lyon, Tim S., 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)
by: Gatterbauer, Wolfgang
Published: (2024)
A Complete Propositional Dynamic Logic for Regular Expressions with Lookahead
by: Nakamura, Yoshiki
Published: (2026)
by: Nakamura, Yoshiki
Published: (2026)
Semiring Provenance for Lightweight Description Logics
by: Bourgaux, Camille, et al.
Published: (2023)
by: Bourgaux, Camille, et al.
Published: (2023)
Completeness of Relational Algebra via Cylindric Algebra
by: Laštovička, Jan
Published: (2026)
by: Laštovička, Jan
Published: (2026)
Guarded Successor: A Novel Temporal Logic
by: Asor, Ohad
Published: (2024)
by: Asor, Ohad
Published: (2024)
The Equational Theory of Relational Kleene Algebra with Graph Loop is PSPACE-Complete
by: Nakamura, Yoshiki
Published: (2025)
by: Nakamura, Yoshiki
Published: (2025)
Undecidability of the Emptiness Problem of Deterministic Propositional While Programs with Graph Loop: Hypothesis Elimination Using Loops
by: Nakamura, Yoshiki
Published: (2025)
by: Nakamura, Yoshiki
Published: (2025)
On the Finite Variable-Occurrence Fragment of the Calculus of Relations with Bounded Dot-Dagger Alternation
by: Nakamura, Yoshiki
Published: (2023)
by: Nakamura, Yoshiki
Published: (2023)
The Power of Negation in Higher-Order Datalog
by: Charalambidis, Angelos, et al.
Published: (2025)
by: Charalambidis, Angelos, et al.
Published: (2025)
Reaching Classicality through Transitive Closure
by: Blomet, Quentin, et al.
Published: (2025)
by: Blomet, Quentin, et al.
Published: (2025)
Restricted Chase Termination: You Want More than Fairness
by: Carral, David, et al.
Published: (2025)
by: Carral, David, et al.
Published: (2025)
Properties for Paths in Graph Databases
by: Orejas, Fernando, et al.
Published: (2025)
by: Orejas, Fernando, et al.
Published: (2025)
Disjunctions of Two Dependence Atoms
by: Fröhlich, Nicolas, et al.
Published: (2025)
by: Fröhlich, Nicolas, et al.
Published: (2025)
About the Multi-Head Linear Restricted Chase Termination
by: Gerlach, Lukas, et al.
Published: (2025)
by: Gerlach, Lukas, et al.
Published: (2025)
Database Research needs an Abstract Relational Query Language
by: Gatterbauer, Wolfgang, et al.
Published: (2025)
by: Gatterbauer, Wolfgang, et al.
Published: (2025)
Structural Indexing of Relational Databases for the Evaluation of Free-Connex Acyclic Conjunctive Queries
by: Riveros, Cristian, et al.
Published: (2026)
by: Riveros, Cristian, et al.
Published: (2026)
Using Color Refinement to Boost Enumeration and Counting for Acyclic CQs of Binary Schemas
by: Riveros, Cristian, et al.
Published: (2024)
by: Riveros, Cristian, et al.
Published: (2024)
Localized RETE for Incremental Graph Queries with Nested Graph Conditions
by: Barkowsky, Matthias, et al.
Published: (2024)
by: Barkowsky, Matthias, et al.
Published: (2024)
Work-Efficient Query Evaluation in Constant Time with PRAMs
by: Keppeler, Jens, et al.
Published: (2023)
by: Keppeler, Jens, et al.
Published: (2023)
Dichotomy for Axiomatising Inclusion Dependencies on K-Databases
by: Hannula, Miika, et al.
Published: (2026)
by: Hannula, Miika, et al.
Published: (2026)
Dung's Argumentation Framework: Unveiling the Expressive Power with Inconsistent Databases
by: Mahmood, Yasir, et al.
Published: (2024)
by: Mahmood, Yasir, et al.
Published: (2024)
Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries
by: Kara, Ahmet, et al.
Published: (2019)
by: Kara, Ahmet, et al.
Published: (2019)
Chase Termination Beyond Polynomial Time
by: Hanisch, Philipp, et al.
Published: (2024)
by: Hanisch, Philipp, et al.
Published: (2024)
Optimally Rewriting Formulas and Database Queries: A Confluence of Term Rewriting, Structural Decomposition, and Complexity
by: Chen, Hubie, et al.
Published: (2024)
by: Chen, Hubie, et al.
Published: (2024)
A Principled Solution to the Disjunction Problem of Diagrammatic Query Representations
by: Gatterbauer, Wolfgang
Published: (2024)
by: Gatterbauer, Wolfgang
Published: (2024)
Rule Rewriting Revisited: A Fresh Look at Static Filtering for Datalog and ASP
by: Hanisch, Philipp, et al.
Published: (2026)
by: Hanisch, Philipp, et al.
Published: (2026)
Robustness against Read Committed for Transaction Templates with Functional Constraints
by: Vandevoort, Brecht, et al.
Published: (2022)
by: Vandevoort, Brecht, et al.
Published: (2022)
Similar Items
-
A Common Ancestor of PDL, Conjunctive Queries, and Unary Negation First-order
by: Figueira, Diego, et al.
Published: (2025) -
A Simple Algorithm for Consistent Query Answering under Primary Keys
by: Figueira, Diego, et al.
Published: (2023) -
Semantic Tree-Width and Path-Width of Conjunctive Regular Path Queries
by: Figueira, Diego, et al.
Published: (2022) -
Derivatives on Graphs for the Positive Calculus of Relations with Transitive Closure
by: Nakamura, Yoshiki
Published: (2024) -
Existential Calculi of Relations with Transitive Closure: Complexity and Edge Saturations
by: Nakamura, Yoshiki
Published: (2023)