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
5332008
Completing description logic knowledge bases using formal concept analysis
F Baader, B Ganter, U Sattler, B Sertkaya
IJCAI, 230-235, 2007
2282007
Completing description logic knowledge bases using formal concept analysis
F Baader, B Ganter, U Sattler, B Sertkaya
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
1162007
On the complexity of enumerating pseudo-intents
F Distel, B Sertkaya
Discrete Applied Mathematics 159 (6), 450-466, 2011
742011
Applying formal concept analysis to description logics
F Baader, B Sertkaya
ICFCA, 261-286, 2004
632004
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
512004
On the Complexity of Axiom Pinpointing in the EL Family of Description Logics.
R Penaloza, B Sertkaya
KR 10, 280-289, 2010
482010
Understanding the complexity of axiom pinpointing in lightweight description logics
R Penaloza, B Sertkaya
Artificial Intelligence 250, 80-104, 2017
472017
A survey on how description logic ontologies benefit from formal concept analysis
B Sertkaya
arXiv preprint arXiv:1107.2822, 2011
402011
Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics.
R Penaloza, B Sertkaya
ECAI 215, 29-34, 2010
312010
OntoComP: A Protégé Plugin for Completing OWL Ontologies
B Sertkaya
The Semantic Web: Research and Applications: 6th European Semantic Web …, 2009
282009
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
202008
The ELepHant Reasoner System Description.
B Sertkaya
ORE, 87-93, 2013
172013
Some Computational Problems Related to Pseudo-intents.
B Sertkaya
ICFCA, 130-145, 2009
162009
Axiom pinpointing is hard
R Penaloza, B Sertkaya
Proceedings of the 22nd International Workshop on Description Logics (DL2009 …, 2009
162009
Towards the complexity of recognizing pseudo-intents
B Sertkaya
Conceptual Structures: Leveraging Semantic Technologies: 17th International …, 2009
132009
Complexity of axiom pinpointing in the DL-Lite family
R Penaloza, B Sertkaya
23rd International Workshop on Description Logics DL2010, 173, 2010
112010
OntoComP System Description.
B Sertkaya
Description Logics 477, 2009
92009
The system can't perform the operation now. Try again later.
Articles 1–20