Answering regular path queries in expressive description logics via alternating tree-automata
From MaRDI portal
Publication:2252521
Recommendations
- Regular path queries in lightweight description logics: complexity and algorithms
- The Complexity of Conjunctive Query Answering in Expressive Description Logics
- Data complexity of query answering in expressive description logics via tableaux
- The complexity of answering conjunctive and navigational queries over OWL 2 EL knowledge bases
- Query answering over description logic ontologies
Cites work
- scientific article; zbMATH DE number 1614719 (Why is no real title available?)
- scientific article; zbMATH DE number 3974280 (Why is no real title available?)
- scientific article; zbMATH DE number 67503 (Why is no real title available?)
- scientific article; zbMATH DE number 1223729 (Why is no real title available?)
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- scientific article; zbMATH DE number 1936671 (Why is no real title available?)
- scientific article; zbMATH DE number 1775458 (Why is no real title available?)
- scientific article; zbMATH DE number 2090317 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- scientific article; zbMATH DE number 2241907 (Why is no real title available?)
- A tableau decision procedure for \(\mathcal{SHOIQ}\)
- Alternating automata on infinite trees
- An automata theoretic decision procedure for the propositional mu- calculus
- Automata-theoretic techniques for modal logics of programs
- Cheap Boolean Role Constructors for Description Logics
- Combining Horn rules and description logics in CARIN
- Conjunctive query answering for the description logic SHIQ
- Conjunctive query containment and answering under description logic constraints
- Data Complexity in the $\mathcal{EL}$ Family of Description Logics
- Data complexity of query answering in expressive description logics via tableaux
- Decidability of SHIQ with complex role inclusion axioms
- Equivalence of Datalog queries is undecidable
- Logic for Programming, Artificial Intelligence, and Reasoning
- Nominals, inverses, counting, and conjunctive queries or: why infinity is your friend!
- PSpace reasoning for graded modal logics
- Propositional dynamic logic of regular programs
- Query Answering in Description Logics: The Knots Approach
- Reasoning in description logics by a reduction to disjunctive datalog
- Regular path queries with constraints
- Rewriting of regular expressions and regular path queries
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
- The Complexity of Enriched Mu-Calculi
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
Cited in
(9)- How to tell easy from hard: complexities of conjunctive query entailment in extensions of \(\mathcal{ALC}\)
- CTL^ with graded path modalities
- Presburger Büchi tree automata with applications to logics with expressive counting
- Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog
- Ontology-Mediated Query Answering with Data-Tractable Description Logics
- Querying the unary negation fragment with regular path expressions
- On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules
- Regular path queries in lightweight description logics: complexity and algorithms
- Answering regular path queries mediated by unrestricted \(\mathcal{SQ}\) ontologies
This page was built for publication: Answering regular path queries in expressive description logics via alternating tree-automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2252521)
