| 2026 | KR | Computing Extensions of Abstract Argumentation Frameworks by Enumerating Closed Sets. | Sergei Obiedkov, Baris Sertkaya |
| 2023 | JELIA | Computing Stable Extensions of Argumentation Frameworks using Formal Concept Analysis. | Sergei Obiedkov, Baris Sertkaya |
| 2021 | AAAI | Mining EL Bases with Adaptable Role Depth. | Ricardo Guimares, Ana Ozaki, Cosimo Persia, Baris Sertkaya |
| 2011 | ER | Formal Concept Analysis for Qualitative Data Analysis over Triple Stores. | Frithjof Dau, Baris Sertkaya |
| 2010 | ECAI | Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics. | Rafael Pealoza, Baris Sertkaya |
| 2010 | KR | On the Complexity of Axiom Pinpointing in the EL Family of Description Logics. | Rafael Pealoza, Baris Sertkaya |
| 2009 | ICCS | Towards the Complexity of Recognizing Pseudo-intents. | Baris Sertkaya |
| 2009 | ICFCA | Usability Issues in Description Logic Knowledge Base Completion. | Franz Baader, Baris Sertkaya |
| 2009 | ICFCA | Some Computational Problems Related to Pseudo-intents. | Baris Sertkaya |
| 2008 | ICFCA | On the Complexity of Computing Generators of Closed Sets. | Miki Hermann, Baris Sertkaya |
| 2007 | IJCAI | Completing Description Logic Knowledge Bases Using Formal Concept Analysis. | Franz Baader, Bernhard Ganter, Baris Sertkaya, Ulrike Sattler |
| 2004 | ICFCA | Applying Formal Concept Analysis to Description Logics. | Franz Baader, Baris Sertkaya |
| 2004 | JELIA | Computing the Least Common Subsumer w.r.t. a Background Terminology. | Franz Baader, Baris Sertkaya, Anni-Yasmin Turhan |