Research Interests and Publications

Research Interests

Publications

Books
Book contributions
Refereed Journals
Proceedings of refereed conferences
In submission/preparation

DBLP Bibliography

Google Scholar Page

ORCID ID: 0000-0002-6033-3742

Research Grants

Editorial Boards and Programme Committees

Research Interests

Complexity of Dialogue and Argumentation

I have been involved with this field working mainly with Trevor Bench-Capon since May 2001. Argument Systems were first formalised in the mid 1980s as a mechanism for modelling reasoning (including concepts of acceptability and defeasibilty of a proposition) with particular applications to the non-classical Logics which have been applied in Artificial Intelligence work. Within this formalism several researchers advanced various concepts of `Dialogue Game' with which to investigate models of reasoning processes. At present one research paper has been submitted that presents proofs of intractability for decision problems related to the two most commonly used concepts of acceptability. Two further papers are in development. The first of these introduces formal ideas concerning dispute complexity - an aspect of dialogue games that has been largely overlooked in earlier work - and establishes that one game approach is provably `weak' in the sense that it corresponds to a simple propositional proof system (the cut-free Sequent Calculus). In consequence this game can take significantly many rounds to establish the validity of quite simple argument positions.

Coalitional Games

The article Wooldridge and Dunne (2004) formulates a model of `qualitative coalitional games' (QCGs) and characterises the computational complexity of a number of decision problesm within it. Current work stemming from this includes investigation of concepts of `goal preferences', modelling of so-called `coalitional resource games' which can be viewed as a special class of QCG; and approaches to relating game properties described by propositional logic formulae in via modal logics.

Contract and resource allocation mechanisms

Work in this area has considered both complexity questions relating to the existence of particular types of negotiation plans, (Dunne, Wooldridge and Laurence, 2003; revised article currently in submission); as well as combinatorial results concerning the worst-case lengths of such plans when these can be formulated. An important result of this work is the article Dunne (2004)

Complexity of Agent Design Problems

I have been working in this field with Prof. M. Wooldridge since June 2000. The model and results presented in Wooldridge(2000) have been extensively developed leading to a paper (currently in submission) which completely characterises the complexity status of single goal achievement and maintenance problems for various combinations of agent and enviroment representations. Subsequent work has involved classifying the complexity of agent design tasks in which the task is encoded as an arbitrary propositional formula - single goal problems being a special case of this - and in properties of agent design tasks specified using quantified formulae. Developing a more extensive formalism and study of its algorithmic properties form part of the research on EPSRC Grant GR/R60836/01 commencing January 2002. This aims to address issues other than existence questions, e.g. verification and synthesis of agents.

Phase-Transitions in Combinatorial Search

Complexity Theory of Boolean Functions

Top of page

Publications and Submitted Papers

Books & Theses

P. E. Dunne Computation Counts - An Introduction to Analytic Concepts in Computer Science, Vol. 23 of Texts in Computing, College Publications, May 2019 (540 pages) (ISBN: 978-1-84890-310-4)
(Summary in:
P.E. Dunne. Computation Counts - An Introduction to Analytic Concepts in Computer Science (overview) Bulletin of the EATCS, 128, June 2019, pp. 142-149)
P. E. Dunne Formal Properties of Argumentation and Negotiation Frameworks, D.Sc. Thesis, Univ. of Edinburgh, (awarded May 2010)
P.E. Dunne and T. Bench-Capon (editors) Computational Models of Argument (Proc. of COMMA 2006), September 2006, FAIA 144, IOS Press.
P.E. Dunne. The Complexity of Boolean Networks. Academic Press, 1988 (512 pages)
(This is a compressed pdf file, the original figures are no longer available).
P.E. Dunne. Computability Theory - Concepts and Applications. Ellis Horwood, 1991 (150 pages)
P.E. Dunne Techniques for the analysis of monotone Boolean networks, Ph.D. Thesis, Univ. of Warwick, 1984
Top of page

Book Contributions
W. Dvorak & P. E. Dunne Computational problems in formal argumentation and their complexity. Handbook of Formal Argumentation, College Publications (2018), pp. 631-687
P. E. Dunne. Propositional Encodings of Value-based Argumentation Questions. In: From Knowledge Representation to Argumentation in AI, Law and Polcy Making. A Festschrift in Honour of Trevor Bench-Capon on the Occasion of his 60th Birthday, College Publications, Tributes 21, 2013, 97-114.
P. E. Dunne. Irrationality in Persuasive Argumentation. In: Logic Programs, Norms and Action -- Essays in Honor of Marek J. Sergot on the Occasion of His 60th Birthday, Springer LNCS 7360, 2012, 234-248
P. E. Dunne and M. Wooldridge. Complexity of Abstract Argumentation. Chapter 5 of: Argumentation in Artificial Intelligence (Ed: I. Rahwan and G. Simari), Springer, pages 85-104, 2009
T. Agotnes, P. E. Dunne, W. van der Hoek and M. Wooldridge. Logics for coalitional games. In: A meeting of the minds (ed: J. van Benthem, S. Ju and F. Veltman), College Publications, Texts in Computer Science, No. 8, pages 3--20, 2007
P.E. Dunne and P. McBurney. Concepts of Optimal Utterance in Dialogue: Selection and Complexity. in: Advances in Agent Communication(Ed: F. Dignum), Springer-Verlag, LNAI 2922, 310-328, 2004
P.E. Dunne, M. Amos and A. Gibbons. Boolean Transitive Closure in DNA, IN: Biomolecular Computing. Theory and Experiment (Ed: G. Paun), Springer-Verlag, 1998, 127-137
P.E. Dunne. Relationships between monotone and non-monotone network complexity. Invited contribution to Boolean Function Complexity, (Ed: M.S. Paterson), London Mathematical Society Lecture Note Series, No. 169, Cambridge Univ. Press, 1992, pp 1-24
P.E. Dunne. Superpolynomial lower bounds on monotone network complexity. Invited contribution to: Theoretical Foundations of VLSI Design (Ed: K. McEvoy and J.V. Tucker), Cambridge Univ. Press, 1990, pp 403-438
Top of page

