COMMA Conference (September 2020)
I presented the two papers the following two papers:
Who Am I?
I am Bruno Yun and I am a Lecturer at the University of Aberdeen since December 2019. I am affiliated with the Agents, Reasoning and Knowledge (ARK) group of the Department of Computing Science within the University of Aberdeen. My current research consists in 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 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 I defended my thesis in Computer Science in July 2019.
Argumentation Theory
Knowledge Representation
Logical formalisms
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
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
Publications
Ontologies and Concepts in Mind and Machine
Mehwish Alam, Tanya Braun, Bruno Yun, 25th International Conference on Conceptual Structures, Proceedings (2020).Sets of Attacking Arguments for Inconsistent Datalog Knowledge Bases
Bruno Yun, Srdjan Vesic and Madalina Croitoru, 8th International Conference on Computational Models of Argument (2020).Efficient Construction of Structured Argumentation Systems
Bruno Yun, Nir Oren and Madalina Croitoru, 8th International Conference on Computational Models of Argument (2020).An Incremental Algorithm for Computing All Repairs in Inconsistent Knowledge Bases
Bruno Yun and Madalina Croitoru, 25th International Conference on Conceptual Structures (2020).Ranking-Based Semantics for Sets of Attacking Arguments
Bruno Yun, Srdjan Vesic and Madalina Croitoru, 34th AAAI Conference on Artificial Intelligence (2020).Trust-based Multiagent Consensus For Weightings Aggregation
Bruno Yun and Madalina Croitoru, CoRR abs/2004.02490 (2020).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).Distance-Based Approaches to Repair Semantics in Ontology-based Data Access
César Prouté, Bruno Yun and Madalina Croitoru, CoRR abs/1910.00293 (2019).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).DAGGER: Datalog+/- Argumentation Graph GEneRator
Bruno Yun, Madalina Croitoru, Srdjan Vesic and Pierre Bisquert, 17th International Conference on Autonomous Agents and Multiagent Systems (2018).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).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).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).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).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).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).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).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).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).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).Strawberries and inconsistent ontologies: preferences to the rescue.
Bruno Yun, Master Thesis, 1--45 (2016).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).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).Teaching
- [2021-Now] Software Agents and Multi-agent systems (More details)
- [2021-Now] Applied AI
- [2019-Now] Languages and Computability (More details)
- [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 course at IUT Montpellier-Sète
- [2012-2014] Internship as a teacher apprentice (EAP) at Nevers High School
Previous student projects & PhD
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.
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.
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.
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.
Fig3. Screen capture of the fake booking website.
Git Repository
The git repository is accessible online on my github page.
Jun Zhao, Bruno Yun, Bénédicte Legastelois, Menisha Patel, Helena Webb, Michael Rovatsos, Marina Jirotka
Algorithm Playground is about investigating what makes algorithms more trustworthy. It aims at bringing a human perspective on decisions made by recommender systems. This is a tool developed by the Edinburgh Team involved in the ReEnTrust Project. Algorithm Playground gives users the chance to discover how the algorithms influence their choices when looking for a hotel to book. In this tool, the users can perform several tasks:
- Users can compute lists of recommended hotels for several persona with different genders and traits.
- Users can play with the inputs and watch the changes in the outcome.
- Users have the possibility to switch between several recommendation algorithms to see how this choice is crucial for any recommender system.
Demo
Please find below a demo video about Algorithm Playground.
Git Repository
The git repository is accessible online on Github
Scientific Events and activities
Internal Examiner (June 2020)
I served as an internal examiner for Rui Mao's thesis: "Computational Metaphor Processing".
GKR@ECAI 2020 Program Committee Member (2020)
I was a program committee member for the 6th International Workshop on Graph Structures for Knowledge Representation and Reasoning.
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.
UKRI Bootcamp (February 2020- April 2020)
I participated to the UKRI Bootcamp. It has been designed to enable researchers to transform their creative ideas into a draft proposal that can be submitted to a UK Research and Innovation (UKRI) Research Council.
PGR Supervision Training (March 2020)
I attended the New Supervisor Training. The topics covered were:
- PGR Supervision essentials (guides to policies/procedures and supervisory expectations).
- Supporting your PGR student (communications, listening and boundaries)
Trust, Privacy & The Internet of Things Early Career Workshop (01/12/2019 to 03/12/2019)
I participated to the Trust, Privacy & The Internet of Things Early Career Workshop at the Ardoe House Hotel and Spa.
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 [Submission]. 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]
2019 Annual GraphIK Seminar (17/12/2018)
Participation to the 2019 annual GraphIK seminar at the Grand Hôtel du Midi, Montpelier. [slides]
2018 SSA Summer School (from 06/09/2018 to 10/09/2018)
Participation to the 3rd Summer School on Argumentation: Computational and Linguistic Perspectives at the Warsaw University of Technology, Poland. Best SSA 2018 paper award for presenting "How Can You Mend A Broken Inconsistent KB in Existential Rules Using Argumentation".
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 .
2017 DL Workshop(from 18/07/2017 to 21/07/2017)
Organizing member of the 30th International Workshop on Description Logics, 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.
Contact
Room 228 (Second Floor), Meston Building, Meston Walk, Aberdeen AB24 3UE