Prof Paul Dunne B.Sc., Ph.D., D.Sc.

Professor Computer Science

Publications

2020

Characterizing strongly admissible sets (Journal article)

Dunne, P. E. (2020). Characterizing strongly admissible sets. Argument & Computation, 1-17. doi:10.3233/aac-200483

DOI: 10.3233/aac-200483

Strong admissibility revisited: Theory and applications (Journal article)

Caminada, M., & Dunne, P. (2020). Strong admissibility revisited: Theory and applications. Argument & Computation, 10(3), 277-300. doi:10.3233/aac-190463

DOI: 10.3233/aac-190463

2019

Computing Grounded Extensions Of Abstract Argumentation Frameworks (Journal article)

Nofal, S., Atkinson, K., & Dunne, P. E. (n.d.). Computing Grounded Extensions Of Abstract Argumentation Frameworks. The Computer Journal. doi:10.1093/comjnl/bxz138

DOI: 10.1093/comjnl/bxz138

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.013

DOI: 10.1016/j.ipl.2019.03.013

Computation 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/index

Computation 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 ICEIS 2019 - Proceedings of the 21st International Conference on Enterprise Information Systems Vol. 1 (pp. 328-336).

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 IC3K 2019 - Proceedings of the 11th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management Vol. 2 (pp. 67-75).

2018

Unconscious patterns in argument: Fractal dimension in oratory (Conference Paper)

Dunne, P. E. (2018). Unconscious patterns in argument: Fractal dimension in oratory. In Frontiers in Artificial Intelligence and Applications Vol. 305 (pp. 301-312). doi:10.3233/978-1-61499-906-5-301

DOI: 10.3233/978-1-61499-906-5-301

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.013

DOI: 10.1016/j.ijar.2016.07.013

Investigating 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 25th IJCAI (pp. 1051-1057). New York, USA.

A 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-275

DOI: 10.3233/978-1-61499-686-6-275

I 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-287

DOI: 10.3233/978-1-61499-686-6-287

Investigating 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 http://gateway.webofknowledge.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-167

DOI: 10.3233/978-1-61499-686-6-167

2015

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.006

DOI: 10.1016/j.artint.2015.07.006

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.1002535

DOI: 10.1080/19462166.2014.1002535

Distributing 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.

2014

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.4308

DOI: 10.1613/jair.4308

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, 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.001

DOI: 10.1016/j.artint.2013.11.001

Characteristics of multiple viewpoints in abstract argumentation (Conference Paper)

Dunne, P. E., Dvořák, W., Linsbichler, T., & Woltran, S. (2014). Characteristics of multiple viewpoints in abstract argumentation. In Proc. Int. Workshop Tempor. Represent. Reason. (pp. 72-81).

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-173

DOI: 10.3233/978-1-61499-436-7-173

Computing 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_12

DOI: 10.1007/978-3-642-54373-9_12

Properties 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-261

DOI: 10.3233/978-1-61499-436-7-261

Properties 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

Algorithms 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.002

DOI: 10.1016/j.artint.2013.05.002

Parametric properties of ideal semantics (Journal article)

Dunne, P. E., Dvořák, W., & Woltran, S. (2013). Parametric properties of ideal semantics. Artificial Intelligence, 202, 1-28. doi:10.1016/j.artint.2013.06.004

DOI: 10.1016/j.artint.2013.06.004

2012

Towards 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).

'Argument aggregation: Basic axioms and complexity results' (Conference Paper)

Dunne, P. E., Marquis, P., & Wooldridge, M. (2012). 'Argument aggregation: Basic axioms and complexity results'. In S. Szeider, B. Verheij, & S. Woltran (Eds.), COMMA (pp. 129-140). Vienna: IOS Press.

Computing 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 TAFA 2011 Vol. 7132 (pp. 197-213). Barcelona: Springer.

Irrationality in Persuasive Argumentation (Chapter)

Dunne, P. E. (2012). Irrationality in Persuasive Argumentation. In A. Artikis, R. Craven, N. K. Cicekli, B. Sadighi, & K. Stathis (Eds.), Logic Programs, Norms and Action (pp. 234-248). Berlin: Springer.

On 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-205

DOI: 10.3233/978-1-61499-111-3-205

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/exr033

DOI: 10.1093/logcom/exr033

Towards 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-217

DOI: 10.3233/978-1-61499-111-3-217

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 Frontiers in Artificial Intelligence and Applications Vol. 245 (pp. 165-176). doi:10.3233/978-1-61499-111-3-165

DOI: 10.3233/978-1-61499-111-3-165

2011

On Constructing Minimal Formulae (Journal article)

Dunne, P. E. (2011). On Constructing Minimal Formulae. The Computer Journal, 54(7), 1067-1075. doi:10.1093/comjnl/bxq050

