Generalized Satisfiability for the Description Logic $\mathcal{ALC}$

DOI10.1007/978-3-642-20877-5_53zbMath1331.68113OpenAlexW2236535155WikidataQ57998317 ScholiaQ57998317MaRDI QIDQ3010434

Thomas Schneider, Arne Meier

Publication date: 1 July 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20877-5_53

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized satisfiability for the description logic \(\mathcal{ALC}\)
• Attributive concept descriptions with complements
• Generalized modal satisfiability
• The complexity of existential quantification in concept languages.
• The complexity of propositional implication
• Automata-theoretic techniques for modal logics of programs
• The complexity of concept languages
• Using automata theory for characterizing the semantics of terminological cycles
• EXPtime tableaux for ALC
• Tarskian set constraints
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• Terminological reasoning is inherently intractable
• The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I
• Enumerating All Solutions for Constraint Satisfaction Problems
• The Complexity of Generalized Satisfiability for Linear Temporal Logic
• The DL-Lite Family and Relations
• Satisfiability problems for propositional calculi
• The complexity of satisfiability problems
• A practical decision method for propositional dynamic logic (Preliminary Report)

This page was built for publication: Generalized Satisfiability for the Description Logic $\mathcal{ALC}$