Query Answering in Description Logics: The Knots Approach
From MaRDI portal
Publication:3638272
DOI10.1007/978-3-642-02261-6_3zbMATH Open1246.68207OpenAlexW1900343670MaRDI QIDQ3638272FDOQ3638272
Carsten Lutz, Thomas Eiter, Magdalena Ortiz, Mantas Šimkus
Publication date: 2 July 2009
Published in: Logic, Language, Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02261-6_3
Cites Work
- Modal logic
- Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$
- A guide to completeness and complexity for modal logics of knowledge and belief
- BDD-based decision procedures for the modal logic K ★
- The complexity of finite model reasoning in description logics
- Title not available (Why is that?)
- Reasoning Using Knots
- Logic for Programming, Artificial Intelligence, and Reasoning
- Data complexity of query answering in expressive description logics via tableaux
- The Complexity of Conjunctive Query Answering in Expressive Description Logics
- Data-complexity of the two-variable fragment with counting quantifiers
Cited In (7)
- On the relation between SPARQL1.1 and Answer Set Programming
- Semantic DMN: Formalizing and Reasoning About Decisions in the Presence of Background Knowledge
- Reasoning and Query Answering in Description Logics
- Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots
- Ontology-Mediated Query Answering with Data-Tractable Description Logics
- Answering regular path queries in expressive description logics via alternating tree-automata
- Title not available (Why is that?)
This page was built for publication: Query Answering in Description Logics: The Knots Approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638272)
