| Description logics F Baader, I Horrocks, U Sattler Foundations of Artificial Intelligence 3, 135-179, 2008 | 591 | 2008 |
| Completing description logic knowledge bases using formal concept analysis F Baader, B Ganter, U Sattler, B Sertkaya | 257 | 2006 |
| Computing the least common subsumer wrt a background terminology F Baader, B Sertkaya, AY Turhan Journal of Applied Logic 5 (3), 392-420, 2007 | 129 | 2007 |
| On the complexity of enumerating pseudo-intents F Distel, B Sertkaya Discrete Applied Mathematics 159 (6), 450-466, 2011 | 84 | 2011 |
| Applying formal concept analysis to description logics F Baader, B Sertkaya International Conference on Formal Concept Analysis, 261-286, 2004 | 78 | 2004 |
| Understanding the complexity of axiom pinpointing in lightweight description logics R Penaloza, B Sertkaya Artificial Intelligence 250, 80-104, 2017 | 56 | 2017 |
| Computing the least common subsumer wrt a background terminology F Baader, B Sertkaya, AY Turhan European Workshop on Logics in Artificial Intelligence, 400-412, 2004 | 56 | 2004 |
| On the Complexity of Axiom Pinpointing in the EL Family of Description Logics. R Penaloza, B Sertkaya KR 10, 280-289, 2010 | 51 | 2010 |
| A survey on how description logic ontologies benefit from formal concept analysis B Sertkaya arXiv preprint arXiv:1107.2822, 2011 | 44 | 2011 |
| OntoComP: A Protégé Plugin for Completing OWL Ontologies B Sertkaya European Semantic Web Conference, 898-902, 2009 | 36 | 2009 |
| Complexity of axiom pinpointing in the DL-Lite family of description logics R Penaloza, B Sertkaya ECAI 2010, 29-34, 2010 | 34 | 2010 |
| Formal concept analysis methods for description logics B Sertkaya | 26 | 2007 |
| On the complexity of computing generators of closed sets M Hermann, B Sertkaya International Conference on Formal Concept Analysis, 158-168, 2008 | 21 | 2008 |
| Some computational problems related to pseudo-intents B Sertkaya International Conference on Formal Concept Analysis, 130-145, 2009 | 20 | 2009 |
| Axiom pinpointing is hard R Penaloza, B Sertkaya Proceedings of the 22nd International Workshop on Description Logics (DL2009 …, 2009 | 20 | 2009 |
| The ELepHant Reasoner System Description. B Sertkaya ORE, 87-93, 2013 | 18 | 2013 |
| Towards the complexity of recognizing pseudo-intents B Sertkaya International Conference on Conceptual Structures, 284-292, 2009 | 17 | 2009 |
| Complexity of axiom pinpointing in the DL-Lite family R Penaloza, B Sertkaya CEUR WORKSHOP PROCEEDINGS 573, 173-184, 2010 | 13 | 2010 |
| OntoComP System Description. B Sertkaya Description Logics 477, 2009 | 11 | 2009 |
| Mining ℰℒ⊥ Bases with Adaptable Role Depth R Guimarães, A Ozaki, C Persia, B Sertkaya Journal of artificial intelligence research 76, 883-924, 2023 | 10 | 2023 |
Franz BaaderProfessor of Theoretical Computer Science, TU Dresden, and SCADS.AI Dresden/LeipzigVerified email at tu-dresden.de