Refereed Journals
P. E. Dunne. Decidability in argumentation semantics (to appear: Argument & Computation)
P. E. Dunne, P. Harrenstein, S. Kraus and M. J. Wooldridge. Delegating decisions in strategic settings. IEEE Transactions on Artificial Intelligence, 1:19-33, 2020
P. E. Dunne. Characterizing Strongly Admissible Sets. Argument & Computation, 11:239-255, 2020
S. Nofal, K. Atkinson and P. E. Dunne. Computing Grounded Extensions of Abstract Argumentation Frameworks. The Computer Journal, 64:54--63, 2021
M. Caminada and P. E. Dunne. Strong admissibility revisited: theory and applications. Argument & Computation (available on-line August 2019)
S. Nofal, K. Atkinson and P. E. Dunne. On checking skeptical and ideal admissibility in abstract argumentation frameworks. Information Proc. Letters, 148:7-12, 2019
S. Nofal, K. Atkinson, P. E. Dunne Looking-ahead in Backtracking Algorithms for Abstract Argumentation. Intnl Jnl of Approximate Reasoning, 78:265-282, 2016
P. E. Dunne, W. Dvorak, T. Linsbichler, and S. Woltran. Characteristics of Multiple Viewpoints in Abstract Argumentation. Artificial Intelligence, 228:153-178, November 2015
P. E. Dunne. Justice and the Holocaust. Sight and Sound, 23(3):111, January 2015 (correspondence)
A. Wyner, T. Bench-Capon, P. E. Dunne and F. Cerutti. Senses of `argument' in instantiated argumentation frameworks Argument and Computation, 6(1):50-72, 2015
S. Nofal, K. Atkinson and P. E. Dunne. Algorithms for Argumentation Semantics: Labeling Attacks as a Generalization of Labeling Arguments, Jnl. of AI Research, 49, 635-668, April 2014
S. Nofal, K. Atkinson and P. E. Dunne. Algorithms for Decision Problems in Argument Systems under Preferred Semantics. Artificial Intelligence, 207:23-51, February 2014
P. Baroni, F. Cerutti, P. E. Dunne, and M. Giacomin. Automata for infinite argumentation structures. Artificial Intelligence, 203:104-150, October 2013
W. Dvorak, P. E. Dunne and S. Woltran. Parametric Properties of Ideal Semantics. Artificial Intelligence, 202:1-28, September 2013
M. Caminada, W. A. Carnielli and P.~E. Dunne. Semi-stable semantics. Jnl. of Logic and Computation, 22:1207-1254, October 2012
P. Baroni, P.E. Dunne and M. Giacomin. On the resolution-based family of abstract argumentation semantics and its grounded instance., Artificial Intelligence, 175(3-4):791-813, March 2011
P.E. Dunne, A. Hunter, P. McBurney, S. Parsons and M. Wooldridge. Weighted argument systems: basic definitions, algorithms, and complexity results., Artificial Intelligence, 175(2):457-86, February 2011
P.E. Dunne On constructing minimal formulae. The Computer Journal, 54:1067-1075, 2011
P.E Dunne, S. Kraus, E. Manisterski and M. Wooldridge. Solving Coalitional Resource Games. Artificial Intelligence, 174:20-50, 2010
P.E. Dunne. The computational complexity of ideal semantics. Artificial Intelligence, 173:1559-1591, 2009
P. E. Dunne and Y. Chevaleyre. The complexity of deciding reachability properties of distributed negotiation schemes. Theoretical Computer Science, 396, 2008, 113-144
P. E. Dunne. Computational properties of argument systems satisfying graph-theoretic constraints. Artificial Intelligence, 171, July-October 2007, 701-729
T.J.M. Bench-Capon and P. E. Dunne. Argumentation in Artificial Intelligence. Artificial Intelligence, 171, July-October 2007, 619-641
P.E. Dunne, W. van der Hoek, and M. Wooldridge. A logical characterisation of qualitative coalitional games. Jnl. of Applied Non-Classical logics, 17(4), 2007, 457-507
T.J.M. Bench-Capon, S. Doutre and P. E. Dunne. Audiences in Argumentation Frameworks. Artificial Intelligence, 171, January 2007, 42-71
M.J. Wooldridge and P.E. Dunne. On the Computational Complexity of Coalitional Resource Games. Artificial Intelligence, 170/10, July 2006, 835-871
P.E. Dunne. A Value-based Argument Model of Convention Degradation. Artificial Intelligence and Law, 13:1, March 2006, 153--188
T.J.M. Bench-Capon and P.E. Dunne. Argumentation in AI and Law. Artificial Intelligence and Law, 13:1, March 2006, 1--8
Y. Chevaleyre, P.E. Dunne, U. Endriss, J. Lang, M. Lemaitre, N. Maudet, J. Padget, S. Phelps, J.A. Rodriguez-Aguilar and P. Sousa. Issues in Multiagent Resource Allocation. Informatica, 30, 2006, 3-31
M.J. Wooldridge and P.E. Dunne. The complexity of agent design problems: determinism and history dependence. Annals of Mathematics and Artificial Intelligence, 45, December 2005, 343-371
Y. Chevaleyre, P.E. Dunne, U. Endriss, J. Lang and J.A. Rodriguez-Aguilar. Multiagent Resource Allocation. Knowledge Engineering Review, 20:2, 2005, 143-149
P.E. Dunne, M. Wooldridge and M. Laurence. The Complexity of Contract Negotiation. Artificial Intelligence, 164, May 2005, pp. 23-46
P.E. Dunne. Extremal Behaviour in Multiagent Contract Negotiation. Journal of Artificial Intelligence Research, 23, January 2005, pp. 41-78
M.J. Wooldridge and P.E. Dunne. On the computational complexity of qualitative coalitional games. Artificial Intelligence, 158/1 September 2004, pp. 27-73
P.E. Dunne, M.R. Laurence and M. Wooldridge. Complexity Results for Agent Design Problems. Annals of Mathematics, Computing, and Teleinformatics, 1(1), January 2004, pp. 19-36
P.E. Dunne and T.J.M. Bench-Capon. Two Party Immediate Response Disputes: Properties and Efficiency. Artificial Intelligence, 149/2 (2003), pp 221-250
P.E. Dunne and T.J.M. Bench-Capon. Coherence in Finite Argument Systems. Artificial Intelligence, 141/1-2 (October, 2002) pp 187-203
P.E. Dunne, P.H. Leng and G.F. Nwana. Distributed Logic simulation using a network of loosely coupled processors. Journal of Systems Architecture, 47/14-15 (2002) pp 1117-1128
W.Duckworth, P.E. Dunne, A.M.Gibbons and M.Zito. Leafy Spanning Trees in Hypercubes. Applied Mathematics Letters, 14 (7) (2001) pp 801-804
P.E. Dunne and T.J.M. Bench-Capon. A sharp threshold for the phase transition of a restricted satisfiability problem for horn clauses. Journal of Logic and Algebraic Prog., 47/1, 2001, pp 1-14
P.E. Dunne, A. Gibbons and M. Zito. Complexity-theoretic models of phase-transitions in search problems. Theoretical Computer Science, 294/2, October 2000, pp 243-263.
P.E. Dunne and P.H. Leng. The Average Case Performance of an Algorithm for Demand-driven Evaluation of Boolean Formulae. Journal of Universal Computer Science, 5(5), 1999, pp 288-306
M. Amos, P.E. Dunne and A. Gibbons. Toward feasible and efficient DNA Algorithms, Complexity, 4(1), September/October 1998, pp 14-18
P.E. Dunne and M. Zito. An improved upper bound on the non-3-colourability threshold.Inf. Proc. Letters, 65 (1), February 1998, pp 17-23
P.E. Dunne and T.J.M. Bench-Capon. The maximum length of prime implicates for instances of 3-SAT. Artificial Intelligence, 92, 1997, pp 317-329
T.J.M. Bench-Capon, P.E. Dunne and G. Staniford. Modelling Legal Documents as Graphs. The Journal of Information and Communication Technology Law, 6 (2), 1997, pp 103-120
P.E. Dunne. Ceilings of Monotone Boolean Functions. Journal of Universal Computer Science, 2 (7), July 1996, pp 533-548
P.E. Dunne, C.J. Gittings and P.H. Leng. Multiprocessor simulation strategies with optimal speed-up.Inf. Proc. Letters, 54 (1), April 1995, pp 23-33
P.E. Dunne, P.H. Leng and G.F. Nwana. On the complexity of Boolean functions computed by lazy oracles. IEEE Transactions on Computers, 44 (4), April 1995, pp 495-502
T.J.M. Bench-Capon, P.E. Dunne and G. Staniford. Exploiting document structure in retrieval from legal hypertexts. Informatica e diritto, XX annata - Seconda serie - vol III (1994) - n.2, pp 177-194
C.C. Charlton, P.E. Dunne, P.H. Leng, J. Little and M.R. Woodward. Distributing Quality-Controlled Software via the Internet. Microprocessing and Microprogramming, 40 (10), 1994, pp 861-864
P.E. Dunne, C.J. Gittings and P.H. Leng. Sequential and Parallel Strategies for the demand-driven simulation of logic circuits. Microprocessing and Microprogramming, 38, 1993, pp 519-525
C.C. Charlton, P.E. Dunne, K. Halewood and P.H. Leng. An algorithm to generate random large combinational circuits. The Computer Journal, (36, No. 2), 1993, pp 200-206
T.J.M. Bench-Capon, F. Coenen and P.E. Dunne. Integrating Legal Support Systems through document models. Expert Systems with Applications, 4, 1992, pp 355-362
P.E. Dunne and P.H. Leng. An algorithm for optimising signal selection in demand-driven circuit simulation, Transactions of the Society for Computer Simulation, Vol. 8, No.4, (1992), pp 269-280
P.E. Dunne. Comments on Kochol's paper "Efficient monotone circuits for threshold functions". Inf. Proc. Letters, (34, No.5) 1990, pp 221-222
J.Barlow, P.E. Dunne and R.Rada. EXPERTEXT: from semantic nets to logic Petri nets. Expert systems with applications, (1) 1990, pp 51-62
T.J.M. Bench-Capon and P.E. Dunne. Some computational properties of a model for electronic documents. Electronic Publishing - Origination, Dissemination and Design, (2), 1989, pp 231-256
P.E. Dunne. On monotone simulations of non-monotone networks.Theoretical Computer Science (66) 1989 pp 15-25
P.E. Dunne. A result on k-valent graphs and its application to a graph embedding problem. Acta Informatica, (24) 1987, pp 447-459
P.E. Dunne. The complexity of central slice functions.Theoretical Computer Science (44) 1986 pp 247-257
P.E. Dunne. A 2.5n lower bound on the monotone network complexity of T₃ⁿ.Acta Informatica (22) 1985 pp 294-305
P.E. Dunne. Embedding graphs into grids. IUCC Bulletin, Spring 1982, (4) No. 1, pp 17-21. (Awarded Best Paper prize when presented at IUCC Colloquium, Univ. of Newcastle, Sept. 1981.)
Top of page

Proceedings of Refereed Conferences
P. E. Dunne. Well, to Be Honest, I Wouldn't Start from Here at All. Proc. COMMA 2022, IOS Press, volume 353 of FAIA, pages 3--14, 2022.
(invited talk 16th September. Version of talk available here
M. Caminada and P. E. Dunne. Minimal Strong Admissibility: a Complexity Analysis. Proc. COMMA 2020, IOS Press, volume 326 of FAIA, pages 135--146, 2020
P. E. Dunne. Unconscious patterns in argument: fractal dimension in oratory. (accepted as full paper for 7th COMMA (Polish Acad. of Sciences, Warsaw, 12-14 September 2018)
J. Butterworth and P. E. Dunne. Spectral Techniques in Argumentation Framework Analysis. Proc. 6th COMMA, Potsdam, Germany, FAIA 287, 14-16 September, 2016, pages 167-178
University of Liverpool news item related to this article
P. E. Dunne. I heard you the first time: debate in cacophonous surroundings. Proc. 6th COMMA, Potsdam, Germany, FAIA 287, 14-16 September, 2016, pages 287-298
P. E. Dunne. Forbidden Sets in Argumentation Semantics. Proc. 6th COMMA, Potsdam, Germany, FAIA 287, 14-16 September, 2016, pages 275-286
P. E. Dunne, T. Linsbichler, C. Spanring and S. Woltran. Investigating the Relationship between Argumentation Semantics via Signatures. Proc. 25th IJCAI, New York, 9-15 July, 2016, pages 1051-57
L. Riley, K. Atkinson, P. E. Dunne and T. Payne A Synergy Coalition Group based Dynamic Programming Algorithm for Coalition Formation (to appear Proc. 15th AAMAS, Singapore, 9--13 May, 2016)
L. Riley, K. Atkinson, P. E. Dunne and T. Payne Distributing Coalition Value Calculations to Coalition Members Proc. 29th AAAI, Austin, Texas, January 25-29, 2015
R. Booth, M. Caminada, P. E. Dunne, M. Podlaszewski and I. Rahwan. Complexity Properties of Critical Sets of Arguments. Proc. 5th COMMA, Pitlochry, IOS Press, FAIA 266, September 2014, pages 173-184.
P.~E. Dunne and K. Atkinson. Properties of Random VAFs and Implications for Efficient Algorithms. Proc. 5th COMMA, Pitlochry, IOS Press, FAIA 266, September 2014, pages 261-268.
P.E. Dunne, W. Dvorak, T. Linsbichler and S. Woltran. Characteristics of Multiple Viewpoints in Abstract Argumentation. in: Proc. KR 2014, pages 72-81, 20-24 July 2014, Vienna
F. Cerutti, P.E. Dunne, M. Giacomin and M. Valla. A SAT-based Approach for Computing Extensions in Abstract Argumentation. in: Proc. TAFA-13, Beijing, August 2013, pages 176-193
S. Nofal, P.E. Dunne, and K. Atkinson. Algorithms for acceptance in argument systems. Proc. ICAART, SciTePress, Barcelona, February 2013
S. Nofal, P.E. Dunne and K. Atkinson. On Preferred Extension Enumeration in Abstract Argumentation. Proc. 4th COMMA, IOS Press, FAIA 245, Vienna, September 2012, pages 205-216
S. Nofal, P.E. Dunne and K. Atkinson. Towards Experimental Algorithms for Abstract Argumentation. Proc. 4th COMMA, IOS Press, FAIA 245, Vienna, September 2012, pages 217-228
P.E. Dunne, P. Marquis and M. Wooldridge. Argument Aggregation: Basic Axioms and Complexity Results. Proc. 4th COMMA, IOS Press, FAIA 245, Vienna, September 2012, pages 129-140
K. Atkinson, P.E. Dunne and T.J.M. Bench-Capon Uniform Argumentation Frameworks. Proc. 4th COMMA, IOS Press, FAIA 245, Vienna, September 2012, pages 165-176
M. Wooldridge and P. E. Dunne. Towards Tractable Boolean Games. Proc. AAMAS 2012, Valencia, June 2012, pages 939--946.
G. Brewka, P.E. Dunne and S. Woltran. Relating the Semantics of Abstract Dialectical Frameworks and Standard AFs. Proc. 22nd IJCAI, Barcelona, July 2011, pages 780--785
Video of presentation
W. Dvorak, P.E. Dunne and S. Woltran. Parametric Properties of Ideal Semantics. Proc. 22nd IJCAI, Barcelona, July 2011, pages 851--856
P. Baroni, F. Cerutti, P. E. Dunne and M. Giacomin. Computing with Infinite Argumentation Frameworks: the Case of AFRAs. 1st TAFA, Springer LNCS 7132, 2012, pages 197-213
S. Nofal, P.~E. Dunne and K. Atkinson. Towards Average-case Algorithms for Abstract Argumentation. Proc. ICAART, (1), SciTePress, Algarve, February 2012, pages 225-230
P. Baroni, P.E. Dunne and M. Giacomin. On extension counting problems in argumentation frameworks. Proc. 3rd COMMA, Univ. of Brescia, Italy, FAIA 216, IOS Press, September 2010, pages 63-74
P.E. Dunne. Tractability in value-based argumentation. Proc. 3rd COMMA, Univ. of Brescia, Italy, FAIA 216, IOS Press, September 2010, pages 195-206
P.E. Dunne, A.J. Garcia, D.C. Martinez and G.R. Simari. Computation with varied-strength attacks in abstract argumentation frameworks. Proc. 3rd COMMA, Univ. of Brescia, Italy, FAIA 216, IOS Press, September 2010, pages 207-218
F.S. Nawwab, T. Bench-Capon, P.E. Dunne. Exploring the Role of Emotions in Rational Decision Making. Proc. 3rd COMMA, Univ. of Brescia, Italy, FAIA 216, IOS Press, September 2010, pages 367-378
P.E. Dunne, S. Modgil and T. Bench-Capon. Computation in Extended Argumentation Frameworks. Proc. 19th ECAI, Univ. of Lisbon, Portugal, FAIA 215, IOS Press, August 2010, pages 119-124
A. Wyner, T. Bench-Capon and P.E. Dunne. Instantiating Knowledge Bases in Abstract Argumentation Frameworks. (to appear AAAI Fall Symposum on Argumentation, November 2009)
P. Baroni, P.E. Dunne and M. Giacomin. Computational properties of resolution-based grounded semantics. Proc. 21st Int. Joint Conf. on AI, (IJCAI09), Pasadena, July 2009, pages 683--689
F.S. Nawwab, T. Bench-Capon, and P.E. Dunne. Emotions in Rational Decision Making. Proc. ArgMAS 2009, Budapest, 2009, pages 107--124
P.E. Dunne, A. Hunter, P. McBurney, S. Parsons and M. Wooldridge. Inconsistency tolerance in weighted argument systems. Proc. 8th Int. Conf. on Autononous Agents and Multiagent Systems (AAMAS 2009), Budapest, May 2009, pages 851-858
P.E. Dunne and M. Caminada. Computational complexity of Semi-stable semantics in abstract argumentation frameworks. Proc. 11th European Conference on Logics in Artificial Intelligence (JELIA08), Dresden, (Eds: S. Holldobler, C. Lutz and H. Wansing), Springer LNAI 5293, pages 153--165, September 2008.
P.E. Dunne, S. Kraus, W. van der Hoek, and M. Wooldridge. Cooperative Boolean Games. Proc. 7th Int. Conf. on Autononous Agents and Multiagent Systems (AAMAS 2008), May 2008, pages 1015-1023 (Awarded Best Paper Prize)
P.E. Dunne. The computational complexity of ideal semantics I: abstract argumentation frameworks. Proc. COMMA'08, May 2008, FAIA 172, pages 147-158
T. Bench-Capon, S. Doutre and P.E. Dunne Asking the right question: forcing commitment in examination dialogues. Proc. COMMA'08, May 2008, FAIA 172, pages 49-60
F. Nawab, T. Bench-Capon and P.E. Dunne. A Methodology for Action-Selection using Value-Based Argumentation Proc. COMMA'08, May 2008, , FAIA 172, pages 264-275
M. Wooldridge, T. Agotnes, P. E. Dunne and W. van der Hoek. Logic for automated mechanism design -- a progress report. to appear: Proc. AAAI-07, July 2007
P.E. Dunne. Suspicion of Hidden Agenda in Persuasive Argument. Proc. COMMA 2006, September 2006, FAIA 144, IOS Press, pages 329-340
P.E. Dunne. Complexity Properties of Restricted Abstract Argument Systems. Proc. COMMA 2006, September 2006, FAIA 144, IOS Press, pages 85--96
M.J. Wooldridge, P.E. Dunne and S. Parsons. On the complexity of linking deductive and abstract argument systems. Proc. 21st National Conference on Artificial Intelligence (AAAI-06), July 2006, pages 299-304
S. Doutre, T.J.M. Bench-Capon and P. E. Dunne. Determining Preferences through Argumentation. Proc. AI*IA'05, Milan, September 2005, LNAI 3673, Springer-Verlag, pages 98-109
P.E. Dunne. Multiagent Resource Allocation in the Presence of Externalities. Proc. CEEMAS'05, Budapest, September 2005, LNAI 3690, Springer-Verlag, pages 408--417
P.E. Dunne. A Value-based Argument Model of Convention Degradation. Proc. Workshop on Argumentation in A.I. and Law, Bologna, June 2005, Wolf Legal Publishers, pages 39-51.
S. Doutre, T.J.M. Bench-Capon and P. E. Dunne. Explaining preferences with argument positions. Proc. IJCAI-05, Edinburgh, August 2005, pages 1560--1561
P.E. Dunne, S. Doutre and T.J.M. Bench-Capon. Discovering Inconsistency through Examination Dialogues. Proc. IJCAI-05, Edinburgh, August 2005, pages 1680--1681
P.E. Dunne and W. van der Hoeke. Representation and Complexity in Boolean Games. Proc. 9th European Conference on Logics in Artificial Intelligence (JELIA'04, Lisbon, September 27th-30th 2004, LNAI 3229, Springer-Verlag, pages 347-35
P.E. Dunne and T.J.M. Bench-Capon. Complexity in Value-Based Argument Systems. Proc. 9th European Conference on Logics in Artificial Intelligence (JELIA'04), Lisbon, September 27th-30th 2004, LNAI 3229, Springer-Verlag, pages 360-371
T.J.M. Bench-Capon and P.E. Dunne. Developing Argumentation Positions 4th Worskhop on Computer Models of Natural Argument, Valencia, 23rd-24th August 2004
M.J. Wooldridge and P.E. Dunne. Preferences in qualitative coalitional games. Proc. Sixth Workshop on Game Theoretic and Decision Theoretic Agents, (GTDT'04), New York, 20th July 2004, pages 29-38
P.E. Dunne and T.J.M. Bench-Capon. Identifying Audience Preferences in Legal and Social Domains. Proc. DEXA'04, Zaragoza, August 2004, LNCS 3180. Springer Verlag, pages 518-527.
P.E. Dunne. Context Dependence in Multiagent Resource Allocation. Proc. ECAI'04, Valencia, August 2004, IOS Press, pages 1001-2
P.E. Dunne, M.R. Laurence and M.J. Wooldridge. Tractability results for automatic contracting. Proc. ECAI'04, Valencia, August 2004, IOS Press, pages 1003-4
P.E. Dunne and P. McBurney. Optimal Utterances in Dialogue Protocols. Proc. Second International joint Conference on Autonomous Agents and Multiagent Systems (AAMAS'03), July 2003, ACM Press, 608-615
P.E. Dunne. Prevarication in Dispute Protocols. Proc. Ninth International Conference on A.I. and Law, (ICAIL' 03), Edinburgh, June 24th-28th 2003, ACM Press, 12-21
P.E. Dunne, M.J.Wooldridge and M.R. Laurence. The computational complexity of boolean and stochastic agent design problems. Proc. First International joint Conference on Autonomous Agents and Multiagent Systems (AAMAS'02), Bologna, ACM Press, 976-983
T.J.M. Bench-Capon and P.E. Dunne. No Agent is an Island: A Framework for the Study of Inter-Agent Behavior. Proc. First International joint Conference on Autonomous Agents and Multiagent Systems (AAMAS'02), Bologna, ACM Press, 690-691
P.E. Dunne. On Concise Encodings of Preferred Extensions. Proc. 9th Non-monotonic Reasoning Workshop (NMR'2002), Toulouse, April 2002, 393-398
M.J.Wooldridge and P.E. Dunne. The Computational Complexity of Agent Verification, Proc. ATAL-2001 (Eds. J.-J. Ch. Meyer and M. Tambe), Springer-Verlag, 2002, pp. 115-127
M.J. Wooldridge, and P.E. Dunne. Optimistic and Disjunctive Agent Design Problems, In Y. Lesperanceand C. Castelfranchi, editors, Intelligent Agents VII Springer-Verlag Lecture Notes in AI Volume, February 2001.
P.E. Dunne, A. Gibbons and M.Zito. Algorithmic and complexity issues concerning phase-transition phenomena in combinatorial problems, Proc. of the 10th Australasian Workshop on Combinatorial Algorithms (AWOCA'99) (editors R.Raman and J.Simpson), University of Curtin, Perth WA, 76-90, August 1999.
P.E. Dunne, A. Gibbons and M.Zito. On Complexity-Theoretic Models of Phase Transitions in Search Problems. Proc. 9th Australasian Workshop on Combinatorial Algorithms, Perth, Western Australia, July 1998, pp. 85-97
M. Amos, P.E. Dunne and A. Gibbons. DNA Simulation of Boolean Circuits. Proc. Genetic Programming 1998 Proc. 3rd Annual Conf., Univ. of Wisconsin, July 1998, pp. 679-683
M. Amos, A. Gibbons and P.E. Dunne. The complexity and viability of DNA computations. Proc. Bio-computing and emergent computation Conference, Skovde, Sweden, September 1997, pp. 165-173
F. Coenen and P.E. Dunne. Verification and Validation of rulebases using a binary encoded incidence matrix technique. Proc. EUROVAV '97, (Katholieke Universiteit Leuven, Belgium), 1997, pp 43-53
T.J.M. Bench-Capon and P.E. Dunne. Structure Based Retrieval of Legal Documents, in: S. Binazzi (ed), Verso un Sistema Esperto Giuridico Integrale, Tomo II, CEDAM: Padova 1996, pp 409-418.
A. Antonacopolous, T.J.M. Bench-Capon and P.E. Dunne. Presenting Legislation as hypertext, Proceedings of the Fifth National/First European Conference on Law, Computers and Artificial Intelligence: EUCLID, Exeter, 1996, pp 1-9
C.C. Charlton, P.E. Dunne, P.H. Leng, J. Little and M.R. Woodward. Distributing Quality-Controlled Software via the Internet, Proc 20th Euromicro Conference, 1994, pp 861-864
T.J.M. Bench-Capon, P.E. Dunne and G. Staniford. Linearisation Schemata for Hypertext, Database and Expert Systems Applications, Springer-Verlag Lecture Notes in Computer Science, Vol. 720, 1993, pp 697-708
P.E. Dunne, P.H. Leng and G.F. Nwana. Distributed logic simulation on a network of workstations, Proc. UKUUG/SUKUG Joint Conference, 1993, pp 61-71
T.J.M. Bench-Capon, P.E. Dunne and G. Staniford. Cooperative Dialogues with the support of autonomous agents, Proc. ICICIS `93: Intnl. Conf. on Intelligent and Cooperative Information Systems, (Ed: M. Hunhns, M.P. Papazogoulou, G. Schlageter), IEEE Comp. Soc. Press, 1993, pp 144-152
T.J.M. Bench-Capon, P.E. Dunne and P.H. Leng. A Dialogue Game for Dialectical Interaction with Expert Systems, Proc. 12th Annual Conference on Expert Systems and their applications, Avignon, May 1992, pp 105-113
P.E. Dunne and G. Staniford. CASS - A Computer authorship support system. Proc. Sixiemes Journees internationales des Sciences Informatiques: Les Systemes d'Information de l'idee a la concretisation, Tunis, 1992, pp 129-140
T.J.M. Bench-Capon, P.E. Dunne and G. Staniford. Linearising Hypertext through Target Graph Specifications. In: Database and Expert Systems Applications (Proc. of the International Conference in Valencia), Springer-Verlag, 1992, pp 173-178
C.C. Charlton, P.E. Dunne, D. Jackson, P.H. Leng and J. Little. A workstation environment for digital systems design and programming Proc. UKUUG summer 1991 conference, Liverpool, pp 127-133
P.E. Dunne, C.J. Gittings and P.H. Leng. Parallel Demand-driven methods for digital logic simulation, Proc. ISMM Int. Workshop on Parallel Computing, Trani, eds D Marinaro and G Mastronardi, Acta Press, 1991, pp 100-103
T.J.M. Bench-Capon, P.E. Dunne and P.H. Leng. Interacting with knowledge based systems through dialogue games. Proc. 11th Conf. on Expert Systems and their applications, Avignon, May 1991, pp 123-30
T.J.M. Bench-Capon, P.E. Dunne and G. Staniford. RAPPORTEUR: From Dialogue to Document. Proc. Computers and Writing IV, March 1991, pp 175-183,
J. Barlow and P.E. Dunne. Applying a model of concurrency to computer supported cooperative writing. Proc. Computers and Writing IV, March 1991, pp 184-189
P.E. Dunne, C.J. Gittings and P.H. Leng. Parallel demand-driven evaluation of logic networks. Proc. of 28th Annual Allerton Conference on Communication, Control and Computing, October 1990, pp 938-947.
T.J.M. Bench-Capon and P.E. Dunne. An approach to the integration of legal support systems. In: Database and Expert Systems Applications (Proc. of the International Conference in Vienna), Springer-Verlag, 1990, pp 105-111
J.Barlow, M.Beer, T.J.M. Bench-Capon, D. Diaper, P.E. Dunne and R. Rada. Expertext: Hypertext-Expert system theory, synergy and potential applications. In: Research and Development in Expert Systems VI (Ed. N. Shadbolt), Proc. of Expert Systems 89, Cambridge Univ. Press, 1989, pp 116-127.
P.E. Dunne. Lower bounds on the complexity of 1-time only branching programs. Proc. of 5th Conference on Fundamentals of Computation Theory, Cottbus GDR September 1985, (Editor: L. Budach), Springer-Verlag Lecture Notes in Computer Science, Vol 199, pp 90-99
(Note: scanned pdf of original paper)
P.E. Dunne. Lower bounds on the monotone network complexity of threshold functions. Proc. of the 22nd Allerton Conference on Communication, Control and Computing, October 1984, pp 911-920

