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
5372008
Completing description logic knowledge bases using formal concept analysis
F Baader, B Ganter, U Sattler, B Sertkaya
IJCAI 7, 230-235, 2007
2412007
Completing description logic knowledge bases using formal concept analysis
F Baader, B Ganter, U Sattler, B Sertkaya
IJCAI 7, 230-235, 2007
2412007
Computing the least common subsumer wrt a background terminology
F Baader, B Sertkaya, AY Turhan
Journal of Applied Logic 5 (3), 392-420, 2007
1162007
On the complexity of enumerating pseudo-intents
F Distel, B Sertkaya
Discrete Applied Mathematics 159 (6), 450-466, 2011
782011
Applying formal concept analysis to description logics
F Baader, B Sertkaya
International Conference on Formal Concept Analysis, 261-286, 2004
682004
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
532004
Understanding the complexity of axiom pinpointing in lightweight description logics
R Penaloza, B Sertkaya
Artificial Intelligence 250, 80-104, 2017
502017
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
472010
A survey on how description logic ontologies benefit from formal concept analysis
B Sertkaya
arXiv preprint arXiv:1107.2822, 2011
412011
Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics.
R Penaloza, B Sertkaya
ECAI 215, 29-34, 2010
322010
OntoComP: A Protégé Plugin for Completing OWL Ontologies
B Sertkaya
European Semantic Web Conference, 898-902, 2009
312009
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
Formal Concept Analysis: 6th International Conference, ICFCA 2008, Montreal …, 2008
212008
Axiom pinpointing is hard
R Penaloza, B Sertkaya
Proceedings of the 22nd International Workshop on Description Logics (DL2009 …, 2009
192009
Some computational problems related to pseudo-intents
B Sertkaya
Formal Concept Analysis: 7th International Conference, ICFCA 2009 Darmstadt …, 2009
192009
The ELepHant Reasoner System Description.
B Sertkaya
ORE, 87-93, 2013
182013
Towards the complexity of recognizing pseudo-intents
B Sertkaya
Conceptual Structures: Leveraging Semantic Technologies: 17th International …, 2009
172009
Complexity of axiom pinpointing in the DL-Lite family
R Penaloza, B Sertkaya
CEUR WORKSHOP PROCEEDINGS 573, 173-184, 2010
142010
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
102011
The system can't perform the operation now. Try again later.
Articles 1–20