The following pages link to (Q4938425):
Displaying 13 items.
- PS\textsc{pace} tableau algorithms for acyclic modalized \({\mathcal{ALC}}\) (Q352965) (← links)
- Combining interval-based temporal reasoning with general TBoxes (Q814545) (← links)
- \({\mathcal E}\)-connections of abstract description systems (Q814594) (← links)
- A tableau algorithm for description logics with concrete domains and general TBoxes (Q877890) (← links)
- Automata can show PSpace results for description logics (Q948069) (← links)
- Computational complexity of terminological reasoning in BACK (Q1104128) (← links)
- Computing the least common subsumer w.r.t. a background terminology (Q2372193) (← links)
- Optimizing terminological reasoning for expressive description logics (Q2462645) (← links)
- Terminological reasoning is inherently intractable (Q2638816) (← links)
- Generalized Satisfiability for the Description Logic $\mathcal{ALC}$ (Q3010434) (← links)
- Description Logics (Q3638996) (← links)
- (Q4395024) (← links)
- Reasoning and Query Answering in Description Logics (Q4647812) (← links)