Pages that link to "Item:Q1363785"
From MaRDI portal
The following pages link to The complexity of concept languages (Q1363785):
Displayed 16 items.
- Generalized satisfiability for the description logic \(\mathcal{ALC}\) (Q393137) (← links)
- Generalized modal satisfiability (Q988571) (← links)
- A refined architecture for terminological systems: Terminology = Schema + Views (Q1128645) (← links)
- An epistemic operator for description logics (Q1128772) (← links)
- A polynomial space construction of tree-like models for logics with local chains of modal connectives (Q1399966) (← links)
- EXPtime tableaux for ALC (Q1589576) (← links)
- Expressiveness of concept expressions in first-order description logics (Q1606296) (← links)
- The complexity of propositional linear temporal logics in simple cases (Q1854521) (← links)
- \(\mathcal{ALCQPI}_{R^+}\): rational grading in an expressive description logic with inverse and transitive roles and counting (Q2211383) (← links)
- Generalized Satisfiability for the Description Logic $\mathcal{ALC}$ (Q3010434) (← links)
- A PARAMETERIZED ALGORITHM TO EXPLORE FORMAL CONTEXTS WITH A TAXONOMY (Q3526977) (← links)
- Camelis: a logical information system to organise and browse a collection of documents (Q3631380) (← links)
- Ontologies and Databases: The DL-Lite Approach (Q3639004) (← links)
- Adding clauses to poor man's logic (without increasing the complexity) (Q3647233) (← links)
- Handling Spatial Relations in Logical Concept Analysis to Explore Geographical Data (Q5445340) (← links)
- 2-Exp Time lower bounds for propositional dynamic logics with intersection (Q5486241) (← links)