The following pages link to (Q4643956):
Displaying 4 items.
- A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\) (Q2144172) (← links)
- (Q4993594) (← links)
- Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs (Q5203794) (← links)
- The smallest hard trees (Q6073305) (← links)
