Cover Image

Towards declarative comparabilities: application to functional dependencies

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Nourine, Lhouari, Petit, Jean Marc, Vilmin, Simon
Format:	Preprint
Published:	2019
Subjects:	Logic in Computer Science Databases Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Un cadre paraconsistant pour l'{é}valuation de similarit{é} dans les bases de connaissances
by: Medina, José-Luis Vilchis
Published: (2025)

Computing the $D$-base and $D$-relation in finite closure systems
by: Adaricheva, Kira, et al.
Published: (2024)

Categorical Data Structures for Technical Computing
by: Patterson, Evan, et al.
Published: (2021)

Representing Knowledge and Querying Data using Double-Functorial Semantics
by: Lambert, Michael, et al.
Published: (2024)

Characterizing the optimum bases of a convex geometry using quasi-closed hypergraphs
by: Meunier, Anthony, et al.
Published: (2026)

Half-space separation in monophonic convexity
by: Elaroussi, Mohammed, et al.
Published: (2024)

Towards a Unification of Logic and Information Theory
by: Lastras, Luis A., et al.
Published: (2023)

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

Completeness of Relational Algebra via Cylindric Algebra
by: Laštovička, Jan
Published: (2026)

Increasing the LLM Accuracy for Question Answering: Ontologies to the Rescue!
by: Allemang, Dean, et al.
Published: (2024)

A Trichotomy for Regular Trail Queries
by: Martens, Wim, et al.
Published: (2019)

Homomorphism Problems in Graph Databases and Automatic Structures
by: Morvan, Rémi
Published: (2025)

Complex event recognition under time constraints: towards a formal framework for efficient query evaluation
by: García, Julián, et al.
Published: (2025)

FC-Datalog as a Framework for Efficient String Querying
by: Bell, Owen M., et al.
Published: (2025)

A formal query language and automata model for aggregation in complex event recognition
by: Bourhis, Pierre, et al.
Published: (2026)

Semantic Tree-Width and Path-Width of Conjunctive Regular Path Queries
by: Figueira, Diego, et al.
Published: (2022)

The Weisfeiler-Leman Dimension of Conjunctive Queries
by: Göbel, Andreas, et al.
Published: (2023)

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

Restricted Chase Termination: You Want More than Fairness
by: Carral, David, et al.
Published: (2025)

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

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

Learning Aggregate Queries Defined by First-Order Logic with Counting
by: van Bergerem, Steffen, 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)

Disjunctions of Two Dependence Atoms
by: Fröhlich, Nicolas, et al.
Published: (2025)

Fixpoint Semantics for DatalogMTL with Negation
by: Pollaci, Samuele
Published: (2026)

Structural Indexing of Relational Databases for the Evaluation of Free-Connex Acyclic Conjunctive Queries
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)

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

Guarded Negation Transitive Closure Logic
by: Figueira, Diego, et al.
Published: (2025)

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

Dichotomy for Axiomatising Inclusion Dependencies on K-Databases
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)

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

Chase Termination Beyond Polynomial Time
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)

About the Multi-Head Linear Restricted Chase Termination
by: Gerlach, Lukas, et al.
Published: (2025)

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

Euler/X: A Toolkit for Logic-based Taxonomy Integration
by: Chen, Mingmin, et al.
Published: (2014)

A Principled Solution to the Disjunction Problem of Diagrammatic Query Representations
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)