The following pages link to Barış Sertkaya (Q628339):
Displayed 12 items.
- On the complexity of enumerating pseudo-intents (Q628340) (← links)
- Understanding the complexity of axiom pinpointing in lightweight description logics (Q1680678) (← links)
- (Q2372192) (redirect page) (← links)
- Computing the least common subsumer w.r.t. a background terminology (Q2372193) (← links)
- (Q2970048) (← links)
- Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics (Q2999101) (← links)
- Usability Issues in Description Logic Knowledge Base Completion (Q3630233) (← links)
- Some Computational Problems Related to Pseudo-intents (Q3630240) (← links)
- Logics in Artificial Intelligence (Q5394140) (← links)
- On the Complexity of Computing Generators of Closed Sets (Q5445331) (← links)
- Concept Lattices (Q5901755) (← links)
- Mining ℰℒ⊥ Bases with Adaptable Role Depth (Q6135964) (← links)