Data complexity of query answering in expressive description logics via tableaux
From MaRDI portal
Publication:945056
DOI10.1007/S10817-008-9102-9zbMATH Open1154.68102OpenAlexW2135109168WikidataQ64360078 ScholiaQ64360078MaRDI QIDQ945056FDOQ945056
Magdalena Ortiz, Diego Calvanese, Thomas Eiter
Publication date: 10 September 2008
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-008-9102-9
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Conjunctive queries over trees
- Data complexity of query answering in description logics
- Combining deduction and model checking into tableaux and algorithms for converse-PDL.
- PSpace reasoning for graded modal logics
- Optimized Reasoning in Description Logics Using Hypertableaux
- An overview of tableau algorithms for description logics
- Reasoning on UML class diagrams
- Combining Horn rules and description logics in CARIN
- Logic for Programming, Artificial Intelligence, and Reasoning
- A tableau decision procedure for \(\mathcal{SHOIQ}\)
- A resolution-based decision procedure for \({\mathcal{SHOIQ}}\).
- Deduction in Concept Languages: from Subsumption to Instance Checking
Cited In (17)
- Data-complexity of the two-variable fragment with counting quantifiers
- Linking Data to Ontologies
- Reasoning and Query Answering in Description Logics
- Tractability and intractability of controlled languages for data access
- Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots
- View-based query answering in description logics: semantics and complexity
- Description Logics
- Hybrid logics and ontology languages
- Ontology-Mediated Query Answering with Data-Tractable Description Logics
- On the complexity of queries in the logical data model
- Query answering with DBoxes is hard
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Exploiting conjunctive queries in description logic programs
- Answering regular path queries in expressive description logics via alternating tree-automata
- Ontologies and Databases: The DL-Lite Approach
- Query Answering in Description Logics: The Knots Approach
- Title not available (Why is that?)
Uses Software
This page was built for publication: Data complexity of query answering in expressive description logics via tableaux
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q945056)
