The following pages link to (Q4576256):
Displaying 7 items.
- A tableau algorithm for description logics with concrete domains and general TBoxes (Q877890) (← links)
- An algebraic view on p-admissible concrete domains for lightweight description logics (Q2055793) (← links)
- Using model theory to find decidable and tractable description logics with concrete domains (Q2090131) (← links)
- Description logics with concrete domains and general concept inclusions revisited (Q2096462) (← links)
- Matching in the Description Logic FL0 with respect to General TBoxes (Q5222946) (← links)
- Efficient TBox Reasoning with Value Restrictions using the <i>wer</i> Reasoner (Q6063879) (← links)
- First steps towards taming description logics with strings (Q6545544) (← links)