Saved in:
| Main Authors: | Nourine, Lhouari, Petit, Jean Marc, Vilmin, Simon |
|---|---|
| Format: | Preprint |
| Published: |
2019
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/1909.12656 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Computing the $D$-base and $D$-relation in finite closure systems
by: Adaricheva, Kira, et al.
Published: (2024)
by: Adaricheva, Kira, et al.
Published: (2024)
Un cadre paraconsistant pour l'{é}valuation de similarit{é} dans les bases de connaissances
by: Medina, José-Luis Vilchis
Published: (2025)
by: Medina, José-Luis Vilchis
Published: (2025)
Characterizing the optimum bases of a convex geometry using quasi-closed hypergraphs
by: Meunier, Anthony, et al.
Published: (2026)
by: Meunier, Anthony, et al.
Published: (2026)
Half-space separation in monophonic convexity
by: Elaroussi, Mohammed, et al.
Published: (2024)
by: Elaroussi, Mohammed, et al.
Published: (2024)
Categorical Data Structures for Technical Computing
by: Patterson, Evan, et al.
Published: (2021)
by: Patterson, Evan, et al.
Published: (2021)
Representing Knowledge and Querying Data using Double-Functorial Semantics
by: Lambert, Michael, et al.
Published: (2024)
by: Lambert, Michael, et al.
Published: (2024)
Towards a Unification of Logic and Information Theory
by: Lastras, Luis A., et al.
Published: (2023)
by: Lastras, Luis A., et al.
Published: (2023)
Increasing the LLM Accuracy for Question Answering: Ontologies to the Rescue!
by: Allemang, Dean, et al.
Published: (2024)
by: Allemang, Dean, et al.
Published: (2024)
Towards Practicable Algorithms for Rewriting Graph Queries beyond DL-Lite
by: Löhnert, Bianca, et al.
Published: (2024)
by: Löhnert, Bianca, et al.
Published: (2024)
Completeness of Relational Algebra via Cylindric Algebra
by: Laštovička, Jan
Published: (2026)
by: Laštovička, Jan
Published: (2026)
A Trichotomy for Regular Trail Queries
by: Martens, Wim, et al.
Published: (2019)
by: Martens, Wim, et al.
Published: (2019)
Homomorphism Problems in Graph Databases and Automatic Structures
by: Morvan, Rémi
Published: (2025)
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)
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)
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)
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)
by: Figueira, Diego, et al.
Published: (2022)
The Weisfeiler-Leman Dimension of Conjunctive Queries
by: Göbel, Andreas, et al.
Published: (2023)
by: Göbel, Andreas, et al.
Published: (2023)
Rate-Distortion Theory for Deductive Sources under Closure Fidelity
by: Xu, Jianfeng
Published: (2026)
by: Xu, Jianfeng
Published: (2026)
A Truly Concurrent Semantics for Reversible CCS
by: Melgratti, Hernán, et al.
Published: (2023)
by: Melgratti, Hernán, et al.
Published: (2023)
Non-Transferability in Communication Channels and Tarski`s Truth Theorem
by: Naderian, Farhad
Published: (2022)
by: Naderian, Farhad
Published: (2022)
Lecture Notes on Algorithmic Information Theory
by: Bédard, Charles Alexandre
Published: (2025)
by: Bédard, Charles Alexandre
Published: (2025)
Queries With Exact Truth Values in Paraconsistent Description Logics
by: Bienvenu, Meghyn, et al.
Published: (2024)
by: Bienvenu, Meghyn, et al.
Published: (2024)
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)
Cost-Based Semantics for Querying Inconsistent Weighted Knowledge Bases
by: Bienvenu, Meghyn, et al.
Published: (2024)
by: Bienvenu, Meghyn, et al.
Published: (2024)
A Rule-Based Approach to Specifying Preferences over Conflicting Facts and Querying Inconsistent Knowledge Bases
by: Bienvenu, Meghyn, et al.
Published: (2025)
by: Bienvenu, Meghyn, et al.
Published: (2025)
Using ASP(Q) to Handle Inconsistent Prioritized Data
by: Bienvenu, Meghyn, et al.
Published: (2026)
by: Bienvenu, Meghyn, et al.
Published: (2026)
Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries
by: Kara, Ahmet, et al.
Published: (2019)
by: Kara, Ahmet, et al.
Published: (2019)
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)
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)
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)
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)
Disjunctions of Two Dependence Atoms
by: Fröhlich, Nicolas, et al.
Published: (2025)
by: Fröhlich, Nicolas, et al.
Published: (2025)
Fixpoint Semantics for DatalogMTL with Negation
by: Pollaci, Samuele
Published: (2026)
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)
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)
Guarded Negation Transitive Closure Logic
by: Figueira, Diego, et al.
Published: (2025)
by: Figueira, Diego, et al.
Published: (2025)
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)
Similar Items
-
Computing the $D$-base and $D$-relation in finite closure systems
by: Adaricheva, Kira, et al.
Published: (2024) -
Un cadre paraconsistant pour l'{é}valuation de similarit{é} dans les bases de connaissances
by: Medina, José-Luis Vilchis
Published: (2025) -
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) -
Categorical Data Structures for Technical Computing
by: Patterson, Evan, et al.
Published: (2021)