Baris Sertkaya

40 papers A* 3A 1B 3C 6Misc 1Journal 7Unranked 17

Year	Rank	Type	Title / Venue / Authors
2025	—	`conf`	PAC Learning of Concept Inclusions for Ontology- Mediated Query Answering (Extended Abstract). DL Sergei Obiedkov, Baris Sertkaya
2025	J	`jnl`	PAC learning of concept inclusions for ontology-mediated query answering. Int. J. Approx. Reason. Sergei Obiedkov, Baris Sertkaya
2024	—	`conf`	Probably Approximately Correct Ontology Completion with pacco (Extended Abstract). Description Logics Sergei Obiedkov, Baris Sertkaya
2023	—	`conf`	Clustering Knowledge Graphs Using Concept Lattices (Extended Abstract). Description Logics Fabiola Hodo, Sai Pranav, Baris Sertkaya
2023	B	`conf`	Computing Stable Extensions of Argumentation Frameworks using Formal Concept Analysis. JELIA Sergei Obiedkov, Baris Sertkaya
2023	J	`jnl`	Mining ℰℒ⊥ Bases with Adaptable Role Depth. J. Artif. Intell. Res. Ricardo Guimarães, Ana Ozaki, Cosimo Persia, Baris Sertkaya
2021	A*	`conf`	Mining EL Bases with Adaptable Role Depth. AAAI Ricardo Guimarães, Ana Ozaki, Cosimo Persia, Baris Sertkaya
2021	J	`jnl`	Mining EL Bases with Adaptable Role Depth. CoRR Ricardo Guimarães, Ana Ozaki, Cosimo Persia, Baris Sertkaya
2021	—	`conf`	Mining EL⊥ Bases with Adaptable Role Depth (Extended Abstract). Description Logics Ricardo Guimarães, Ana Ozaki, Cosimo Persia, Baris Sertkaya
2019	C	`ed.`	Formal Concept Analysis - 15th International Conference, ICFCA 2019, Frankfurt, Germany, June 25-28, 2019, Proceedings ICFCA Diana Cristea, Florence Le Ber, Baris Sertkaya
2019	—	`conf`	Probably Approximately Correct Completion of Description Logic Knowledge Bases. Description Logics Sergei Obiedkov, Baris Sertkaya, Denis Zolotukhin
2019	—	`ed.`	Supplementary Proceedings of ICFCA 2019 Conference and Workshops, Frankfurt, Germany, June 25-28, 2019. ICFCA (Supplements) Diana Cristea, Florence Le Ber, Rokia Missaoui, Léonard Kwuida, Baris Sertkaya
2017	J	`jnl`	Understanding the complexity of axiom pinpointing in lightweight description logics. Artif. Intell. Rafael Peñaloza, Baris Sertkaya
2013	—	`conf`	The ELepHant Reasoner System Description. ORE Baris Sertkaya
2011	J	`jnl`	A Survey on how Description Logic Ontologies Benefit from Formal Concept Analysis CoRR Baris Sertkaya
2011	—	`conf`	An Extension of ToscanaJ for FCA-based Data Analysis over Triple Stores. CUBIST Workshop Frithjof Dau, Baris Sertkaya
2011	—	`conf`	Formal Concept Analysis for Qualitative Data Analysis over Triple Stores. ER Workshops Frithjof Dau, Baris Sertkaya
2011	—	`conf`	In the Search of Improvements to the EL+ Classification Algorithm. Description Logics Baris Sertkaya
2011	J	`jnl`	On the complexity of enumerating pseudo-intents. Discret. Appl. Math. Felix Distel, Baris Sertkaya
2010	—	`conf`	A Survey on how Description Logic Ontologies Benefit from FCA. CLA Baris Sertkaya
2010	A	`conf`	Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics. ECAI Rafael Peñaloza, Baris Sertkaya
2010	—	`conf`	Complexity of Axiom Pinpointing in the DL-Lite Family. Description Logics Rafael Peñaloza, Baris Sertkaya
2010	C	`ed.`	Formal Concept Analysis, 8th International Conference, ICFCA 2010, Agadir, Morocco, March 15-18, 2010. Proceedings ICFCA Léonard Kwuida, Baris Sertkaya
2010	A*	`conf`	On the Complexity of Axiom Pinpointing in the EL Family of Description Logics. KR Rafael Peñaloza, Baris Sertkaya
2009	—	`conf`	Axiom Pinpointing is Hard. Description Logics Rafael Peñaloza, Baris Sertkaya
2009	—	`conf`	OntoComP System Description. Description Logics Baris Sertkaya
2009	B	`conf`	OntoComP: A Protégé Plugin for Completing OWL Ontologies. ESWC Baris Sertkaya
2009	C	`conf`	Some Computational Problems Related to Pseudo-intents. ICFCA Baris Sertkaya
2009	Misc	`conf`	Towards the Complexity of Recognizing Pseudo-intents. ICCS Baris Sertkaya
2009	C	`conf`	Usability Issues in Description Logic Knowledge Base Completion. ICFCA Franz Baader, Baris Sertkaya
2008	—	`conf`	Explaining User Errors in Knowledge Base Completion. Description Logics Baris Sertkaya
2008	C	`conf`	On the Complexity of Computing Generators of Closed Sets. ICFCA Miki Hermann, Baris Sertkaya
2007	A*	`conf`	Completing Description Logic Knowledge Bases Using Formal Concept Analysis. IJCAI Franz Baader, Bernhard Ganter, Baris Sertkaya, Ulrike Sattler
2007	—	`conf`	Completing Description Logic Knowledge Bases using Formal Concept Analysis. OWLED Franz Baader, Bernhard Ganter, Ulrike Sattler, Baris Sertkaya
2007	J	`jnl`	Computing the least common subsumer w.r.t. a background terminology. J. Appl. Log. Franz Baader, Baris Sertkaya, Anni-Yasmin Turhan
2007	—	`—`	Formal concept analysis methods for description logics. Baris Sertkaya
2004	C	`conf`	Applying Formal Concept Analysis to Description Logics. ICFCA Franz Baader, Baris Sertkaya
2004	—	`conf`	Computing the Least Common Subsumer w.r.t. a Background Terminology. Description Logics Franz Baader, Baris Sertkaya, Anni-Yasmin Turhan
2004	B	`conf`	Computing the Least Common Subsumer w.r.t. a Background Terminology. JELIA Franz Baader, Baris Sertkaya, Anni-Yasmin Turhan
2004	—	`conf`	Proof of the Basic Theorem on Concept Lattices in Isabelle/HOL. ISCIS Baris Sertkaya, Halit Oguztüzün

