Answering regular path queries mediated by unrestricted SQ ontologies

DOI10.1016/J.ARTINT.2022.103808MaRDI QIDQ2680773zbMATH OpenOpenAlexFDO

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

Publication date 4 January 2023

Published in Artificial Intelligence (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

data complexitydescription logicnumber restrictionsontology-mediated query answering

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Cites work

• An introduction to description logic
• Answering regular path queries in expressive description logics via alternating tree-automata
• Complexity of weak acceptance conditions in tree automata.
• Conjunctive query answering for the description logic SHIQ
• Finite satisfiability of unary negation fragment with transitivity
• How Many Legs Do I Have? Non-Simple Roles in Number Restrictions Revisited
• scientific article; zbMATH DE number 3694622 (Why is no real title available?)
• Logical foundations of information disclosure in ontology-based data integration
• Query answering with transitive and linear-ordered data
• Querying the guarded fragment with transitivity
• Querying the unary negation fragment with regular path expressions
• Regular path queries in lightweight description logics: complexity and algorithms
• STACS 2005
• Terminating Tableaux for $\mathcal{SOQ}$ with Number Restrictions on Transitive Roles
• The complexity of answering conjunctive and navigational queries over OWL 2 EL knowledge bases
• The Complexity of Conjunctive Query Answering in Expressive Description Logics
• The DL-Lite Family and Relations
• The two-variable fragment with counting and equivalence
• Unary negation

Cited in

(4)

• scientific article; zbMATH DE number 1735826 (Why is no real title available?)
• Beyond \(\mathcal{ALC}_{\textsf{reg}} \): exploring non-regular extensions of PDL with description logics features
• Exploring non-regular extensions of propositional dynamic logic with description-logics features
• Finite-model reasoning for graph queries and description logics

Describes a project that uses

Uses Software

• nSPARQL

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2680773)