Paul Dunne is a Professor of CS at the University of Liverpool where he has worked since 1985. He studied CS at the University of Edinburgh (1977-1981) and completed his PhD research in the area of Boolean function complexity at Warwick University (1981-1984) under Mike Paterson's supervision. His collection of published work Formal Properties of Argumentation and Negotiation Frameworks was approved for the award of D.Sc by the University of Edinburgh in May 2010. In his time at Liverpool he has had experience in teaching all levels of undergraduate from first year through to Honours year presenting courses on Computability and Complexity Theory, Algorithms, History of Computation, Experimental Methods in CS, Operating Systems, and Analytic Methods in CS. He has published research in several fields including Boolean Function complexity, phase transition phenomena, AI and Law, complexity in multiagent systems, and has recently been most active in the area of models of Computational Argument. As well as strong involvement with the British Colloquium for Theoretical CS (BCTCS) from 1990 to 2001 (serving as Committee Member, Secretary and President as well as being Local Organiser for the 1991 meeting at Liverpool, he was active in establishing the biennial Computational Models of Argument (COMMA) conference following its inaugural meeting at Liverpool in 2006 and serving as President between 2008 and 2012. As well as the author of over 100 conference and journal papers he is the author of 3 books (1 research level monograph and two UG textbooks, the most recent being from May 2019). He is a member of the Editorial Boards of Artificial Intelligence Journal and Argument and Computation.