Theses
B. Sertkaya. Formal Concept Analysis Methods for Description Logics. Ph.D. dissertation, Institute of Theoretical Computer Science, TU Dresden, Germany, 2007. (pdf,bib)B. Sertkaya. Proof of the Basic Theorem on Concept Lattices in Isabelle/HOL. Master Thesis, Department of Computer Engineering, Middle East Technical University, Ankara, Turkey, 2003. (pdf,bib)
Edited Volumes
L. Kwuida, B. Sertkaya. Proceedings of the 8th International Conference on Formal Concept Analysis (ICFCA 2010).Lecture Notes in Artificial Intelligence. Springer-Verlag, 2010.To appearJournals
F. Baader, B. Sertkaya, and A.-Y. Turhan. Computing the least common subsumer w.r.t. a background terminology. Journal of Applied Logic, 5(3), 2007. (pdf,bib)Conferences
B. Sertkaya. Towards the Complexity of Recognizing Pseudo-intents. In F. Dau and S. Rudolph, editors, Proceedings of the 17th International Conference on Conceptual Structures, (ICCS 2009), volume 5662 of Lecture Notes in Computer Science, pages 284-292. Springer-Verlag, 2009. (pdf,bib) (*There is an error in the proof of Theorem 1. Thanks to Mikhail Babin for pointing it out. I am trying to fix it*)B. Sertkaya. Some computational problems related to pseudo-intents. In S. Ferre and S. Rudolph, editors, Proceedings of the 7th International Conference on Formal Concept Analysis, (ICFCA 2009), volume 5548 of Lecture Notes in Artificial Intelligence, pages 130-145. Springer-Verlag, 2009. (pdf,bib)
B. Sertkaya. OntoComP: A Protege Plugin for Completing OWL Ontologies. In L. Aroyo and P. Traverso editors, Proceedings of the 6th European Semantic Web Conference, (ESWC 2009), volume 5554 of Lecture Notes in Computer Science, pages 898-902. Springer-Verlag, 2009. (pdf,bib)
F. Baader and B. Sertkaya. Usability issues in description logic knowledge base completion. In S. Ferre and S. Rudolph, editors, Proceedings of the 7th International Conference on Formal Concept Analysis, (ICFCA 2009), volume 5548 of Lecture Notes in Artificial Intelligence, pages 1-21. Springer-Verlag, 2009. (pdf,bib)
M. Hermann and B. Sertkaya. On the complexity of computing generators of closed sets. In R. Medina and S. A. Obiedkov, editors, Proceedings of the 6th International Conference on Formal Concept Analysis, (ICFCA 2008), volume 4933 of Lecture Notes in Computer Science, pages 158-168. Springer-Verlag, 2008. (pdf,bib)
F. Baader, B. Ganter, B. Sertkaya, and U. Sattler. Completing description logic knowledge bases using formal concept analysis. In M. M. Veloso, editor, Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI'07), pages 230-235. AAAI Press, 2007. (pdf,bib)
B. Sertkaya. Computing the hierarchy of conjunctions of concept names and their negations in a description logic knowledge base using formal concept analysis. In Supplementary Proceedings of the 4th International Conference on Formal Concept Analysis, (ICFCA 2006), 2006. (pdf,bib)
F. Baader, B. Sertkaya, and A.-Y. Turhan. Computing the least common subsumer w.r.t. a background terminology. In J. J. Alferes and J. A. Leite, editors, Proceedings of the 9th European Conference on Logics in Artificial Intelligence (JELIA 2004), volume 3229 of Lecture Notes in Computer Science, pages 400-412. Springer-Verlag, 2004. (pdf,bib)
F. Baader and B. Sertkaya. Applying formal concept analysis to description logics. In P. Eklund, editor, Proceedings of the 2nd International Conference on Formal Concept Analysis (ICFCA 2004), volume 2961 of Lecture Notes in Computer Science, pages 261-286. Springer-Verlag, 2004. (pdf,bib)
B. Sertkaya and H. Oguztuzun. Proof of the basic theorem on concept lattices in Isabelle/HOL. In C. Aykanat, T. Dayar, and I. Korpeoglu, editors, Proceedings of the 19th International Symposium on Computer and Information Sciences (ISCIS2004), volume 3280 of Lecture Notes in Computer Science, pages 976-985. Springer-Verlag, 2004. (pdf,bib)
Refereed Workshops
R. Peñaloza and B. Sertkaya. Axiom Pinpointing is hard. In Proceedings of the 2009 International Workshop on Description Logics (DL2009), volume 477 of CEUR Workshop Proceedings, 2009. (pdf,bib)
B. Sertkaya. OntoComP System Description. In Proceedings of the 2009 International Workshop on Description Logics (DL2009), volume 477 of CEUR Workshop Proceedings, 2009. (pdf,bib)
B. Sertkaya. Explaining user errors in knowledge base completion. In F. Baader, C. Lutz, and B. Motik, editors, Proceedings of the 2008 International Workshop on Description Logics (DL2008), volume 353 of CEUR-WS, 2008. (pdf,bib)
B. Sertkaya. Explaining user errors in description logic knowledge base completion. In F. Baader, S. Ghilardi, M. Hermann, U. Sattler, V. Sofronie-Stokkermans editors Informal Proceedings of the 2008 International Workshop on Complexity, Expressibility, and Decidability in Automated Reasoning (CEDAR'08), 2008. (pdf,bib)
F. Baader, B. Ganter, U. Sattler, and B. Sertkaya. Completing description logic knowledge bases using formal concept analysis. In Proceedings of the Third International Workshop OWL: Experiences and Directions (OWLED 2007). CEUR-WS, 2007. (pdf,bib)
F. Baader, B. Sertkaya, and A.-Y. Turhan. Computing the least common subsumer w.r.t. a background terminology. In V. Haarslev and R. Moller, editors, Proceedings of the 2004 International Workshop on Description Logics (DL2004), volume 104 of CEUR Workshop Proceedings, 2004. (pdf,bib)
Technical Reports
B. Sertkaya. Some computational problems related to pseudo-intents. LTCS-Report LTCS-08-06, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2008. (pdf,bib)F. Baader, B. Ganter, U. Sattler, and B. Sertkaya. Completing description logic knowledge bases using formal concept analysis. LTCS-Report LTCS-06-02, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2006. (pdf,bib)