Applying Formal Concept Analysis to Description Logics. - Franz Baader; Baris Sertkaya (ICFCA, 2004)

Proof of the Basic Theorem on Concept Lattices in Isabelle/HOL. - Baris Sertkaya; Halit Oguztüzün (ISCIS, 2004)

Completing Description Logic Knowledge Bases Using Formal Concept Analysis. - Franz Baader; Bernhard Ganter; Baris Sertkaya; Ulrike Sattler (IJCAI, 2007)

Computing the least common subsumer w.r.t. a background terminology. - Franz Baader; Baris Sertkaya; Anni-Yasmin Turhan (J. Appl. Log., 2007)

Formal concept analysis methods for description logics. - Baris Sertkaya (2007)

Explaining User Errors in Knowledge Base Completion. - Baris Sertkaya (Description Logics, 2008)

On the Complexity of Computing Generators of Closed Sets. - Miki Hermann; Baris Sertkaya (ICFCA, 2008)

Axiom Pinpointing is Hard. - Rafael Peñaloza; Baris Sertkaya (Description Logics, 2009)

OntoComP System Description. - Baris Sertkaya (Description Logics, 2009)

OntoComP: A Protégé Plugin for Completing OWL Ontologies. - Baris Sertkaya (ESWC, 2009)

Towards the Complexity of Recognizing Pseudo-intents. - Baris Sertkaya (ICCS, 2009)

Usability Issues in Description Logic Knowledge Base Completion. - Franz Baader; Baris Sertkaya (ICFCA, 2009)

Some Computational Problems Related to Pseudo-intents. - Baris Sertkaya (ICFCA, 2009)

A Survey on how Description Logic Ontologies Benefit from FCA. - Baris Sertkaya (CLA, 2010)

Complexity of Axiom Pinpointing in the DL-Lite Family. - Rafael Peñaloza; Baris Sertkaya (Description Logics, 2010)

Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics. - Rafael Peñaloza; Baris Sertkaya (ECAI, 2010)

On the Complexity of Axiom Pinpointing in the EL Family of Description Logics. - Rafael Peñaloza; Baris Sertkaya (KR, 2010)

An Extension of ToscanaJ for FCA-based Data Analysis over Triple Stores. - Frithjof Dau; Baris Sertkaya (CUBIST Workshop, 2011)

In the Search of Improvements to the EL+ Classification Algorithm. - Baris Sertkaya (Description Logics, 2011)

Formal Concept Analysis for Qualitative Data Analysis over Triple Stores. - Frithjof Dau; Baris Sertkaya (ER Workshops, 2011)

A Survey on how Description Logic Ontologies Benefit from Formal Concept Analysis - Baris Sertkaya (CoRR, 2011)

On the complexity of enumerating pseudo-intents. - Felix Distel; Baris Sertkaya (Discret. Appl. Math., 2011)

The ELepHant Reasoner System Description. - Baris Sertkaya (ORE, 2013)

Understanding the complexity of axiom pinpointing in lightweight description logics. - Rafael Peñaloza; Baris Sertkaya (Artif. Intell., 2017)

Probably Approximately Correct Completion of Description Logic Knowledge Bases. - Sergei Obiedkov; Baris Sertkaya; Denis Zolotukhin (Description Logics, 2019)

Mining EL⊥ Bases with Adaptable Role Depth (Extended Abstract). - Ricardo Guimarães 001; Ana Ozaki; Cosimo Persia; Baris Sertkaya (Description Logics, 2021)

Clustering Knowledge Graphs Using Concept Lattices (Extended Abstract). - Fabiola Hodo; Sai Pranav; Baris Sertkaya (Description Logics, 2023)

Computing Stable Extensions of Argumentation Frameworks using Formal Concept Analysis. - Sergei Obiedkov; Baris Sertkaya (JELIA, 2023)

Mining ℰℒ⊥ Bases with Adaptable Role Depth. - Ricardo Guimarães 001; Ana Ozaki; Cosimo Persia; Baris Sertkaya (J. Artif. Intell. Res., 2023)

Probably Approximately Correct Ontology Completion with pacco (Extended Abstract). - Sergei Obiedkov; Baris Sertkaya (Description Logics, 2024)

PAC learning of concept inclusions for ontology-mediated query answering. - Sergei Obiedkov; Baris Sertkaya (Int. J. Approx. Reason., 2025)