Generalized satisfiability for the description logic ALC

DOI10.1016/J.TCS.2013.02.009MaRDI QIDQ393137zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Arne Meier, Thomas Schneider

Publication date 16 January 2014

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2013.02.009

zbMATH Keywords

\(\mathcal{ALC}\)complexitydescription logicontologiesPost's latticesatisfiability

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Recommendations

• Generalized satisfiability for the description logic \(\mathcal{ALC}\) (extended abstract)
• On the complexity of (restricted) \(\mathcal{ALCI}r\)
• scientific article; zbMATH DE number 1405450
• PSpace Reasoning with the Description Logic ALCF(D)
• scientific article; zbMATH DE number 1500520

Cites work

• A practical decision method for propositional dynamic logic (preliminary report)
• Attributive concept descriptions with complements
• Automata-theoretic techniques for modal logics of programs
• Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
• Enumerating All Solutions for Constraint Satisfaction Problems
• EXPtime tableaux for ALC
• Generalized modal satisfiability
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1936671 (Why is no real title available?)
• Satisfiability problems for propositional calculi
• Tarskian set constraints
• Terminological reasoning is inherently intractable
• The complexity of concept languages
• The complexity of existential quantification in concept languages.
• The Complexity of Generalized Satisfiability for Linear Temporal Logic
• The complexity of propositional implication
• The complexity of satisfiability for fragments of hybrid logic. I.
• The complexity of satisfiability problems
• The DL-Lite Family and Relations
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
• Using automata theory for characterizing the semantics of terminological cycles

Cited in

(7)

• On the complexity of the clone membership problem
• On the complexity of (restricted) \(\mathcal{ALCI}r\)
• Generalized satisfiability for the description logic \(\mathcal{ALC}\) (extended abstract)
• A Bottom-Up Method for the Deterministic Horn Fragment of the Description Logic $\mathcal{ALC}$
• Extending \(\mathcal{ALCQIO}\) with trees
• scientific article; zbMATH DE number 1405450 (Why is no real title available?)
• Parametrised complexity of satisfiability in temporal logic

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

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