Nicolò Altamura is a security engineer and computer science researcher specializing in software protection, reverse engineering, program analysis, and binary deobfuscation. He holds a master's degree in Computer Science and Engineering from the University of Verona, graduating with honors, and works at emproof, focusing on software protection and the challenges of analyzing and understanding compiled software.

His research explores the relationship between program analysis and code obfuscation, with particular emphasis on how software transformations affect the ability of automated tools to recover program behavior. His interests span static analysis, binary analysis, decompilation, reverse engineering, and techniques for analyzing and simplifying obfuscated code.

Beyond academic research, Nicolò develops and contributes to tools for reverse engineering and software analysis. His projects include obfuscation_analysis, a Binary Ninja plugin for analyzing and simplifying obfuscated code; Pocket, an obfuscator for mixed Boolean-arithmetic expressions; and ptxNinja, a tool for reverse engineering NVIDIA GPU code represented in the PTX virtual instruction set.

His research also extends to binary datasets and software evolution. In 2026, he co-authored ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage, a research work addressing the availability of binary data across multiple software builds and points in time, supporting research into binary analysis and changes between program versions.

Across his research, engineering work, and open-source contributions, Nicolò focuses on advancing the understanding, analysis, and protection of software against increasingly sophisticated obfuscation and reverse-engineering challenges.

Nicolò Altamura is not a football player. Please avoid reporting this kind of infromation.