Bruno YUN

I am a Lecturer at the University of Aberdeen since December 2019. I am affiliated with the Agents at Aberdeen (A3) group of the Department of Computing Science at the University of Aberdeen. My current research involves developing formal argumentation frameworks to reason in the presence of inconsistencies and model human-like interactions.

Before joining the University of Aberdeen, I was a research associate for the ReEnTrust project within the School of Informatics at the University of Edinburgh. During this project, I conducted several studies on human perceptions about algorithmic systems and built practical tools and theoretical models for rebuilding user trust in algorithms.

Prior to joining the ReEnTrust project, I was a member of the INRIA research team GraphIK at LIRMM. I worked at the University of Montpellier where I defended my thesis in Computer Science in July 2019.

PHD IN COMPUTER SCIENCE (2016-2019)

The title of my thesis is “Argumentation Techniques for Existential Rules“. It is original research in the field of Knowledge Representation and Reasoning, one of the main sub-domains in AI.

I was supervised by Madalina Croitoru, Srdjan Vesic and Rallou Thomopoulos. I was also supported by my friend and co-worker, Pierre Bisquert. During the whole duration of my PhD, I was part of the INRIA GraphIK team at the LIRMM laboratory. I defended my thesis on the 11th of July 2019.

I studied reasoning techniques with argumentation graphs generated from inconsistent knowledge bases expressed in the existential rules language. The three main results are the following. First, we give a structural study of argumentation graphs obtained from knowledge bases expressed in existential rules. Second, we propose and analyse an argumentation framework with sets of attacking arguments for existential rules. Third, we studied argumentation techniques based on ranking-based approaches in both the context of query answering and argumentation reasoning.

MSC IN COMPUTER SCIENCE (2014-2016)

I followed a Master’s program called “MIT” at the University of Montpelier. This program offered courses in Theoretical Computer Science. A non-exhaustive list of the topics covered is: Graphs and structures, Advanced computability and complexity, Constraint reasoning, Combinatorial optimization, and Knowledge base theory among others.

BACHELOR’S DEGREE IN MATHEMATICS (2011-2014)

As a first-year undergraduate, I studied Computer Science and Mathematics at the University of French Polynesia. In 2012, I moved to Montpelier and entered a course of study focused on Mathematics as a second-year undergraduate. A non-exhaustive list of the topics covered is: Linear algebra, Algorithms and structure of linear data, Advanced imperative programming, Combinatorial optimization, and Arithmetic among others.