DOI: 10.1093/comjnl/bxq050

On 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.005

DOI: 10.1016/j.artint.2010.11.005

Parametric properties of ideal semantics (Conference Paper)

Dvorak, W., Dunne, P. E., & Woltran, S. (2011). Parametric properties of ideal semantics. In IJCAI-2011 (pp. 851-856). Barcelona: AAAI Press/IJCAI.

Relating 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-2011 (pp. 780-785). Barcelona: AAAI Press/IJCAI.

Weighted 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.005

DOI: 10.1016/j.artint.2010.09.005

2010

Computation in extended argumentation frameworks (Conference Paper)

Dunne, P. E., Modgil, S., & Bench-Capon, T. (2010). Computation in extended argumentation frameworks. In Frontiers in Artificial Intelligence and Applications Vol. 215 (pp. 119-124). doi:10.3233/978-1-60750-606-5-119

DOI: 10.3233/978-1-60750-606-5-119

Computation with varied-strength attacks in abstract argumentation frameworks (Conference Paper)

Dunne, P. E., Martinez, D. C., Garcia, A. J., & Simari, G. R. (2010). Computation with varied-strength attacks in abstract argumentation frameworks. In P. Baroni, F. Cerutti, M. Giacomin, & G. R. Simari (Eds.), COMMA Vol. 216 (pp. 207-218). Desenzano del Garda: IOS Press.

Exploring 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 Frontiers in Artificial Intelligence and Applications Vol. 216 (pp. 367-378). doi:10.3233/978-1-60750-619-5-367

DOI: 10.3233/978-1-60750-619-5-367

Formal 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 P. Baroni, F. Cerutti, M. Giacomin, & G. R. Simari (Eds.), COMMA Vol. 216 (pp. 63-74). Desenzano del Garda: IOS Press.

Solving 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.005

DOI: 10.1016/j.artint.2009.09.005

Tractability in value-based argumentation (Conference Paper)

Dunne, P. E. (2010). Tractability in value-based argumentation. In P. Baroni, F. Cerutti, M. Giacomin, & G. R. Simari (Eds.), COMMA Vol. 216 (pp. 195-206). Desenzano del Garda: IOS Press.

2009

Instantiating 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).

Complexity of Abstract Argumentation (Chapter)

Dunne, P. E., & Wooldridge, M. (2009). Complexity of Abstract Argumentation. In Argumentation in Artificial Intelligence (pp. 85-104). Springer US. doi:10.1007/978-0-387-98197-0_5

DOI: 10.1007/978-0-387-98197-0_5

Computational properties of resolution-based grounded semantics (Conference Paper)

Baroni, P., Dunne, P. E., & Giacomin, M. (2009). Computational properties of resolution-based grounded semantics. In IJCAI09 (pp. 683-689). Pasadena: AAAI Press.

Emotions in Rational Decision Making (Conference Paper)

Nawwab, F. S., Bench-Capon, T., & Dunne, P. E. (2010). Emotions in Rational Decision Making. In Unknown Conference (pp. 273-291). Springer Berlin Heidelberg. doi:10.1007/978-3-642-12805-9_16

DOI: 10.1007/978-3-642-12805-9_16

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.

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 Unknown Conference (pp. 34-50). Springer Berlin Heidelberg. doi:10.1007/978-3-642-40624-9_3

DOI: 10.1007/978-3-642-40624-9_3

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.001

DOI: 10.1016/j.artint.2009.09.001

2008

The 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.031

DOI: 10.1016/j.tcs.2008.01.031

A 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 Frontiers in Artificial Intelligence and Applications Vol. 172 (pp. 264-275).

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 Frontiers in Artificial Intelligence and Applications Vol. 172 (pp. 49-60).

Computational complexity of Semi-stable semantics in abstract argumentation frameworks. (Conference Paper)

Dunne, P. E., & Caminada, M. (2008). Computational complexity of Semi-stable semantics in abstract argumentation frameworks.. In JELIA08 Vol. 5293 (pp. 153-165). Dresden: Springer LNAI.

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 P. Besnard, S. Doutre, & A. Hunter (Eds.), 2nd International Conference on Computational Models of Argument (pp. 147-158). Amsterdam: IOS Press.

2007

Logic 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).

Artificial Inteligence (Edited special journal issue)

Dunne, P. E., & Bench-Capon, T. (Eds.) (2007). Artificial Inteligence (Vol. 171). Elsevier.

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.

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.001

DOI: 10.1016/j.artint.2007.05.001

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.013

DOI: 10.1016/j.artint.2006.10.013

Computational 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.006

DOI: 10.1016/j.artint.2007.03.006

2006

Complexity Properties of Restricted Abstract Argument Systems. (Conference Paper)

