Query Answering in Description Logics: The Knots Approach

DOI10.1007/978-3-642-02261-6_3zbMath1246.68207OpenAlexW1900343670MaRDI QIDQ3638272

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

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Related Items (7)

On the relation between SPARQL1.1 and Answer Set Programming ⋮ Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots ⋮ Ontology-Mediated Query Answering with Data-Tractable Description Logics ⋮ Reasoning and Query Answering in Description Logics ⋮ Answering regular path queries in expressive description logics via alternating tree-automata ⋮ Semantic DMN: Formalizing and Reasoning About Decisions in the Presence of Background Knowledge ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Data complexity of query answering in expressive description logics via tableaux
• A guide to completeness and complexity for modal logics of knowledge and belief
• Data-complexity of the two-variable fragment with counting quantifiers
• The complexity of finite model reasoning in description logics
• Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$
• The Complexity of Conjunctive Query Answering in Expressive Description Logics
• BDD-based decision procedures for the modal logic K ★
• Reasoning Using Knots
• Logic for Programming, Artificial Intelligence, and Reasoning

This page was built for publication: Query Answering in Description Logics: The Knots Approach