Baris Sertkaya
Baris Sertkaya
Frankfurt University of Applied Sciences
Bestätigte E-Mail-Adresse bei fb2.fra-uas.de - Startseite
TitelZitiert vonJahr
Description logics
F Baader, I Horrocks, U Sattler
Foundations of Artificial Intelligence 3, 135-179, 2008
4002008
Description logics
F Baader, I Horrocks, U Sattler
Handbook on ontologies, 3-28, 2004
3822004
Completing Description Logic Knowledge Bases Using Formal Concept Analysis.
F Baader, B Ganter, B Sertkaya, U Sattler
IJCAI 7, 230-235, 2007
2092007
Completing Description Logic Knowledge Bases Using Formal Concept Analysis.
F Baader, B Ganter, B Sertkaya, U Sattler
IJCAI 7, 230-235, 2007
2092007
Computing the least common subsumer wrt a background terminology
F Baader, B Sertkaya, AY Turhan
Journal of Applied Logic 5 (3), 392-420, 2007
1012007
On the complexity of enumerating pseudo-intents
F Distel, B Sertkaya
Discrete Applied Mathematics 159 (6), 450-466, 2011
642011
Applying formal concept analysis to description logics
F Baader, B Sertkaya
International Conference on Formal Concept Analysis, 261-286, 2004
572004
On the complexity of axiom pinpointing in the EL family of description logics
R Peñaloza, B Sertkaya
Twelfth International Conference on the Principles of Knowledge …, 2010
432010
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
432004
Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics.
R Penaloza, B Sertkaya
ECAI 215, 29-34, 2010
282010
Ontocomp: A protege plugin for completing owl ontologies
B Sertkaya
European Semantic Web Conference, 898-902, 2009
242009
Formal concept analysis methods for description logics
B Sertkaya
Verlag nicht ermittelbar, 2008
232008
Understanding the complexity of axiom pinpointing in lightweight description logics
R Penaloza, B Sertkaya
Artificial Intelligence 250, 80-104, 2017
212017
Axiom pinpointing is hard
R Penaloza, B Sertkaya
CEUR, 2009
172009
A Survey on how Description Logic Ontologies Benefit from FCA.
B Sertkaya
CLA, 2-21, 2010
162010
Some computational problems related to pseudo-intents
B Sertkaya
International Conference on Formal Concept Analysis, 130-145, 2009
152009
On the complexity of computing generators of closed sets
M Hermann, B Sertkaya
International Conference on Formal Concept Analysis, 158-168, 2008
152008
The ELepHant Reasoner System Description.
B Sertkaya
ORE, 87-93, 2013
122013
Towards the complexity of recognizing pseudo-intents
B Sertkaya
International Conference on Conceptual Structures, 284-292, 2009
122009
A survey on how description logic ontologies benefit from formal concept analysis
B Sertkaya
arXiv preprint arXiv:1107.2822, 2011
112011
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20