Dunne, P. E. (2006). Complexity Properties of Restricted Abstract Argument Systems.. In P. E. Dunne, & T. J. M. Bench-Capon (Eds.), COMMA Vol. 144 (pp. 85-96). IOS Press. Retrieved from http://www.informatik.uni-trier.de/~ley/db/conf/comma/comma2006.html

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., Lemaitre, M., Maudet, N., . . . Sousa, P. (2006). Issues in Multiagent Resource Allocation. Informatica, 30, 3-31. Retrieved from http://ai.ijs.si/informatica/

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.

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.003

DOI: 10.1016/j.artint.2006.03.003

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 P. E. Dunne, & T. J. M. Bench-Capon (Eds.), COMMA Vol. 144 (pp. 329-340). IOS Press. Retrieved from http://www.informatik.uni-trier.de/~ley/db/conf/comma/comma2006.html

2005

Discovering inconsistency through examination dialogues (Conference Paper)

Dunne, P. E., Doutre, S., & Bench-Capon, T. (2005). Discovering inconsistency through examination dialogues. In IJCAI International Joint Conference on Artificial Intelligence (pp. 1680-1681).

Explaining preferences with argument positions (Conference Paper)

Doutre, S., Bench-Capon, T., & Dunne, P. E. (2005). Explaining preferences with argument positions. In IJCAI International Joint Conference on Artificial Intelligence (pp. 1560-1561).

The 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-0

DOI: 10.1007/s10472-005-9003-0

A 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-0

DOI: 10.1007/s10506-006-9006-0

A 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.

Argumentation 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-z

DOI: 10.1007/s10506-006-9007-z

Determining Preferences Through Argumentation (Conference Paper)

Doutre, S., Bench-Capon, T., & Dunne, P. E. (2005). Determining Preferences Through Argumentation. In Unknown Conference (pp. 98-109). Springer Berlin Heidelberg. doi:10.1007/11558590_11

DOI: 10.1007/11558590_11

Extremal Behaviour in Multiagent Contract Negotiation (Journal article)

Dunne, P. E. (n.d.). Extremal Behaviour in Multiagent Contract Negotiation. Journal of Artificial Intelligence Research, 23, 41-78. doi:10.1613/jair.1526

DOI: 10.1613/jair.1526

Multi-issue negotiation with deadlines (Journal article)

Wooldridge, M. J., & Dunne, P. E. (2005). Multi-issue negotiation with deadlines. Annals of Mathematics and Artificial Intelligence, 45(3-4), 381-417. Retrieved from http://www.jair.org/media/2056/live-2056-2956-jair.pdf

Multiagent resource allocation (Journal article)

CHEVALEYRE, Y., DUNNE, P. E., ENDRISS, U., LANG, J., MAUDET, N., & RODRÍGUEZ-AGUILAR, J. A. (2005). Multiagent resource allocation. The Knowledge Engineering Review, 20(2), 143-149. doi:10.1017/s0269888905000470

DOI: 10.1017/s0269888905000470

Multiagent resource allocation in the presence of externalities (Conference Paper)

Dunne, P. E. (2005). Multiagent resource allocation in the presence of externalities. In M. Pechoucet, P. Petta, & L. Z. Varga (Eds.), CEEMAS Vol. 3690 (pp. 408-417). Berlin: Springer.

The 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.006

DOI: 10.1016/j.artint.2005.01.006

2004

Complexity in value-based argument systems (Conference Paper)

Dunne, P. E., & Bench-Capon, T. (2004). Complexity in value-based argument systems. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) Vol. 3229 (pp. 360-371).

Complexity 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.

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 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 3180 (pp. 518-527).

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.002

DOI: 10.1016/j.artint.2004.04.002

Representation and complexity in Boolean games (Conference Paper)

Dunne, P. E., & Van Der Hoek, W. (2004). Representation and complexity in Boolean games. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) Vol. 3229 (pp. 347-359).

2003

Optimal utterances in dialogue protocols (Conference Paper)

Dunne, P. E., & McBurney, P. (2003). Optimal utterances in dialogue protocols. In AAMAS'03 (pp. 608-615). New York: ACM Press.

Two 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-6

DOI: 10.1016/s0004-3702(03)00076-6

2002

Demand-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-0

DOI: 10.1016/s1383-7621(02)00062-0

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-8

DOI: 10.1016/s0004-3702(02)00261-8

No 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).

2001

A 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. The Journal of Logic and Algebraic Programming, 47(1), 1-14. doi:10.1016/s1567-8326(00)00002-3

DOI: 10.1016/s1567-8326(00)00002-3

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-7

DOI: 10.1016/S0893-9659(01)00047-7

2000

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-x

