[go: up one dir, main page]

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
5912008
Completing description logic knowledge bases using formal concept analysis
F Baader, B Ganter, U Sattler, B Sertkaya
2572006
Computing the least common subsumer wrt a background terminology
F Baader, B Sertkaya, AY Turhan
Journal of Applied Logic 5 (3), 392-420, 2007
1292007
On the complexity of enumerating pseudo-intents
F Distel, B Sertkaya
Discrete Applied Mathematics 159 (6), 450-466, 2011
842011
Applying formal concept analysis to description logics
F Baader, B Sertkaya
International Conference on Formal Concept Analysis, 261-286, 2004
782004
Understanding the complexity of axiom pinpointing in lightweight description logics
R Penaloza, B Sertkaya
Artificial Intelligence 250, 80-104, 2017
562017
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
562004
On the Complexity of Axiom Pinpointing in the EL Family of Description Logics.
R Penaloza, B Sertkaya
KR 10, 280-289, 2010
512010
A survey on how description logic ontologies benefit from formal concept analysis
B Sertkaya
arXiv preprint arXiv:1107.2822, 2011
442011
OntoComP: A Protégé Plugin for Completing OWL Ontologies
B Sertkaya
European Semantic Web Conference, 898-902, 2009
362009
Complexity of axiom pinpointing in the DL-Lite family of description logics
R Penaloza, B Sertkaya
ECAI 2010, 29-34, 2010
342010
Formal concept analysis methods for description logics
B Sertkaya
262007
On the complexity of computing generators of closed sets
M Hermann, B Sertkaya
International Conference on Formal Concept Analysis, 158-168, 2008
212008
Some computational problems related to pseudo-intents
B Sertkaya
International Conference on Formal Concept Analysis, 130-145, 2009
202009
Axiom pinpointing is hard
R Penaloza, B Sertkaya
Proceedings of the 22nd International Workshop on Description Logics (DL2009 …, 2009
202009
The ELepHant Reasoner System Description.
B Sertkaya
ORE, 87-93, 2013
182013
Towards the complexity of recognizing pseudo-intents
B Sertkaya
International Conference on Conceptual Structures, 284-292, 2009
172009
Complexity of axiom pinpointing in the DL-Lite family
R Penaloza, B Sertkaya
CEUR WORKSHOP PROCEEDINGS 573, 173-184, 2010
132010
OntoComP System Description.
B Sertkaya
Description Logics 477, 2009
112009
Mining ℰℒ⊥ Bases with Adaptable Role Depth
R Guimarães, A Ozaki, C Persia, B Sertkaya
Journal of artificial intelligence research 76, 883-924, 2023
102023
The system can't perform the operation now. Try again later.
Articles 1–20