Professor Paul Dunne B.Sc., Ph.D., D.Sc.
Professor Computer Science
- Work email P.E.Dunne@liverpool.ac.uk
- Personal Websitehttp://www.csc.liv.ac.uk/~ped/
- About
- Research
- Publications
- Teaching
- Professional Activities
Publications
Filter the publication list
Filter list by type
- Show all
- Journal article
- Conference paper
- Chapter
- Other
2023
Decidability in argumentation semantics (Journal article)
Dunne, P. E. (2023). Decidability in argumentation semantics. Argument & Computation, 1-14. doi:10.3233/aac-2200202022
Well, to Be Honest, I Wouldnt Start from Here at All (Conference Paper)
Dunne, P. E. (2022). Well, to Be Honest, I Wouldnt Start from Here at All. IOS Press. doi:10.3233/faia2201342021
Computing Grounded Extensions Of Abstract Argumentation Frameworks (Journal article)
Nofal, S., Atkinson, K., & Dunne, P. E. (2021). Computing Grounded Extensions Of Abstract Argumentation Frameworks. COMPUTER JOURNAL, 64(1), 54-63. doi:10.1093/comjnl/bxz1382020
Characterizing strongly admissible sets (Journal article)
Dunne, P. E. (2020). Characterizing strongly admissible sets. ARGUMENT & COMPUTATION, 11(3), 239-255. doi:10.3233/AAC-200483Minimal Strong Admissibility: A Complexity Analysis (Conference Paper)
Caminada, M., & Dunne, P. E. (2020). Minimal Strong Admissibility: A Complexity Analysis. In COMPUTATIONAL MODELS OF ARGUMENT (COMMA 2020) Vol. 326 (pp. 135-146). doi:10.3233/FAIA200499Delegating Decisions in Strategic Settings (Journal article)
Dunne, P. E., Harrenstein, P., Kraus, S., & Wooldridge, M. (2020). Delegating Decisions in Strategic Settings. IEEE Transactions on Artificial Intelligence, 1(1), 19-33. doi:10.1109/tai.2020.3031545Strong admissibility revisited: Theory and applications (Journal article)
Caminada, M., & Dunne, P. (2019). Strong admissibility revisited: Theory and applications. ARGUMENT & COMPUTATION, 10(3), 277-300. doi:10.3233/AAC-1904632019
On checking skeptical and ideal admissibility in abstract argumentation frameworks (Journal article)
Nofal, S., Atkinson, K., & Dunne, P. E. (2019). On checking skeptical and ideal admissibility in abstract argumentation frameworks. INFORMATION PROCESSING LETTERS, 148, 7-12. doi:10.1016/j.ipl.2019.03.013Computation counts - an Introduction to Analytic Concepts in Computer Science (Invited Book Introduction) (Other)
Dunne, P. E. (2019). Computation counts - an Introduction to Analytic Concepts in Computer Science (Invited Book Introduction). K. Iwama (Ed.), (Vol. 128, pp. 142-149). European Association for TCS. Retrieved from http://bulletin.eatcs.org/index.php/beatcs/indexComputation Counts - An Introduction to Analytic Concepts in Computer Science (Book)
Dunne, P. E. (2019). Computation Counts - An Introduction to Analytic Concepts in Computer Science (Vol. 23, Paperback ed.). United Kingdom: College Publications. Retrieved from https://www.collegepublications.co.uk/A New Labelling Algorithm for Generating Preferred Extensions of Abstract Argumentation Frameworks (Conference Paper)
Nofal, S., Atkinson, K., Dunne, P. E., & Hababeh, I. (2019). A New Labelling Algorithm for Generating Preferred Extensions of Abstract Argumentation Frameworks. In PROCEEDINGS OF THE 21ST INTERNATIONAL CONFERENCE ON ENTERPRISE INFORMATION SYSTEMS (ICEIS), VOL 1 (pp. 340-348). doi:10.5220/0007737503400348Computation Counts - An Introduction to Analytic Concepts in Computer Science (Journal article)
Spirakis, P., & Dunne, P. E. (2019). Computation Counts - An Introduction to Analytic Concepts in Computer Science. BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, (128), 141-149. Retrieved from https://www.webofscience.com/On Deciding Admissibility in Abstract Argumentation Frameworks (Conference Paper)
Nofal, S., Atkinson, K., & Dunne, P. E. (2019). On Deciding Admissibility in Abstract Argumentation Frameworks. In KEOD: PROCEEDINGS OF THE 11TH INTERNATIONAL JOINT CONFERENCE ON KNOWLEDGE DISCOVERY, KNOWLEDGE ENGINEERING AND KNOWLEDGE MANAGEMENT - VOL 2: KEOD (pp. 67-75). doi:10.5220/00080643006700752018
Automata for Infinite Argumentation Structures (Preprint)
Unconscious Patterns in Argument: Fractal Dimension in Oratory (Conference Paper)
Dunne, P. E. (2018). Unconscious Patterns in Argument: Fractal Dimension in Oratory. In COMPUTATIONAL MODELS OF ARGUMENT (COMMA 2018) Vol. 305 (pp. 301-312). doi:10.3233/978-1-61499-906-5-3012017
COMPUTATIONAL PROBLEMS IN FORMAL ARGUMENTATION AND THEIR COMPLEXITY (Journal article)
Dvorak, W., & Dunne, P. E. (2017). COMPUTATIONAL PROBLEMS IN FORMAL ARGUMENTATION AND THEIR COMPLEXITY. JOURNAL OF APPLIED LOGICS-IFCOLOG JOURNAL OF LOGICS AND THEIR APPLICATIONS, 4(8), 2557-2622. Retrieved from https://www.webofscience.com/2016
Looking-ahead in backtracking algorithms for abstract argumentation (Journal article)
Nofal, S., Atkinson, K. M., & Dunne, P. E. (2016). Looking-ahead in backtracking algorithms for abstract argumentation. International Journal of Approximate Reasoning, 78, 265-282. doi:10.1016/j.ijar.2016.07.013Investigating the Relationship between Argumentation Semantics via Signatures (Conference Paper)
Dunne, P. E., Linsbichler, T., Spanring, C., & Woltran, S. (2016). Investigating the Relationship between Argumentation Semantics via Signatures. In IJCAI'16: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (pp. 1051-1057). New York, USA. doi:10.5555/3060621.3060767A Synergy Coalition Group based Dynamic Programming Algorithm for Coalition Formation (Conference Paper)
Riley, L., Atkinson, K., Dunne, P., & Payne, T. (2016). A Synergy Coalition Group based Dynamic Programming Algorithm for Coalition Formation. In 2016 International Conference on Autonomous Agents & Multiagent Systems (pp. 588). Singapore.Forbidden Sets in Argumentation Semantics (Conference Paper)
Dunne, P. E. (2016). Forbidden Sets in Argumentation Semantics. In COMPUTATIONAL MODELS OF ARGUMENT Vol. 287 (pp. 275-286). doi:10.3233/978-1-61499-686-6-275I Heard You the First Time: Debate in Cacophonous Surroundings (Conference Paper)
Dunne, P. E. (2016). I Heard You the First Time: Debate in Cacophonous Surroundings. In COMPUTATIONAL MODELS OF ARGUMENT Vol. 287 (pp. 287-298). doi:10.3233/978-1-61499-686-6-287Investigating the Relationship between Argumentation Semantics via Signatures (Conference Paper)
Dunne, P. E., Linsbichler, T., Spanring, C., & Woltran, S. (2016). Investigating the Relationship between Argumentation Semantics via Signatures. In KI 2016: ADVANCES IN ARTIFICIAL INTELLIGENCE Vol. 9904 (pp. 271-277). Retrieved from https://www.webofscience.com/Spectral Techniques in Argumentation Framework Analysis (Conference Paper)
Butterworth, J., & Dunne, P. E. (2016). Spectral Techniques in Argumentation Framework Analysis. In COMPUTATIONAL MODELS OF ARGUMENT Vol. 287 (pp. 167-178). doi:10.3233/978-1-61499-686-6-1672015
Characteristics of multiple viewpoints in abstract argumentation (Journal article)
Dunne, P. E., Dvorak, W., Linsbichler, T., & Woltran, S. (2015). Characteristics of multiple viewpoints in abstract argumentation. ARTIFICIAL INTELLIGENCE, 228, 153-178. doi:10.1016/j.artint.2015.07.006Distributing Coalition Value Calculations to Coalition Members (Conference Paper)
Riley, L., Atkinson, K., Dunne, P., & Payne, T. (2015). Distributing Coalition Value Calculations to Coalition Members. In 29th AAAI Conference on Artificial Intelligence (AAAI-15) (pp. 2117). Austin, Texas.JUSTICE AND THE HOLOCAUST (Journal article)
Dunne, P. E. (2015). JUSTICE AND THE HOLOCAUST. SIGHT AND SOUND, 25(3), 111. Retrieved from https://www.webofscience.com/Senses of ‘argument’ in instantiated argumentation frameworks† (Journal article)
Wyner, A., Bench-Capon, T., Dunne, P., & Cerutti, F. (2015). Senses of ‘argument’ in instantiated argumentation frameworks†. Argument & Computation, 6(1), 50-72. doi:10.1080/19462166.2014.10025352014
Algorithms for argumentation semantics: labeling attacks as a generalization of labeling arguments (Journal article)
Nofal, S., Atkinson, K., & Dunne, P. E. (2014). Algorithms for argumentation semantics: labeling attacks as a generalization of labeling arguments. Journal of Artificial Intelligence Research, 49, 635-668. doi:10.1613/jair.4308Algorithms for decision problems in argument systems under preferred semantics (Journal article)
Nofal, S., Atkinson, K., & Dunne, P. E. (2014). Algorithms for decision problems in argument systems under preferred semantics. Artificial Intelligence, 207, 22-51.Algorithms for decision problems in argument systems under preferred semantics (Journal article)
Nofal, S., Atkinson, K., & Dunne, P. E. (2014). Algorithms for decision problems in argument systems under preferred semantics. ARTIFICIAL INTELLIGENCE, 207, 23-51. doi:10.1016/j.artint.2013.11.001Characteristics of Multiple Viewpoints in Abstract Argumentation (Conference Paper)
Dunne, P. E., Dvorak, W., Linsbichler, T., & Woltran, S. (2014). Characteristics of Multiple Viewpoints in Abstract Argumentation. In FOURTEENTH INTERNATIONAL CONFERENCE ON THE PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING (pp. 72-81). Retrieved from https://www.webofscience.com/Complexity Properties of Critical Sets of Arguments (Conference Paper)
Booth, R., Caminada, M., Dunne, P. E., Podlaszewski, M., & Rahwan, I. (2014). Complexity Properties of Critical Sets of Arguments. In COMPUTATIONAL MODELS OF ARGUMENT Vol. 266 (pp. 173-184). doi:10.3233/978-1-61499-436-7-173Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach (Conference Paper)
Cerutti, F., Dunne, P. E., Giacomin, M., & Vallati, M. (2014). Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach. In Unknown Conference (pp. 176-193). Springer Berlin Heidelberg. doi:10.1007/978-3-642-54373-9_12Properties of Random VAFs and Implications for Efficient Algorithms (Conference Paper)
Dunne, P. E., & Atkinson, K. (2014). Properties of Random VAFs and Implications for Efficient Algorithms. In COMPUTATIONAL MODELS OF ARGUMENT Vol. 266 (pp. 261-268). doi:10.3233/978-1-61499-436-7-261Properties of random VAFs and implications for efficient algorithms (Conference Paper)
Atkinson, K., & Dunne, P. E. (2014). Properties of random VAFs and implications for efficient algorithms. In Fifth International Conference on Computational Models of Argument (COMMA 2014) (pp. In press). Amsterdam: IOS Press.2013
On the Instantiation of Knowledge Bases in Abstract Argumentation Frameworks (Conference Paper)
Wyner, A., Bench-Capon, T., & Dunne, P. (2013). On the Instantiation of Knowledge Bases in Abstract Argumentation Frameworks. In COMPUTATIONAL LOGIC IN MULTI-AGENT SYSTEMS, CLIMA XIV Vol. 8143 (pp. 34-50). Retrieved from https://www.webofscience.com/Computing Preferred Extensions in Abstract Argumentation: a SAT-based Approach (Preprint)
Parametric properties of ideal semantics (Journal article)
Dunne, P. E., Dvorak, W., & Woltran, S. (2013). Parametric properties of ideal semantics. ARTIFICIAL INTELLIGENCE, 202, 1-28. doi:10.1016/j.artint.2013.06.004Algorithms for acceptance in argument systems (Conference Paper)
Nofal, S., Dunne, P., & Atkinson, K. (2013). Algorithms for acceptance in argument systems. In ICAART 2013 - Proceedings of the 5th International Conference on Agents and Artificial Intelligence Vol. 2 (pp. 34-43).A SAT-based Approach for Computing Extensions in Abstract Argumentation (Conference Paper)
Cerutti, F., Dunne, P. E., Giacomin, M., & Vallati, M. (2013). A SAT-based Approach for Computing Extensions in Abstract Argumentation. In TAFA. -: Springer.Automata for infinite argumentation structures (Journal article)
Baroni, P., Cerutti, F., Dunne, P. E., & Giacomin, M. (2013). Automata for infinite argumentation structures. ARTIFICIAL INTELLIGENCE, 203, 104-150. doi:10.1016/j.artint.2013.05.0022012
Semi-stable semantics (Journal article)
Caminada, M. W. A., Carnielli, W. A., & Dunne, P. E. (2012). Semi-stable semantics. JOURNAL OF LOGIC AND COMPUTATION, 22(5), 1207-1254. doi:10.1093/logcom/exr033Towards average-case algorithms for abstract argumentation (Conference Paper)
Nofal, S., Dunne, P., & Atkinson, K. (2012). Towards average-case algorithms for abstract argumentation. In ICAART 2012 - Proceedings of the 4th International Conference on Agents and Artificial Intelligence Vol. 1 (pp. 225-230).Irrationality in Persuasive Argumentation (Chapter)
Dunne, P. E. (2012). Irrationality in Persuasive Argumentation. In Logic Programs, Norms and Action (pp. 234-248). Springer Berlin Heidelberg. doi:10.1007/978-3-642-29414-3_13Computing with Infinite Argumentation Frameworks: The Case of AFRAs (Conference Paper)
Baroni, P., Cerutti, F., Dunne, P. E., & Giacomin, M. (2012). Computing with Infinite Argumentation Frameworks: The Case of AFRAs. In Unknown Conference (pp. 197-214). Springer Berlin Heidelberg. doi:10.1007/978-3-642-29184-5_13Argument aggregation: Basic axioms and complexity results (Conference Paper)
Dunne, P. E., Marquis, P., & Wooldridge, M. (2012). Argument aggregation: Basic axioms and complexity results. In Frontiers in Artificial Intelligence and Applications Vol. 245 (pp. 129-140). doi:10.3233/978-1-61499-111-3-129On preferred extension enumeration in abstract argumentation (Conference Paper)
Nofal, S., Dunne, P., & Atkinson, K. (2012). On preferred extension enumeration in abstract argumentation. In Frontiers in Artificial Intelligence and Applications Vol. 245 (pp. 205-216). doi:10.3233/978-1-61499-111-3-205Towards experimental algorithms for abstract argumentation (Conference Paper)
Nofal, S., Dunne, P., & Atkinson, K. (2012). Towards experimental algorithms for abstract argumentation. In Frontiers in Artificial Intelligence and Applications Vol. 245 (pp. 217-228). doi:10.3233/978-1-61499-111-3-217Towards tractable Boolean Games (Conference Paper)
Dunne, P. E., & Wooldridge, M. (2012). Towards tractable Boolean Games. In 11th International Conference on Autonomous Agents and Multiagent Systems 2012, AAMAS 2012: Innovative Applications Track Vol. 2 (pp. 1040-1047).Towards tractable Boolean games (Conference Paper)
Dunne, P. E., & Wooldridge, M. (2012). Towards tractable Boolean games. In Eleventh International Conference on Autonomous Agents and Multiagent Systems (pp. 939-946). Valencia: -.Uniform Argumentation Frameworks (Conference Paper)
Atkinson, K., Bench-Capon, T., & Dunne, P. E. (2012). Uniform Argumentation Frameworks. In Computational Models of Argument Vol. 245 (pp. 165-176). doi:10.3233/978-1-61499-111-3-1652011
Parametric properties of ideal semantics (Conference Paper)
Dvořák, W., Dunne, P. E., & Woltran, S. (2011). Parametric properties of ideal semantics. In IJCAI International Joint Conference on Artificial Intelligence (pp. 851-856). doi:10.5591/978-1-57735-516-8/IJCAI11-148Relating the semantics of abstract dialectical frameworks and standard AFs (Conference Paper)
Brewka, G., Dunne, P. E., & Woltran, S. (2011). Relating the semantics of abstract dialectical frameworks and standard AFs. In IJCAI International Joint Conference on Artificial Intelligence (pp. 780-785). doi:10.5591/978-1-57735-516-8/IJCAI11-137On Constructing Minimal Formulae (Journal article)
Dunne, P. E. (2011). On Constructing Minimal Formulae. COMPUTER JOURNAL, 54(7), 1067-1075. doi:10.1093/comjnl/bxq050On the resolution-based family of abstract argumentation semantics and its grounded instance (Journal article)
Baroni, P., Dunne, P. E., & Giacomin, M. (2011). On the resolution-based family of abstract argumentation semantics and its grounded instance. ARTIFICIAL INTELLIGENCE, 175(3-4), 791-813. doi:10.1016/j.artint.2010.11.005Weighted argument systems: Basic definitions, algorithms, and complexity results (Journal article)
Dunne, P. E., Hunter, A., McBurney, P., Parsons, S., & Wooldridge, M. (2011). Weighted argument systems: Basic definitions, algorithms, and complexity results. ARTIFICIAL INTELLIGENCE, 175(2), 457-486. doi:10.1016/j.artint.2010.09.0052010
Emotions in Rational Decision Making (Conference Paper)
Nawwab, F. S., Bench-Capon, T., & Dunne, P. E. (2010). Emotions in Rational Decision Making. In ARGUMENTATION IN MULTI-AGENT SYSTEMS Vol. 6057 (pp. 273-291). Retrieved from https://www.webofscience.com/Computation in Extended Argumentation Frameworks (Conference Paper)
Dunne, P. E., Modgil, S., & Bench-Capon, T. (2010). Computation in Extended Argumentation Frameworks. In ECAI 2010 - 19TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE Vol. 215 (pp. 119-124). doi:10.3233/978-1-60750-606-5-119Computation with varied-strength attacks in abstract argumentation frameworks (Conference Paper)
Dunne, P. E., Martínez, D. C., García, A. J., & Simari, G. R. (2010). Computation with varied-strength attacks in abstract argumentation frameworks. In Frontiers in Artificial Intelligence and Applications Vol. 216 (pp. 207-218). doi:10.3233/978-1-60750-619-5-207Exploring the Role of Emotions in Rational Decision Making (Conference Paper)
Nawwab, F. S., Dunne, P. E., & Bench-Capon, T. (2010). Exploring the Role of Emotions in Rational Decision Making. In COMPUTATIONAL MODELS OF ARGUMENT: PROCEEDINGS OF COMMA 2010 Vol. 216 (pp. 367-378). doi:10.3233/978-1-60750-619-5-367Formal properties of argumentation and negotiation frameworks (Thesis / Dissertation)
Dunne, P. E. (2010). Formal properties of argumentation and negotiation frameworks. (PhD Thesis, Edinburgh University).On extension counting problems in argumentation frameworks (Conference Paper)
Baroni, P., Dunne, P. E., & Giacomin, M. (2010). On extension counting problems in argumentation frameworks. In Frontiers in Artificial Intelligence and Applications Vol. 216 (pp. 63-74). doi:10.3233/978-1-60750-619-5-63Solving coalitional resource games (Journal article)
Dunne, P. E., Kraus, S., Manisterski, E., & Wooldridge, M. (2010). Solving coalitional resource games. ARTIFICIAL INTELLIGENCE, 174(1), 20-50. doi:10.1016/j.artint.2009.09.005Tractability in value-based argumentation (Conference Paper)
Dunne, P. E. (2010). Tractability in value-based argumentation. In Frontiers in Artificial Intelligence and Applications Vol. 216 (pp. 195-206). doi:10.3233/978-1-60750-619-5-1952009
Complexity of Abstract Argumentation (Chapter)
Dunne, P. E., & Wooldridge, M. (2009). Complexity of Abstract Argumentation. In ARGUMENTATION IN ARTIFICIAL INTELLIGENCE (pp. 85-104). doi:10.1007/978-0-387-98197-0_5Instantiating knowledge bases in abstract argumentation frameworks (Conference Paper)
Wyner, A., Bench-Capon, T., & Dunne, P. (2009). Instantiating knowledge bases in abstract argumentation frameworks. In AAAI Fall Symposium - Technical Report Vol. FS-09-06 (pp. 76-83).The computational complexity of ideal semantics (Journal article)
Dunne, P. E. (2009). The computational complexity of ideal semantics. ARTIFICIAL INTELLIGENCE, 173(18), 1559-1591. doi:10.1016/j.artint.2009.09.001Computational properties of resolution-based grounded semantics (Conference Paper)
Baroni, P., Dunne, P. E., & Giacomin, M. (2009). Computational properties of resolution-based grounded semantics. In IJCAI International Joint Conference on Artificial Intelligence (pp. 683-689).Inconsistency tolerance in weighted argument systems (Conference Paper)
Dunne, P. E., Hunter, A., McBurney, P., Parsons, S., & Wooldridge, M. (2009). Inconsistency tolerance in weighted argument systems. In AAMAS09 (pp. 851-858). Budapest: IFAAMAS.Inconsistency tolerance in weighted argument systems (Conference Paper)
Dunne, P. E., Parsons, S., Hunter, A., McBurney, P., & Wooldridge, M. (2009). Inconsistency tolerance in weighted argument systems. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS Vol. 1 (pp. 616-623).2008
Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks (Conference Paper)
Dunne, P. E., & Caminada, M. (n.d.). Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks. In Unknown Conference (pp. 153-165). Springer Berlin Heidelberg. doi:10.1007/978-3-540-87803-2_14The complexity of deciding reachability properties of distributed negotiation schemes (Journal article)
Dunne, P. E., & Chevaleyre, Y. (2008). The complexity of deciding reachability properties of distributed negotiation schemes. THEORETICAL COMPUTER SCIENCE, 396(1-3), 113-144. doi:10.1016/j.tcs.2008.01.031A Methodology for Action-Selection using Value-Based Argumentation (Conference Paper)
Nawwab, F. S., Bench-Capon, T., & Dunne, P. E. (2008). A Methodology for Action-Selection using Value-Based Argumentation. In COMPUTATIONAL MODELS OF ARGUMENT, PROCEEDINGS OF COMMA 2008 Vol. 172 (pp. 264-275). Retrieved from https://www.webofscience.com/Asking the Right Question: Forcing Commitment in Examination Dialogues (Conference Paper)
Bench-Capon, T. J. M., Doutre, S., & Dunne, P. E. (2008). Asking the Right Question: Forcing Commitment in Examination Dialogues. In COMPUTATIONAL MODELS OF ARGUMENT, PROCEEDINGS OF COMMA 2008 Vol. 172 (pp. 49-+). Retrieved from https://www.webofscience.com/Cooperative Boolean Games (Conference Paper)
Dunne, P. E., Kraus, S., van der Hoek, W., & Wooldridge, M. (2008). Cooperative Boolean Games. In 7th Int. Conf. on Autonomous Agents and Multiagent Systems (pp. 1015-1022). Estoril: IFAAMAS.Cooperative boolean games (Conference Paper)
Dunne, P. E., Van Der Hoek, W., Kraus, S., & Wooldridge, M. (2008). Cooperative boolean hames. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS Vol. 2 (pp. 997-1004).The computational complexity of ideal semantics I: Abstract argumentation frameworks (Conference Paper)
Dunne, P. E. (2008). The computational complexity of ideal semantics I: Abstract argumentation frameworks. In Frontiers in Artificial Intelligence and Applications Vol. 172 (pp. 147-158).2007
A logical characterisation of qualitative coalitional games (Journal article)
Dunne, P. E., van der Hoek, W., & Wooldridge, M. (2007). A logical characterisation of qualitative coalitional games. Journal of Applied Non-Classical Logics, 17(4), 477-509. doi:10.3166/jancl.17.477-509Logic for automated mechanism design - A progress report (Conference Paper)
Wooldridge, M., Agotnes, T., Dunne, P. E., & Van Der Hoek, W. (2007). Logic for automated mechanism design - A progress report. In Proceedings of the National Conference on Artificial Intelligence Vol. 1 (pp. 9-17).Argumentation in artificial intelligence (Journal article)
Bench-Capon, T. J. M., & Dunne, P. E. (2007). Argumentation in artificial intelligence. ARTIFICIAL INTELLIGENCE, 171(10-15), 619-641. doi:10.1016/j.artint.2007.05.001Computational properties of argument systems satisfying graph-theoretic constraints (Journal article)
Dunne, P. E. (2007). Computational properties of argument systems satisfying graph-theoretic constraints. ARTIFICIAL INTELLIGENCE, 171(10-15), 701-729. doi:10.1016/j.artint.2007.03.006Artificial Inteligence (Edited special journal issue)
Dunne, P. E., & Bench-Capon, T. (Eds.) (2007). Artificial Inteligence (Vol. 171). Elsevier.Audiences in argumentation frameworks (Journal article)
Bench-Capon, T. J. M., Doutre, S., & Dunne, P. E. (2007). Audiences in argumentation frameworks. ARTIFICIAL INTELLIGENCE, 171(1), 42-71. doi:10.1016/j.artint.2006.10.013Logic for Automated Mechanism Design - A Progress Report (Conference Paper)
Wooldridge, M., Agotnes, T., Dunne, P. E., & van der Hoek, W. (2007). Logic for Automated Mechanism Design - A Progress Report. In Proceedings of the 22nd AAAI Conference on Artificial Intelligence, AAAI 2007 (pp. 9-16).2006
On the complexity of linking deductive and abstract argument systems (Conference Paper)
Wooldridge, M., Dunne, P. E., & Parsons, S. (2006). On the complexity of linking deductive and abstract argument systems. In Proceedings of the National Conference on Artificial Intelligence Vol. 1 (pp. 299-304).On the computational complexity of coalitional resource games (Journal article)
Wooldridge, M., & Dunne, P. E. (2006). On the computational complexity of coalitional resource games. ARTIFICIAL INTELLIGENCE, 170(10), 835-871. doi:10.1016/j.artint.2006.03.003Complexity Properties of Restricted Abstract Argument Systems (Conference Paper)
Dunne, P. E. (2006). Complexity Properties of Restricted Abstract Argument Systems. In Frontiers in Artificial Intelligence and Applications Vol. 144 (pp. 85-96).Computational Models of Argument (Conference Paper)
Bench-Capon, T. J. M., & Dunne, P. E. (Eds.) (2006). Computational Models of Argument. In COMMA 06 (pp. 341). Amsterdam: IOS Press.Issues in Multiagent Resource Allocation (Journal article)
Chevaleyre, Y., Dunne, P. E., Endriss, U., Lang, J., Lemaître, M., Maudet, N., . . . Sousa, P. (2006). Issues in Multiagent Resource Allocation. Informatica (Ljubljana), 30(1), 3-31.On the complexity of linking deductive and abstract argument systems (Conference Paper)
Wooldridge, M., Dunne, P. E., & Parsons, S. (2006). On the complexity of linking deductive and abstract argument systems. In AAAI-06 (pp. in press). Boston: AAAI Press.Preface (Chapter)
Dunne, P. E., Bench-Capon, T., & Wooldridge, M. (2006). Preface. In Unknown Book (Vol. 144, pp. v).Suspicion of Hidden Agenda in Persuasive Argument (Conference Paper)
Dunne, P. E. (2006). Suspicion of Hidden Agenda in Persuasive Argument. In Frontiers in Artificial Intelligence and Applications Vol. 144 (pp. 329-340).2005
Determining preferences through argumentation (Conference Paper)
Doutre, S., Bench-Capon, T. R., & Dunne, P. E. (2005). Determining preferences through argumentation. In AI*IA2005: ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS Vol. 3673 (pp. 98-109). Retrieved from https://www.webofscience.com/Discovering Inconsistency through Examination Dialogues (Conference Paper)
Dunne, P. E., Doutre, S., & Bench-Capon, T. (2005). Discovering Inconsistency through Examination Dialogues. In 19TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-05) (pp. 1680-1681). Retrieved from https://www.webofscience.com/Explaining preferences with argument positions (Conference Paper)
Doutre, S., Bench-Capon, T., & Dunne, P. E. (2005). Explaining preferences with argument positions. In 19TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-05) (pp. 1560-1561). Retrieved from https://www.webofscience.com/Multiagent Resource Allocation in the Presence of Externalities (Conference Paper)
Dunne, P. E. (2005). Multiagent Resource Allocation in the Presence of Externalities. In Unknown Conference (pp. 408-417). Springer Berlin Heidelberg. doi:10.1007/11559221_41The complexity of agent design problems: Determinism and history dependence (Journal article)
Wooldridge, M., & Dunne, P. E. (2005). The complexity of agent design problems: Determinism and history dependence. ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 45(3-4), 343-371. doi:10.1007/s10472-005-9003-0The complexity of contract negotiation (Journal article)
Dunne, P. E., Wooldridge, M., & Laurence, M. (2005). The complexity of contract negotiation. ARTIFICIAL INTELLIGENCE, 164(1-2), 23-46. doi:10.1016/j.artint.2005.01.006A Value-based Argument Model of Convention Degradation (Journal article)
Dunne, P. E. (2005). A Value-based Argument Model of Convention Degradation. Artificial Intelligence and Law, 13(1), 153-188. doi:10.1007/s10506-006-9006-0Argumentation in AI and Law: Editors' Introduction (Journal article)
Bench-Capon, T. J. M., & Dunne, P. E. (2005). Argumentation in AI and Law: Editors' Introduction. Artificial Intelligence and Law, 13(1), 1-8. doi:10.1007/s10506-006-9007-zA value-based argument model of convention degradation (Chapter)
Dunne, P. E. (2005). A value-based argument model of convention degradation. In P. E. Dunne, & T. J. M. Bench-Capon (Eds.), Argumentation in Artificial Intelligence and Law (pp. 39-51). Tilburg: Wolf Legal Publishers.Argumentation in AI and Law (Book)
Dunne, P. E., & Bench-Capon, T. J. M. (Eds.) (2005). Argumentation in AI and Law. Nijmegan: Woolf Publishing.Extremal behaviour in multiagent contract negotiation (Journal article)
Dunne, P. E. (2005). Extremal behaviour in multiagent contract negotiation. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 23, 41-78. doi:10.1613/jair.1526Multi-Issue Negotiation with Deadlines (Journal article)
Fatima, S. S., Wooldridge, M. J., & Jennings, N. R. (n.d.). Multi-Issue Negotiation with Deadlines. Journal of Artificial Intelligence Research, 27, 381-417. doi:10.1613/jair.2056Multiagent resource allocation (Journal article)
Chevaleyre, Y., Dunne, P. E., Endriss, U., Lang, J., Maudet, N., & Rodríguez-Aguilar, J. A. (2005). Multiagent resource allocation. KNOWLEDGE ENGINEERING REVIEW, 20(2), 143-149. doi:10.1017/S02698889050004702004
On the computational complexity of qualitative coalitional games (Journal article)
Wooldridge, M., & Dunne, P. E. (2004). On the computational complexity of qualitative coalitional games. ARTIFICIAL INTELLIGENCE, 158(1), 27-73. doi:10.1016/j.artint.2004.04.002Complexity in value-based argument systems (Conference Paper)
Dunne, P. E., & Bench-Capon, T. (2004). Complexity in value-based argument systems. In LOGICS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS Vol. 3229 (pp. 360-371). doi:10.1007/978-3-540-30227-8_31Complexity results for agent design problems (Journal article)
Dunne, P. E., Laurence, M. R., & Wooldridge, M. J. (2004). Complexity results for agent design problems. Annals of Mathematics, Computing, and Teleinformatics, 1, 19-36.Concepts of Optimal Utterance in Dialogue: Selection and Complexity (Conference Paper)
Dunne, P. E., & McBurney, P. (2004). Concepts of Optimal Utterance in Dialogue: Selection and Complexity. In Unknown Conference (pp. 310-328). Springer Berlin Heidelberg. doi:10.1007/978-3-540-24608-4_18Context dependence in multi agent resource allocation (Conference Paper)
Dunne, P. E. (2004). Context dependence in multi agent resource allocation. In Frontiers in Artificial Intelligence and Applications Vol. 110 (pp. 1001-1002).Identifying audience preferences in legal and social domains (Conference Paper)
Dunne, P. E., & Bench-Capon, T. (2004). Identifying audience preferences in legal and social domains. In DATABASE AND EXPERT SYSTEMS APPLICATIONS, PROCEEDINGS Vol. 3180 (pp. 518-527). Retrieved from https://www.webofscience.com/Representation and Complexity in Boolean Games (Conference Paper)
Dunne, P. E., & van der Hoek, W. (2004). Representation and Complexity in Boolean Games. In Unknown Conference (pp. 347-359). Springer Berlin Heidelberg. doi:10.1007/978-3-540-30227-8_30Tractability results for automatic contracting (Conference Paper)
Dunne, P. E., Laurence, M., & Wooldridge, M. (2004). Tractability results for automatic contracting. In Frontiers in Artificial Intelligence and Applications Vol. 110 (pp. 1003-1004).2003
Prevarication in dispute protocols (Conference Paper)
Dunne, P. E. (2003). Prevarication in dispute protocols. In Proceedings of the 9th international conference on Artificial intelligence and law - ICAIL '03. ACM Press. doi:10.1145/1047788.1047791Two party immediate response disputes: Properties and efficiency (Journal article)
Dunne, P. E., & Bench-Capon, T. J. M. (2003). Two party immediate response disputes: Properties and efficiency. ARTIFICIAL INTELLIGENCE, 149(2), 221-250. doi:10.1016/S0004-3702(03)00076-6Optimal utterances in dialogue protocols (Conference Paper)
Dunne, P. E., & McBurney, P. (2003). Optimal utterances in dialogue protocols. In Proceedings of the second international joint conference on Autonomous agents and multiagent systems. ACM. doi:10.1145/860575.860673Optimal utterances in dialogue protocols (Conference Paper)
Dunne, P. E., & McBurney, P. (2003). Optimal utterances in dialogue protocols. In Proceedings of the second international joint conference on Autonomous agents and multiagent systems - AAMAS '03. ACM Press. doi:10.1145/860672.8606732002
Coherence in finite argument systems (Journal article)
Dunne, P. E., & Bench-Capon, T. J. M. (2002). Coherence in finite argument systems. ARTIFICIAL INTELLIGENCE, 141(1-2), 187-203. doi:10.1016/S0004-3702(02)00261-8Demand-driven logic simulation using a network of loosely coupled processors (Journal article)
Dunne, P. E., Leng, P. H., & Nwana, G. F. (2002). Demand-driven logic simulation using a network of loosely coupled processors. JOURNAL OF SYSTEMS ARCHITECTURE, 47(14-15), 1117-1128. doi:10.1016/S1383-7621(02)00062-0No agent is an island (Conference Paper)
Bench-Capon, T. J. M., & Dunne, P. E. (2002). No agent is an island. In Proceedings of the first international joint conference on Autonomous agents and multiagent systems part 2 - AAMAS '02. ACM Press. doi:10.1145/544862.544907No agent is an island: A framework for the study of inter-agent behavior (Conference Paper)
Bench-Capon, T. J. M., & Dunne, P. E. (2002). No agent is an island: A framework for the study of inter-agent behavior. In Proceedings of the International Conference on Autonomous Agents (pp. 690-691).The Computational Complexity of Agent Verification (Conference Paper)
Wooldridge, M., & Dunne, P. E. (2002). The Computational Complexity of Agent Verification. In Unknown Conference (pp. 115-127). Springer Berlin Heidelberg. doi:10.1007/3-540-45448-9_9The computational complexity of boolean and stochastic agent design problems (Conference Paper)
Dunne, P. E., Wooldridge, M., & Laurence, M. (2002). The computational complexity of boolean and stochastic agent design problems. In Proceedings of the first international joint conference on Autonomous agents and multiagent systems part 2 - AAMAS '02. ACM Press. doi:10.1145/544964.544968The computational complexity of boolean and stochastic agent design problems (Conference Paper)
Dunne, P. E., Wooldridge, M., & Laurence, M. (2002). The computational complexity of boolean and stochastic agent design problems. In Proceedings of the first international joint conference on Autonomous agents and multiagent systems part 2 - AAMAS '02. ACM Press. doi:10.1145/544862.5449682001
Leafy spanning trees in hypercubes (Journal article)
Duckworth, W., Dunne, P. E., Gibbons, A. M., & Zito, M. (2001). Leafy spanning trees in hypercubes. APPLIED MATHEMATICS LETTERS, 14(7), 801-804. doi:10.1016/S0893-9659(01)00047-7A sharp threshold for the phase transition of a restricted Satisfiability problem for Horn clauses (Journal article)
Dunne, P. E., & Bench-Capon, T. J. M. (2001). A sharp threshold for the phase transition of a restricted Satisfiability problem for Horn clauses. JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING, 47(1), 1-14. doi:10.1016/S1567-8326(00)00002-3Optimistic and Disjunctive Agent Design Problems (Conference Paper)
Wooldridge, M., & Dunne, P. E. (2001). Optimistic and Disjunctive Agent Design Problems. In Unknown Conference (pp. 1-14). Springer Berlin Heidelberg. doi:10.1007/3-540-44631-1_12000
J. UCS special issue on BCTCS (Journal article)
Dunne, P. E., & Gibbons, A. (2000). J. UCS special issue on BCTCS. Journal of Universal Computer Science, 6(4), 405-406.Complexity-theoretic models of phase transitions in search problems (Journal article)
Dunne, P. E., Gibbons, A., & Zito, M. (2000). Complexity-theoretic models of phase transitions in search problems. THEORETICAL COMPUTER SCIENCE, 249(2), 243-263. doi:10.1016/S0304-3975(00)00061-X1999
The average case performance of an algorithm for demand-driven evaluation of boolean formulae (Journal article)
Dunne, P. E., & Leng, P. H. (1999). The average case performance of an algorithm for demand-driven evaluation of boolean formulae. Journal of Universal Computer Science, 5(5).Algorithms and complexity issues concerning phase-transition phenomena in combinatorial problems (Conference Paper)
Dunne, P., Gibbons, A., & Zito, M. (1999). Algorithms and complexity issues concerning phase-transition phenomena in combinatorial problems. In R. Raman, & J. Simpson (Eds.), Unknown Conference (pp. 76-90).1998
An improved upper bound on the non-3-colourability threshold (Journal article)
Dunne, P. E., & Zito, M. (1998). An improved upper bound on the non-3-colourability threshold. INFORMATION PROCESSING LETTERS, 65(1), 17-23. doi:10.1016/S0020-0190(97)00193-2Toward feasible and efficient DNA computation (Journal article)
Amos, M., Gibbons, A., & Dunne, P. E. (1998). Toward feasible and efficient DNA computation. Complexity, 4(1), 20-24. doi:3.0.co;2-h">10.1002/(sici)1099-0526(199809/10)4:1<20::aid-cplx7>3.0.co;2-hDOI: 10.1002/(sici)1099-0526(199809/10)4:1<20::aid-cplx7>3.0.co;2-h