Generalized satisfiability for the description logic \(\mathcal{ALC}\)
From MaRDI portal
Publication:393137
DOI10.1016/j.tcs.2013.02.009zbMath1301.68222OpenAlexW1724963320WikidataQ57998296 ScholiaQ57998296MaRDI QIDQ393137
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
Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Logics of knowledge and belief (including belief change) (03B42) Knowledge representation (68T30)
Related Items (3)
Parametrised Complexity of Satisfiability in Temporal Logic ⋮ Generalized Satisfiability for the Description Logic $\mathcal{ALC}$ ⋮ On the complexity of the clone membership problem
Cites Work
- Unnamed Item
- Unnamed Item
- The complexity of satisfiability for fragments of hybrid logic. I.
- 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
- Terminological reasoning is inherently intractable
- 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)
- Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
- The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
This page was built for publication: Generalized satisfiability for the description logic \(\mathcal{ALC}\)
