Follow
Baris Sertkaya
Baris Sertkaya
Professor of Computer Science, Frankfurt University of Applied Sciences
Verified email at fb2.fra-uas.de - Homepage
Title
Cited by
Cited by
Year
Description logics
F Baader, I Horrocks, U Sattler
Foundations of Artificial Intelligence 3, 135-179, 2008
5102008
Completing Description Logic Knowledge Bases Using Formal Concept Analysis.
F Baader, B Ganter, B Sertkaya, U Sattler
IJCAI, 230-235, 2007
2282007
Completing Description Logic Knowledge Bases Using Formal Concept Analysis.
F Baader, B Ganter, B Sertkaya, U Sattler
IJCAI, 230-235, 2007
2282007
Computing the least common subsumer wrt a background terminology
F Baader, B Sertkaya, AY Turhan
Journal of Applied Logic 5 (3), 392-420, 2007
1082007
On the complexity of enumerating pseudo-intents
F Distel, B Sertkaya
Discrete Applied Mathematics 159 (6), 450-466, 2011
732011
Applying formal concept analysis to description logics
F Baader, B Sertkaya
International Conference on Formal Concept Analysis, 261-286, 2004
612004
On the complexity of axiom pinpointing in the EL family of description logics
R Penaloza, B Sertkaya
Twelfth International Conference on the Principles of Knowledge …, 2010
502010
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
502004
Understanding the complexity of axiom pinpointing in lightweight description logics
R Penaloza, B Sertkaya
Artificial Intelligence 250, 80-104, 2017
442017
A survey on how description logic ontologies benefit from formal concept analysis
B Sertkaya
arXiv preprint arXiv:1107.2822, 2011
382011
Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics.
R Penaloza, B Sertkaya
ECAI 215, 29-34, 2010
312010
Ontocomp: A protege plugin for completing owl ontologies
B Sertkaya
European Semantic Web Conference, 898-902, 2009
292009
Formal concept analysis methods for description logics
B Sertkaya
Verlag nicht ermittelbar, 2008
242008
On the complexity of computing generators of closed sets
M Hermann, B Sertkaya
International Conference on Formal Concept Analysis, 158-168, 2008
222008
Axiom Pinpointing is Hard.
R Penaloza, B Sertkaya
Description Logics 477, 2009
182009
The ELepHant Reasoner System Description.
B Sertkaya
ORE, 87-93, 2013
162013
Some computational problems related to pseudo-intents
B Sertkaya
International Conference on Formal Concept Analysis, 130-145, 2009
152009
Towards the complexity of recognizing pseudo-intents
B Sertkaya
International Conference on Conceptual Structures, 284-292, 2009
132009
Complexity of axiom pinpointing in the DL-Lite family
R Penaloza, B Sertkaya
23rd International Workshop on Description Logics DL2010, 173, 2010
122010
OntoComP System Description.
B Sertkaya
Description Logics 477, 2009
92009
The system can't perform the operation now. Try again later.
Articles 1–20