How to tell easy from hard: complexities of conjunctive query entailment in extensions of \(\mathcal{ALC}\)

DOI10.1613/jair.1.14482MaRDI QIDQ6535408

Bartosz Bednarczyk, Sebastian Rudolph

Publication date: 20 December 2023

Published in: The Journal of Artificial Intelligence Research (JAIR) (Search for Journal in Brave)

zbMATH Keywords

automated reasoningdescription logicsquerydatabasesintelligent databases

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots
• Modal languages and bounded fragments of predicate logic
• A new description logic with set constraints and cardinality constraints on role successors
• Modal and guarded characterisation theorems over finite transition systems
• Exploiting forwardness: satisfiability and query-entailment in forward guarded fragment
• Answering regular path queries in expressive description logics via alternating tree-automata
• Decision procedures and expressiveness in the temporal logic of branching time
• Complexity of modal logics with Presburger constraints
• An Introduction to Description Logic
• The Complexity of Enriched Mu-Calculi
• The Complexity of Conjunctive Query Answering in Expressive Description Logics
• Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
• Alternation
• Reasoning and Query Answering in Description Logics
• On the Restraining Power of Guards
• Coalgebraic Reasoning with Global Assumptions in Arithmetic Modal Logics
• Towards Statistical Reasoning in Description Logics over Finite Domains
• Querying the Guarded Fragment
• Guarded Negation

This page was built for publication: How to tell easy from hard: complexities of conjunctive query entailment in extensions of \(\mathcal{ALC}\)