| Description logics F Baader, I Horrocks, U Sattler Foundations of Artificial Intelligence 3, 135-179, 2008 | 443 | 2008 |
| Description logics F Baader, I Horrocks, U Sattler Handbook on ontologies, 3-28, 2004 | 409 | 2004 |
| Completing Description Logic Knowledge Bases Using Formal Concept Analysis. F Baader, B Ganter, B Sertkaya, U Sattler IJCAI, 230-235, 2007 | 218 | 2007 |
| Completing Description Logic Knowledge Bases Using Formal Concept Analysis. F Baader, B Ganter, B Sertkaya, U Sattler IJCAI, 230-235, 2007 | 218 | 2007 |
| Computing the least common subsumer wrt a background terminology F Baader, B Sertkaya, AY Turhan Journal of Applied Logic 5 (3), 392-420, 2007 | 101 | 2007 |
| On the complexity of enumerating pseudo-intents F Distel, B Sertkaya Discrete Applied Mathematics 159 (6), 450-466, 2011 | 69 | 2011 |
| Applying formal concept analysis to description logics F Baader, B Sertkaya International Conference on Formal Concept Analysis, 261-286, 2004 | 59 | 2004 |
| 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 | 49 | 2004 |
| On the complexity of axiom pinpointing in the EL family of description logics R Penaloza, B Sertkaya Proceedings of the Twelfth International Conference on Principles of …, 2010 | 44 | 2010 |
| Understanding the complexity of axiom pinpointing in lightweight description logics R Penaloza, B Sertkaya Artificial Intelligence 250, 80-104, 2017 | 30 | 2017 |
| Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics. R Penaloza, B Sertkaya ECAI 215, 29-34, 2010 | 29 | 2010 |
| Ontocomp: A protege plugin for completing owl ontologies B Sertkaya European Semantic Web Conference, 898-902, 2009 | 27 | 2009 |
| Formal concept analysis methods for description logics B Sertkaya Verlag nicht ermittelbar, 2008 | 25 | 2008 |
| A Survey on how Description Logic Ontologies Benefit from FCA. B Sertkaya CLA, 2-21, 2010 | 22 | 2010 |
| Axiom Pinpointing is Hard. R Penaloza, B Sertkaya Description Logics 477, 2009 | 17 | 2009 |
| On the complexity of computing generators of closed sets M Hermann, B Sertkaya International Conference on Formal Concept Analysis, 158-168, 2008 | 17 | 2008 |
| Some computational problems related to pseudo-intents B Sertkaya International Conference on Formal Concept Analysis, 130-145, 2009 | 15 | 2009 |
| The ELepHant Reasoner System Description. B Sertkaya ORE, 87-93, 2013 | 14 | 2013 |
| Towards the complexity of recognizing pseudo-intents B Sertkaya International Conference on Conceptual Structures, 284-292, 2009 | 13 | 2009 |
| A survey on how description logic ontologies benefit from formal concept analysis B Sertkaya arXiv preprint arXiv:1107.2822, 2011 | 11 | 2011 |
Franz BaaderProfessor of Theoretical Computer Science, TU DresdenBestätigte E-Mail-Adresse bei tu-dresden.de
