Home Committees Programme Abstracts Gallery [New!] Review [New!] Registration Travel Information Accepted Papers Posters Download

**Invited speaker: Prof. Natasha Alechina**

**Title: Verifying existence of uniform strategies in systems of communicating agents**

**Abstract:**

I will present a logic of strategic ability that extends Alternating Time Temporal Logic (ATL) with syntactic epistemic modalities and explicit bounds on the cost of strategies. I will show that in a special kind of models, which have an explicit communication step before every action selection, the model checking problem for this logic is decidable under perfect recall uniform strategies. This result does not contradict known results on the undecidability of ATL with perfect recall uniform strategies, since the class of models is restricted to allow communication between agents in a coalition. This is joint work with Brian Logan and Mehdi Dastani.

**Biography:**

Natasha Alechina is an Associate Professor at the School of Computer Science at the University of Nottingham, UK. Her main research area is applications of logic in Computer Science and Artificial Intelligence. She has worked on modal logic, belief revision, logics for resource-bounded agents, logics for normative multi-agent systems, spatial logics, and resource logics.

**Invited speaker: Prof. Dr. Anthony Hunter**

** Title: Introduction to Probabilistic Argumentation**

**Abstract: **

Argumentation can be modelled at an abstract level using an argument graph (i.e. a directed graph where each node denotes an argument and each arc denotes an attack by one argument on another). Since argumentation involves uncertainty, it is potentially valuable to consider how this can quantified in argument graphs. In this talk, we will consider two probabilistic approaches for modeling uncertainty in argumentation. The first is the constellation approach which involves a probability distribution over the subgraphs of the argument graph, and this can be used to represent the uncertainty over the structure of the graph. The second is the epistemic approach which involves a probability distribution over the subsets of the arguments, and this can be used to represent the uncertainty over which arguments are believed. The epistemic approach can be constrained to be consistent with Dung’s dialectical semantics, but it can also be used as a potential valuable alternative to Dung’s dialectical semantics. We will also consider empirical studies undertaken with participants that support the case of both the constellations and epistemic approaches.

**Biography:**

Anthony Hunter is a Professor of Artificial Intelligence, and Head of the Intelligent Systems Group, in the Department of Computer Science, University College London. His research interests are on inconsistency, argumentation, and knowledge merging. In the area of computational models of argument, he has made contributions on aspects of monological and dialogical argumentation, including deductive argumentation, probabilistic argumentation, and argumentation strategy. He has had funding for investigating the use of argumentation for decision making and sense making, and currently he is principal investigator on a couple of UK government-funded projects on computational persuasion.

**Invited speaker: Prof Xudong Luo**

**Abstract: **

In this talk we will briefly discuss the state-of-art of the applications of fuzzy logic in automated negotiation. More specifically, we will outline in automated negotiation systems how various kinds of fuzzy logic are used to evaluate oers, generate oer or counter-oer, analyse opponents, and predict their strategies. Moreover, we will also briefly discuss our main work on this topic, which is about how to integrate a kind of argumentation method into a fuzzy constraint based negotiation model, how to use fuzzy logic to update negotiators preferences dynamically, how to use 2-type fuzzy logic to represent a kind of concession strategy, and so on.

**Biography: **

Currently, Prof. Xudong Luo is a distinguished professor at Guangxi Normal University. Before moving to this position, he worked, as a distinguished professor, at Sun Yat-sen University. Before coming back to China in 2011, he had been a senior research fellow, a research fellow, and a lecturer, respectively, at City University of Hong Kong, Nanyang Technological University, Chinese University of Hong Kong, University of Birmingham, and University of Southampton, respectively. He received a PhD in Artificial Intelligence from the University of New England, Australia, an MSc degree in Computer Science from the Chinese Academy of Sciences, and a BSc degree in Mathematics and Computer Science from Southwest University, China. Prof. Luo published more than 160 papers including 2 in top journal Artificial Intelligence. He has international recognized reputation: PC chairs, members or senior member of over 100 international conferences including some major ones (such as IJCAI) and referees for first class international journals (such as Artificial Intelligence) and some major conferences (such as IJCAI). He was invited to present his work in some conferences and many universities in dierent countries. Prof. Luo’s research interest centers on fuzzy logic, automated negotiation, game theory, and decision-making.

**Invited speaker: Dr. Tjitze Rienstra**

**Title: On the relationship between argumentation networks and Bayesian networks.**

**Abstract: **

Argumentation networks and Bayesian networks are two graph-theoretical formalisms used in AI that serve different purposes.

In this talk I will show that it is nevertheless possible to treat them in a unifying manner. The core idea is to interpret argumentation

networks like Bayesian networks, by exploiting the fact that attacks in argumentation represent a specific kind of influence between variables. Furthermore, cycles can be dealt with by considering factorisation along the SCCs (strongly connected components) of the argumentation network. This approach provides not only novel theoretical insights about the relationship between the two formalisms, but also forms the basis for a new and principled approach to probabilistic argumentation.

**Biography: **

Tjitze Rienstra received his PhD in 2014 at the University of Luxembourg and the University of Montpellier II. His research

interests include argumentation theory and reasoning under uncertainty. He currently holds a postdoctoral position at the Institute for Web Science and Technologies at the University of Koblenz-Landau.