Generalized satisfiability for the description logic ALC (extended abstract)

DOI10.1007/978-3-642-20877-5_53MaRDI QIDQ3010434zbMATH OpenOpenAlexWikidataFDO

Authors Arne Meier, Thomas Schneider

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)

Recommendations

• Generalized satisfiability for the description logic \(\mathcal{ALC}\)
• Publication:4938424
• The complexity of finite model reasoning in description logics
• On the complexity of (restricted) \(\mathcal{ALCI}r\)
• scientific article; zbMATH DE number 1500520

Cites work

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

Cited in

(5)

• Generalized satisfiability for the description logic \(\mathcal{ALC}\)
• scientific article; zbMATH DE number 1405450 (Why is no real title available?)
• scientific article; zbMATH DE number 1765660 (Why is no real title available?)
• On the complexity of (restricted) \(\mathcal{ALCI}r\)
• Satisfiability and reasoning mechanism of terminological cycles in description logic v L

This page was built for publication: Generalized satisfiability for the description logic \(\mathcal{ALC}\) (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3010434)