Answering regular path queries mediated by unrestricted \(\mathcal{SQ}\) ontologies

DOI10.1016/j.artint.2022.103808OpenAlexW4307046931MaRDI QIDQ2680773

Víctor Gutiérrez-Basulto, Filip Murlak, Yazmín Ibáñez-García, Jean Christoph Jung

Publication date: 4 January 2023

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2022.103808

zbMATH Keywords

description logicdata complexityontology-mediated query answeringnumber restrictions

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Uses Software

• nSPARQL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Logical foundations of information disclosure in ontology-based data integration
• Complexity of weak acceptance conditions in tree automata.
• Answering regular path queries in expressive description logics via alternating tree-automata
• Unary negation
• The Complexity of Answering Conjunctive and Navigational Queries over OWL 2 EL Knowledge Bases
• Regular Path Queries in Lightweight Description Logics: Complexity and Algorithms
• An Introduction to Description Logic
• Terminating Tableaux for $\mathcal{SOQ}$ with Number Restrictions on Transitive Roles
• Querying the Unary Negation Fragment with Regular Path Expressions.
• The two‐variable fragment with counting and equivalence
• How Many Legs Do I Have? Non-Simple Roles in Number Restrictions Revisited
• The Complexity of Conjunctive Query Answering in Expressive Description Logics
• The DL-Lite Family and Relations
• Query Answering with Transitive and Linear-Ordered Data
• Querying the Guarded Fragment with Transitivity
• STACS 2005

This page was built for publication: Answering regular path queries mediated by unrestricted \(\mathcal{SQ}\) ontologies