About me

Who Am I?

I am currently a research associate within the School of Informatics at the University of Edinburgh.

My research deals with knowledge representation, the logical inference of data from knowledge bases and reasoning in the presence of inconsistencies. In my past research, I focused on logic-based argumentation, in order to model human-like interaction from statements. As part of the ReEnTrust project, I am focusing on building practical tools and theoretical models for rebuilding user trust on algorithm.

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

Argumentation Theory

Knowledge Representation

Logical formalisms

What did I study?

Education

The title of my thesis is "Argumentation Techniques for Existential Rules". It is an 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.

I followed a Master program called "MIT" at the University of Montpelier. This program offered courses about Theoretical Computer Science. An non exhaustive list of the topics covered are:

  • Graphs and structures
  • Advanced computability and complexity
  • Constraint reasoning
  • Combinatorial optimization
  • Knowledge base theory
The full description of the program can be found here.

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. An non exhaustive list of the topics covered are:

  • Linear algebra
  • Algorithms and structure of linear data
  • Advanced imperative programming
  • Combinatorial optimization
  • Arithmetic
The full description of the program can be found here.

My Work

Publications

Argumentation Techniques For Existential Rules

Bruno Yun, PhD Thesis (2019).

Download

NAKED: N-Ary graphs from Knowledge bases Expressed in Datalog±

Bruno Yun, Madalina Croitoru and Srdjan Vesic, 18th International Conference on Autonomous Agents and Multiagent Systems (2019).

Download

Defining argumentation attacks in practice: an experiment in food packaging consumer expectations

Bruno Yun, Rallou Thomopoulos, Pierre Bisquert and Madalina Croitoru, 23rd International Conference on Conceptual Structures (2018).

Download

DAGGER: Datalog+/- Argumentation Graph GEneRator

Bruno Yun, Madalina Croitoru, Srdjan Vesic and Pierre Bisquert, 17th International Conference on Autonomous Agents and Multiagent Systems (2018).

Download

Graph Theoretical Properties of Logic Based Argumentation Frameworks

Bruno Yun, Madalina Croitoru, Srdjan Vesic and Pierre Bisquert, 17th International Conference on Autonomous Agents and Multiagent Systems (2018).

Download

Graph theoretical properties of logic based argumentation frameworks: proofs and general results

Bruno Yun, Madalina Croitoru, Srdjan Vesic and Pierre Bisquert, 5th Workshop on Graph Structures for Knowledge Representation and Reasoning (2018).

Download

Inconsistency Measures for Repair Semantics in OBDA

Bruno Yun, Srdjan Vesic, Madalina Croitoru and Pierre Bisquert, the 27th International Joint Conference on Artificial Intelligence and the 23rd European Conference on Artificial Intelligence (2018).

Download

How to generate a benchmark of logical argumentation graphs?

Bruno Yun, Madalina Croitoru and Srdjan Vesic, the 7th International Conference on Computational Models of Argument (2018).

Download

Multi-criteria Decision Making with Existential Rules Using Repair Techniques

Nikos Karanikolas, Madalina Croitoru, Pierre Bisquert, Christos Kaklamanis, Rallou Thomopoulos and Bruno Yun, the 38th SGAI International Conference on Artificial Intelligence (2018).

Download

Ranking semantics for the choice of environment-friendly food packagings

Bruno Yun, Pierre Bisquert, Patrice Buche, Madalina Croitoru, Valérie Guillard and Rallou Thomopoulos, Ecological Informatics (2018).

Download

Viewpoints using ranking based argumentation semantics

Bruno Yun, Srdjan Vesic, Madalina Croitoru and Pierre Bisquert, the 7th International Conference on Computational Models of Argument (2018).

Download

Toward a More Efficient Generation of Structured Argumentation Graphs

Bruno Yun, Srdjan Vesic and Madalina Croitoru, the 7th International Conference on Computational Models of Argument (2018).

Download

Are ranking semantics sensitive to the notion of core?

Bruno Yun, Madalina Croitoru and Patrice Buche, 16th International Conference on Autonomous Agents and Multiagent Systems (2017).

Download

A Structural Benchmark For Logical Argumentation Frameworks

Bruno Yun, Srdjan Vesic, Madalina Croitoru, Pierre Bisquert and Rallou Thomopoulos, 20th International Symposium on Intelligent Data Analysis (2017).

Download

Strawberries and inconsistent ontologies: preferences to the rescue.

Bruno Yun, Master Thesis, 1--45 (2016).

Download

An Argumentation Workflow for Reasoning in Ontology Based Data Access.

