Pages that link to "Item:Q2905394"
From MaRDI portal
The following pages link to The logical difference for the lightweight description logic \(\mathcal {EL}\) (Q2905394):
Displaying 11 items.
- Games for query inseparability of description logic knowledge bases (Q253977) (← links)
- Understanding the complexity of axiom pinpointing in lightweight description logics (Q1680678) (← links)
- On syntactic forgetting under uniform equivalence (Q2055801) (← links)
- On the limits of forgetting in answer set programming (Q2211850) (← links)
- Query inseparability for \(\mathcal{ALC}\) ontologies (Q2321290) (← links)
- Knowledge forgetting in propositional \(\mu\)-calculus (Q2679422) (← links)
- Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey (Q2970301) (← links)
- Comparison of Scoring and Order Approach in Description Logic $\mathcal{EL(D)}$ (Q3401123) (← links)
- (Q4558528) (← links)
- When you must forget: Beyond strong persistence when forgetting in answer set programming (Q4592710) (← links)
- (Q5283020) (← links)
