Pages that link to "Item:Q5172610"

The following pages link to Decidability of Circumscribed Description Logics Revisited (Q5172610):

Displaying 3 items.

• Query answering in circumscribed OWL2 profiles (Q825008) (← links)
• A polynomial time subsumption algorithm for nominal safe \(\mathcal{ELO}_\bot\) under rational closure (Q2224833) (← links)
• Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey (Q2970301) (← links)