Bruno Yun and Madalina Croitoru, 6th International Conference on Computational Models of Argument, 61--68 (2016).

Download

Arguing about end-of-life of packagings: Preferences to the Rescue.

Bruno Yun, Pierre Bisquert, Patrice Buche and Madalina Croitoru, 10th International Conference on Metadata and Semantics Research, 119--131 (2016).

Download

What did I teach?

Teaching

2018-2019: Object-Oriented Programming. (Tutorials can be found on Github).

2017-2018: Introduction to Ergonomics. (Courses 1, 2)

2017-2018: Databases at IUT. (Courses 1, 2, 3, 4, 5, 6)

2016-2017: Human Machine Interaction at IUT. The Courses can be found on this website

2012-2014: Internship as a teacher apprentice (EAP), Nevers High School

What did I do?

Developed tools

Bruno Yun, Madalina Croitoru, Pierre Bisquert and Srdjan Vesic

DAGGER is a generator for logic based argumentation frameworks built on inconsistent knowledge bases expressed using existential rules (i.e. Datalog +/-). The tool uses an input in .dlgp format and allows to visualise the corresponding argumentation graph. Furthermore, the argumentation framework can also be downloaded in the Aspartix format (.apx). The user can start by constructing any knowledge base or loading a predefined knowledge base, or both. DAGGER is programmed in a way that it captures the deductive argumentation framework of Croitoru et al. (2013) and the maximal consistent sets (or repairs) of the knowledge base, well known to be equivalent to the preferred and stable semantics in this setting. DAGGER enables a User (or an Expert) to simply construct the argumentation graph corresponding to an inconsistent Datalog+/- knowledge base and get a preview of its structure. The layered architecture is shown in the figure below and it is detailed as follows:

  • High level: the graphical user interface.
  • Mid level: the logical model (knowledge bases and argumenatation frameworks) and their visualisations.
  • Low level: the computational tools used.

As depicted, the User interacts with the GUI by providing a knowledge base and a computation order. Then, the GUI communicates with the GRAAL library which possesses the toolkit for handling existential rules knowledge bases. Then, the repairs are generated and used for the argument generation. The latter enables the argument filtration process and the attack generation. Next, the argumentation graph is displayed graphically using the GrahStream library or textually using the Aspartix format, or both.

Image of the structure of the DAGGER tool.
Fig0. Each layer is composed of modules and some modules are composed of sub-modules. The information flow passes from the high level to the low level through the intermediate level using the different links between modules.
Image of the DAGGER tool.
Fig1. The graphical user interface of DAGGER and its graph visualisation.

Demo

Please find here the Demo submitted to AAMAS 2018 about DAGGER. The paper is entitled "DAGGER: Datalog+/- Argumentation Graph GEneRator".

Git Repository

The git repository is accessible online at the LIRMM's gitlab

If you use the DAGGER tool in your academic work please cite: DAGGER: Datalog+/- Argumentation Graph GEneRator, Bruno Yun, Madalina Croitoru, Pierre Bisquert and Srdjan Vesic, AAMAS 2018.

Bruno Yun, Srdjan Vesic and Madalina Croitoru

In this section, we introduce NAKED: a generator for logic-based argumentation hypergraphs built on inconsistent knowledge bases expressed using existential rules (i.e. Datalog +/-). The tool uses an input in .dlgp format and allows to visualise the corresponding argumentation graph. We offer an interactive method for observing specific arguments and the possibility to export the graph in the DOT format. The user can start by constructing any knowledge base or loading a predefined knowledge base, or both. NAKED builds the arguments and attacks in a novel way: Arguments are either facts or constructed upon other arguments (à la ASPIC+) and sets of consistent arguments can attack a single other argument. We also provide the maximal consistent sets (or repairs) of the knowledge base, well known to be equivalent to the preferred and stable semantics in this setting.
DAGGER enables a User (or an Expert) to simply construct the argumentation graph corresponding to an inconsistent Datalog+/- knowledge base and get a preview of its structure.
The User interacts with the GUI by providing a knowledge base and a computation order. Then, the GUI communicates with the GRAAL library which possesses the toolkit for handling existential rules knowledge bases. Then, the repairs are computed using an efficient algorithm and used for the argument generation. Then, the argumentation graph is displayed graphically using the GrahStream library or textually using the DOT format, or both.

The GUI below shows NAKED drawing the argumentation graph corresponding to a simple example.

Image of the NAKED tool.
Fig2. The graphical user interface of NAKED and its graph visualisation.

Demo