DOI: 10.1016/s0304-3975(00)00061-x

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-2

DOI: 10.1016/s0020-0190(97)00193-2

1997

The maximum length of prime implicates for instances of 3-SAT (Journal article)

Dunne, P. E., & Bench-Capon, T. J. M. (1997). The maximum length of prime implicates for instances of 3-SAT. Artificial Intelligence, 92(1-2), 317-329. doi:10.1016/s0004-3702(97)00018-0

DOI: 10.1016/s0004-3702(97)00018-0

Modelling Legal Documents as Graphs (Journal article)

Bench‐Capon, T. J. M., Dunne, P. E. S., & Stamford, G. (1997). Modelling Legal Documents as Graphs. Information & Communications Technology Law, 6(2), 103-120. doi:10.1080/13600834.1997.9965761

DOI: 10.1080/13600834.1997.9965761

1995

Multiprocessor simulation strategies with optimal speed-up (Journal article)

Dunne, P. E., Gittings, C. J., & Leng, P. H. (1995). Multiprocessor simulation strategies with optimal speed-up. Information Processing Letters, 54(1), 23-33. doi:10.1016/0020-0190(94)00226-o

DOI: 10.1016/0020-0190(94)00226-o

On the complexity of Boolean functions computed by lazy oracles (Journal article)

Dunne, P. E., Leng, P. H., & Nwana, G. F. (1995). On the complexity of Boolean functions computed by lazy oracles. IEEE Transactions on Computers, 44(4), 495-502. doi:10.1109/12.376165

DOI: 10.1109/12.376165

1993

An Algorithm to Generate Random Large Combinational Circuits (Journal article)

Charlton, C. C. (1993). An Algorithm to Generate Random Large Combinational Circuits. The Computer Journal, 36(2), 200-206. doi:10.1093/comjnl/36.2.200

DOI: 10.1093/comjnl/36.2.200

Linearisation schemata for hypertext (Conference Paper)

Bench-Capon, T. J. M., Dunne, P. E. S., & Staniford, G. (1993). Linearisation schemata for hypertext. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 720 LNCS (pp. 697-708).

1992

Integrating legal support systems through document models (Journal article)

Bench-Capon, T. J. M., Coenen, F., & Dunne, P. E. S. (1992). Integrating legal support systems through document models. Expert Systems with Applications, 4(4), 355-362. doi:10.1016/0957-4174(92)90128-f

DOI: 10.1016/0957-4174(92)90128-f

1991

Computability theory concepts and applications (Book)

Dunne, P. E. (1991). Computability theory concepts and applications. Chichester, England: Ellis Horwood. Retrieved from http://www.csc.liv.ac.uk/~ped/

1990

Comment on Kochol's paper “efficient monotone circuits for threshold functions” (Journal article)

Dunne, P. E. (1990). Comment on Kochol's paper “efficient monotone circuits for threshold functions”. Information Processing Letters, 34(5), 221-222. doi:10.1016/0020-0190(90)90125-h

DOI: 10.1016/0020-0190(90)90125-h

Expertext: From semantic nets to logic Petri nets (Journal article)

Rada, R., Dunne, P. E. S., & Barlow, J. (1990). Expertext: From semantic nets to logic Petri nets. Expert Systems with Applications, 1(1), 51-62. doi:10.1016/0957-4174(90)90068-6

DOI: 10.1016/0957-4174(90)90068-6

1989

On monotone simulations of nonmonotone networks (Journal article)

Dunne, P. E. (1989). On monotone simulations of nonmonotone networks. Theoretical Computer Science, 66(1), 15-25. doi:10.1016/0304-3975(89)90142-4

DOI: 10.1016/0304-3975(89)90142-4

1988

The complexity of Boolean networks (Book)

Dunne, P. E. (1988). The complexity of Boolean networks (Vol. 29). London, UK: Academic Press. Retrieved from http://www.csc.liv.ac.uk/~ped/

1987

A result on k-valent graphs and its application to a graph embedding problem (Journal article)

Dunne, P. E. (1987). A result on k-valent graphs and its application to a graph embedding problem. Acta Informatica, 24(4), 447-459. doi:10.1007/bf00292113

DOI: 10.1007/bf00292113

1986

The complexity of central slice functions (Journal article)

Dunne, P. E. (1986). The complexity of central slice functions. Theoretical Computer Science, 44, 247-257. doi:10.1016/0304-3975(86)90122-2

DOI: 10.1016/0304-3975(86)90122-2

1985

A 2.5n lower bound on the monotone network complexity of T 3 n (Journal article)

Dunne, P. (1985). A 2.5n lower bound on the monotone network complexity of T 3 n. Acta Informatica, 22(2). doi:10.1007/bf00264232

DOI: 10.1007/bf00264232