Barış Sertkaya

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Computing stable extensions of argumentation frameworks using formal concept analysis	2024-05-29	Paper
Mining ℰℒ⊥ Bases with Adaptable Role Depth Journal of Artificial Intelligence Research	2023-08-28	Paper
Understanding the complexity of axiom pinpointing in lightweight description logics Artificial Intelligence	2017-11-16	Paper
scientific article; zbMATH DE number 6697177 (Why is no real title available?)	2017-03-27	Paper
Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics	2011-05-11	Paper
On the complexity of enumerating pseudo-intents Discrete Applied Mathematics	2011-03-10	Paper
Some Computational Problems Related to Pseudo-intents Formal Concept Analysis	2009-06-03	Paper
Usability Issues in Description Logic Knowledge Base Completion Formal Concept Analysis	2009-06-03	Paper
Concept Lattices Lecture Notes in Computer Science	2009-05-14	Paper
On the Complexity of Computing Generators of Closed Sets Formal Concept Analysis	2008-03-04	Paper
Computing the least common subsumer w.r.t. a background terminology Journal of Applied Logic	2007-07-25	Paper
Logics in Artificial Intelligence Lecture Notes in Computer Science	2006-10-25	Paper

Research outcomes over time

This page was built for person: Barış Sertkaya