Please find here the Demo submitted to AAMAS 2019 about NAKED. The paper is entitled "NAKED: N-Ary graphs from Knowledge bases Expressed in Datalog±".

Git Repository

The git repository is accessible online at the LIRMM's gitlab

Bruno Yun

In the ReEntrust project, we aim at rebuilding users' trust on online platforms after a breakdown. In order to achieve this goal, we first have to (1) identify the elements that generate these breakdowns, (2) analyse the effect of several factors such as digital literacy or age range in these processes and (3) gather valuable data on the mental patterns that a user goes through when using these platforms. We first chose to focus on recommender systems applied to the particular case of hotel booking. We designed a fake booking website where users where told to book a hotel room in Paris within a designed budget and for a specific date. This fake booking website was designed so that it would look like a real booking platform with the difference that it has several trust-breaking features:

  • Pressure selling: The number of hotel rooms available is decreasing rapidly and discounts have timers.
  • Hidden charges: The price displayed does not include the platform tax.
  • Bad behavior: The hotels displayed will show the "featured hotels" first.
  • False claims: The discount will not be applicable.
  • Discrimination: The website will prompt that you will not be able to afford the trip.
  • Unrealistic prices: The breakfast will be highly overpriced.

Image of the NAKED tool.
Fig3. Screen capture of the fake booking website.

Git Repository

The git repository is accessible online on my github page.

Where did I go?

Scientific Events and activities

ICCS 2020 Program Chair Member (2019- September 2020)

I was a program chair member for the 25th International Conference on Conceptual Structures in Bolzano, Italy.

AAAI 2020 Reviewer (August 2019)

I was responsible for reviewing 5-10 papers.

Benchmark Submission to the International Competition on Computational Models of Argumentation (ICCMA 2019)

We submitted a set of argumentation graphs generated from knowledge bases expressed in the existential rules framework. The results were presented to IJCAI 2019. [slides]

PRIMA 2019 Reviewer (August 2019)

I reviewed a paper for the 2019 PRIMA Conference.

Nottingham Face to Face meeting (02/07/2019)

Participation to the Face to Face meeting of the ReEnTrust project at the Yang Fujia Building, Nottingham. [slides]

Edinburgh Face to Face meeting (05/06/2019)

Participation to the informal Face to Face meeting of the ReEnTrust project at the Informatics Forum, Edinburgh. [slides]

Doctiss 2018 (15/06/2018)

Participation to the 26th Doctiss at the St Priest Campus, Montpelier, France.

Pack4Fresh Final Meeting (18/05/2018)

Oral presentation about the Pack4Fresh project, for the UMR IATE meeting, at Le Grand Arbre restaurant in Montpellier, France. [slides]

APOLONIO Project(from 01/04/2018 to 06/04/2018)

Visit of the CRIL for the APOLONIO (PEPS Project), at the Artois University in Lens, France.

GDR IA Project(from 11/12/2017 to 15/12/2017)

Visit of the CRIL for the GDR IA Project, at the Artois University in Lens, France.

BRAON 2017 (from 16/11/2017 to 20/11/2017)

Participation in the third edition of the workshop on Belief Revision, Argumentation, Ontologies, and Norms (BRAON 2017), at the Monte Mar Palace in Madeira, Portugal. [slides]

IDA 2017 (from 26/10/2017 to 28/10/2017)

Poster presentation for the Sixteenth International Symposium on Intelligent Data Analysis (IDA 2017), at the Woburn House in London, UK.

AMANDES Project (from 09/10/2017 to 11/10/2017)

Oral presentation for the 10th Meeting of the AMANDES Project, at the University of Paris Descartes, France.

25th LIRMM Anniversary (28/09/2017)

Poster presentation for the 25th Anniversary of the LIRMM at the Château d'Ô Domain of Montpellier, France.

2017 NLS Summer School (from 07/08/2017 to 11/08/2017)

Participation to the Third Nordic Logic Summer School at the Department of Mathematics of Stockholm, Sweden.

Doctiss 2017 (29/06/2017)

Organiser of the 25th Doctiss at the St Priest Campus, Montpellier, France .

AAMAS 2017 Conference(from 08/05/2017 to 12/05/2017)

AAMAS 2017 Conference at Sao Paulo - (Student scholarship).

Doctoral Statistics Course(from du 03/04/2017 to 07/04/2017)

Module ED: Statistique pour expérimentateurs.

Data Integration Workshop (2016)

Workshop - Intégration de données, connaissances et modèles. Atelier Protégé et Atelier Argumentation.

Get in Touch

Contact

Informatics Forum, 10 Crichton St, Edinburgh EH8 9AB