Top of page

Papers in Submission/Preparation

M. Caminada and P. E. Dunne. Minimal Strong Admissibility: a Complexity Analysis. (venue to be decided)

P. E. Dunne. The Inverse Characteristic Function in Argument Frameworks: Properties and Complexity.
P. E. Dunne. The Role and Application of Spectral Techniques to Argumentation. (in preparation)

Top of page

Research Grants Summary

£ 155,598 EPSRC (GR/R60836/01) Algorithmics for Agent Design & Verification (January 2002-December 2004) (principal investigator) (in collaboration with Prof. M.J. Wooldridge).
£ 133,955 EPSRC (GR/L/77089); A General Phase-Structural Study of Computationally Hard Problems and Efficient Algorithmics, (from: 1/10/1997 to 30/9/2000) (principal investigator) (in collaboration with Prof. A. Gibbons)
£ 66,564 BBSRC/EPSRC Bioinformatics Programme (26/BIF10475). Jointly with Prof. Alan Gibbons and Univ. of Warwick. Generalised DNA Computation with viable resources. (from October 1998)
£ 10,000 (approx) British Council joint research grant with Univ. of Lund, Germany. Involved with series of collaborative research visits from October 1998 for three years.
£ 5,150 EPSRC/MathfIT (Contract: P003700); Contribution towards cost of Workshop on Phase Transition Phenomena in Combinatorial Problems (part of Mathfit/LMS Programme of Specialist Workshops) (25th-27th January 1999, Liverpool)
£ 4,935 (+22,799 zloty) from British Council/Komitet Badan Naukowych (British/Polish) Joint Research Collaboration Programme. Member of Liverpool group involved. (October 1998 for three years)
£ 3,000 British Council Alliance Programme. Involved in rolling programme of research visit exchanges between Bordeaux and Liverpool concerning `Combinatorics and Algorithms' (from May 1998)
£ 1,600 British Council Travel and expenses for lecture and research visit to five Japanese Universities (Hitotsubashi, Tokyo, Kyoto, Ryokoku, Sendai) (November 17th-26th, 1993)
£ 1,500 I.C.L. (March 1991) Towards covering running costs of 7th British Colloquium for Theoretical Computer Science, held at the University of Liverpool, March 26th-28th 1991
£ 1,500 I.B.M. U.K. (March 1991) Towards covering running costs of 7th British Colloquium for Theoretical Computer Science, held at the University of Liverpool, March 26th-28th 1991
£ 1,020 London Mathematical Society; Contribution towards costs of non-EPSRC research students attending workshop on Phase Transitions in Combinatorial Problems; (25th-27th January 1999, Liverpool)
London Mathematical Society; Costs of attending L.M.S. Symposium on Boolean Function Complexity (22nd July-1st August, 1990), Univ. of Durham, (organisers: Prof. M.S. Paterson, Prof. W.F. McColl, Prof. A. Yao)
British Council; Visit by Alexander Razborov (Steklov Institute, Russian Academy of Sciences, Moscow) to Univ. of Liverpool (July 1987) as part of U.K. visit organised by Prof. M.S. Paterson.
£ 124,000 equipment donation from Hewlett-Packard to assist in research into systems for supporting collaborative design of large digital systems (1990) (with: C.C. Charlton, D.Jackson, P.H. Leng and J. Little)

Top of page

Editorial Boards, Programme Committees etc.

Associate Editor, Artificial Intelligence Journal, January 2015-present
Editorial Board, Artificial Intelligence Journal, May 2013-December 2014
Editorial Board, Argument and Computation, 2010-
President, Steering Committee of International Conf. on Computational Models of Argument (May 2008-Sept. 2012)
Programme Committee - 3rd International Conf. on Computational Models of Argument (COMMA10)
Programme Committee - 2nd International Conf. on Computational Models of Argument (COMMA08)
Programme Chair - 1st International Conf. on Computational Models of Argument (COMMA'06)
AAMAS'06--AAMAS'10

Research Interests and Publications

Publications

Publications and Submitted Papers

Books & Theses

Book Contributions

Refereed Journals

Proceedings of Refereed Conferences

Papers in Submission/Preparation