Description logics F Baader, I Horrocks, U Sattler Foundations of Artificial Intelligence 3, 135-179, 2008 | 540 | 2008 |
Completing description logic knowledge bases using formal concept analysis F Baader, B Ganter, U Sattler, B Sertkaya IJCAI, 230-235, 2007 | 229 | 2007 |
Completing description logic knowledge bases using formal concept analysis F Baader, B Ganter, U Sattler, B Sertkaya IJCAI, 230-235, 2007 | 229 | 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 | 116 | 2007 |
On the complexity of enumerating pseudo-intents F Distel, B Sertkaya Discrete Applied Mathematics 159 (6), 450-466, 2011 | 76 | 2011 |
Applying formal concept analysis to description logics F Baader, B Sertkaya ICFCA, 261-286, 2004 | 63 | 2004 |
Computing the least common subsumer wrt a background terminology F Baader, B Sertkaya, AY Turhan Logics in Artificial Intelligence: 9th European Conference, JELIA 2004 …, 2004 | 51 | 2004 |
On the Complexity of Axiom Pinpointing in the EL Family of Description Logics. R Penaloza, B Sertkaya KR 10, 280-289, 2010 | 48 | 2010 |
Understanding the complexity of axiom pinpointing in lightweight description logics R Penaloza, B Sertkaya Artificial Intelligence 250, 80-104, 2017 | 47 | 2017 |
A survey on how description logic ontologies benefit from formal concept analysis B Sertkaya arXiv preprint arXiv:1107.2822, 2011 | 40 | 2011 |
Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics. R Penaloza, B Sertkaya ECAI 215, 29-34, 2010 | 31 | 2010 |
OntoComP: A Protégé Plugin for Completing OWL Ontologies B Sertkaya The Semantic Web: Research and Applications: 6th European Semantic Web …, 2009 | 30 | 2009 |
Formal concept analysis methods for description logics B Sertkaya Verlag nicht ermittelbar, 2008 | 24 | 2008 |
On the complexity of computing generators of closed sets M Hermann, B Sertkaya Formal Concept Analysis: 6th International Conference, ICFCA 2008, Montreal …, 2008 | 20 | 2008 |
The ELepHant Reasoner System Description. B Sertkaya ORE, 87-93, 2013 | 17 | 2013 |
Some computational problems related to pseudo-intents B Sertkaya Formal Concept Analysis: 7th International Conference, ICFCA 2009 Darmstadt …, 2009 | 17 | 2009 |
Axiom pinpointing is hard R Penaloza, B Sertkaya Proceedings of the 22nd International Workshop on Description Logics (DL2009 …, 2009 | 16 | 2009 |
Towards the complexity of recognizing pseudo-intents B Sertkaya Conceptual Structures: Leveraging Semantic Technologies: 17th International …, 2009 | 15 | 2009 |
Complexity of axiom pinpointing in the DL-Lite family R Penaloza, B Sertkaya 23rd International Workshop on Description Logics DL2010, 173, 2010 | 11 | 2010 |
Formal concept analysis for qualitative data analysis over triple stores F Dau, B Sertkaya Advances in Conceptual Modeling. Recent Developments and New Directions, 45-54, 2011 | 9 | 2011 |