معرفی
Professor Paul Dunne is a faculty member at the University of Liverpool, where he has worked since 1985. He studied Computer Science at the University of Edinburgh (1977–1981) and earned his PhD in Boolean function complexity at Warwick University (1981–1984) under Mike Paterson. In 2010, he received a D.Sc. from Edinburgh for his work on argumentation frameworks.
- Education
- BS in Computer Science, University of Edinburgh (1977–1981)
- PhD in Boolean Function Complexity, University of Warwick (1981–1984)
His research spans Boolean function complexity, AI and Law, phase transition phenomena, and computational argumentation. He has pioneered models of computational argumentation and contributed to multiagent systems. His recent work focuses on decidability in argumentation semantics and coalition value allocation algorithms.
Key article trends include:
- Foundations of argumentation theory and its computational complexity
- Applications in multiagent negotiation and coalition formation
- Formal analysis of logical frameworks in AI
- Epistemological and algorithmic challenges in theoretical CS
Scientific awards:
- D.Sc. (University of Edinburgh, 2010)
He has authored over 100 peer-reviewed publications and three books, including Computation Counts: An Introduction to Analytic Concepts in Computer Science. He serves on editorial boards of Artificial Intelligence Journal and Argument and Computation, and has held leadership roles in conferences like COMMA and BCTCS. His teaching includes courses on computability, complexity theory, and analytic methods for CS undergraduates.
