scientific article; zbMATH DE number 7058774
From MaRDI portal
Publication:5377468
zbMath1421.68037arXiv1701.02231MaRDI QIDQ5377468
Cristina Feier, Antti Kuusisto, Carsten Lutz
Publication date: 24 May 2019
Full work available at URL: https://arxiv.org/abs/1701.02231
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Logic in artificial intelligence (68T27) Knowledge representation (68T30) Grammars and rewriting systems (68Q42) Logic programming (68N17)
Related Items (3)
A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\) ⋮ A tetrachotomy of ontology-mediated queries with a covering axiom ⋮ Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies
- Data complexity of query answering in description logics
- Tractable query answering and rewriting under description logic constraints
- Bounded width problems and algebras
- Universal graphs with forbidden subgraphs and algebraic closure
- Duality theorems for finite structures (characterising gaps and good characterisations)
- Datalog and constraint satisfaction with infinite templates
- On digraph coloring problems and treewidth duality
- Constraints, MMSNP and expander relational structures
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Parametrized complexity theory.
- The collapse of the bounded width hierarchy
- On the Complexity of MMSNP
- Ontology-Mediated Query Answering with Data-Tractable Description Logics
- Many Facets of Dualities
- An Introduction to Description Logic
- Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics (Invited Talk).
- Homomorphism preservation theorems
- Universal Structures and the logic of Forbidden Patterns
- Query Answering in Description Logics: The Knots Approach
- Ontologies and Databases: The DL-Lite Approach
- The DL-Lite Family and Relations
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- The Complexity of Boundedness for Guarded Logics
- A Step Up in Expressiveness of Decidable Fixpoint Logics
- Asking the Metaquestions in Constraint Tractability
- Ontology-Based Data Access
- Optimized Query Rewriting for OWL 2 QL
- Querying the Guarded Fragment with Transitivity
- A Characterisation of First-Order Constraint Satisfaction Problems
- Constraint Satisfaction, Logic and Forbidden Patterns
- Dualities for Constraint Satisfaction Problems
This page was built for publication:
