Techniques for the analysis of monotone Boolean networks. - Paul E. Dunne (1984)

Lower bounds on the complexity of 1-time only branching programs. - Paul E. Dunne (FCT, 1985)

A 2.5n Lower Bound on the Monotone Network Complexity of T_3^n. - Paul E. S. Dunne (Acta Informatica, 1985)

The Complexity of Central Slice Functions. - Paul E. S. Dunne (Theor. Comput. Sci., 1986)

A Result on k -Valent Graphs and Its Application to a Graph Embedding Problem. - Paul E. S. Dunne (Acta Informatica, 1987)

Some Computational Properties of a Model for Electronic Documents. - Trevor J. M. Bench-Capon; Paul E. S. Dunne (Electron. Publ., 1988)

On Monotone Simulations of Nonmonotone Networks. - Paul E. S. Dunne (Theor. Comput. Sci., 1989)

An Approach to the Integration of Legal Support Systems. - Trevor J. M. Bench-Capon; Paul E. S. Dunne (DEXA, 1990)

Comment on Kochol's Paper "Efficient Monotone Circuits for Threshold Functions". - Paul E. S. Dunne (Inf. Process. Lett., 1990)

Linearising Hypertext through Target Graph Specifications. - Trevor J. M. Bench-Capon; Paul E. S. Dunne; Geof Staniford (DEXA, 1992)

Cooperative Dialogues with the Support of Autonomous Agents. - Geof Staniford; Trevor J. M. Bench-Capon; Paul E. S. Dunne (ICICIS, 1993)

Linearisation Schemata for Hypertext. - Trevor J. M. Bench-Capon; Paul E. S. Dunne; Geof Staniford (DEXA, 1993)

An Algorithm to Generate Random Large Combinational Circuits. - Colin C. Charlton; Paul E. Dunne; Keith Halewood; Paul H. Leng (Comput. J., 1993)

Sequential and parallel strategies for the demand-driven simulation of logic circuits. - Paul E. Dunne; Chris J. J. Gittings; Paul H. Leng (Microprocess. Microprogramming, 1993)

Distributing quality-controlled software via the internet. - Colin C. Charlton; Paul E. Dunne; Paul H. Leng; Janet Little; Martin R. Woodward (Microprocess. Microprogramming, 1994)

Multiprocessor Simulation Strategies with Optimal Speed-up. - Paul E. Dunne; Chris J. Gittings; Paul H. Leng (Inf. Process. Lett., 1995)

On the Complexity of Boolean Functions Computed by Lazy Oracles. - Paul E. S. Dunne; Paul H. Leng; Gerald F. Nwana (IEEE Trans. Computers, 1995)

Ceilings of Monotone Boolean Functions. - Paul E. Dunne (J. Univers. Comput. Sci., 1996)

The Complexity and Viability of DNA Computations. - Martyn Amos; Alan Gibbons; Paul E. Dunne (BCEC, 1997)

The Verification and Validation of Rulebases Using a Binary Encoded Incidence Matrix Technique. - Frans Coenen; Paul E. Dunne (EUROVAV, 1997)

The Maximum Length of Prime Implicates for Instances of 3-SAT. - Paul E. Dunne; Trevor J. M. Bench-Capon (Artif. Intell., 1997)

Toward feasible and efficient DNA computation. - Martyn Amos; Alan Gibbons; Paul E. Dunne (Complex., 1998)

An Inproved Upper Bound on the Non-3-Colourability Threshold. - Paul E. Dunne; Michele Zito 001 (Inf. Process. Lett., 1998)

The Average Case Performance of an Algorithm for Demand-Driven Evaluation of Boolean Formulae. - Paul E. Dunne; Paul H. Leng (J. Univers. Comput. Sci., 1999)

Optimistic and Disjunctive Agent Design Problems. - Michael J. Wooldridge; Paul E. Dunne (ATAL, 2000)

J.UCS Special Issue on BCTCS. - Paul E. Dunne; Alan Gibbons (J. Univers. Comput. Sci., 2000)

Complexity-theoretic models of phase transitions in search problems. - Paul E. Dunne; Alan Gibbons; Michele Zito 001 (Theor. Comput. Sci., 2000)

The Computational Complexity of Agent Verification. - Michael J. Wooldridge; Paul E. Dunne (ATAL, 2001)

Leafy spanning trees in hypercubes. - William Duckworth; Paul E. Dunne; Alan Gibbons; Michele Zito 001 (Appl. Math. Lett., 2001)

A sharp threshold for the phase transition of a restricted Satisfiability problem for Horn clauses. - Paul E. Dunne; Trevor J. M. Bench-Capon (J. Log. Algebraic Methods Program., 2001)

No agent is an island: a framework for the study of inter-agent behavior. - Trevor J. M. Bench-Capon; Paul E. Dunne (AAMAS, 2002)

The computational complexity of boolean and stochastic agent design problems. - Paul E. Dunne; Michael J. Wooldridge; Michael Laurence (AAMAS, 2002)

On concise encodings of preferred extensions. - Paul E. Dunne (NMR, 2002)

Coherence in finite argument systems. - Paul E. Dunne; Trevor J. M. Bench-Capon (Artif. Intell., 2002)

Demand-driven logic simulation using a network of loosely coupled processors. - Paul E. Dunne; Paul H. Leng; Gerald F. Nwana (J. Syst. Archit., 2002)

Concepts of Optimal Utterance in Dialogue: Selection and Complexity. - Paul E. Dunne; Peter McBurney (Workshop on Agent Communication Languages, 2003)

Optimal utterances in dialogue protocols. - Paul E. Dunne; Peter McBurney (AAMAS, 2003)

Prevarication in Dispute Protocols. - Paul E. Dunne (ICAIL, 2003)

Two party immediate response disputes: Properties and efficiency. - Paul E. Dunne; Trevor J. M. Bench-Capon (Artif. Intell., 2003)

Identifying Audience Preferences in Legal and Social Domains. - Paul E. Dunne; Trevor J. M. Bench-Capon (DEXA, 2004)

Context Dependence in Multiagent Resource Allocation. - Paul E. Dunne (ECAI, 2004)

Tractability Results for Automatic Contracting. - Paul E. Dunne; Michael Laurence; Michael J. Wooldridge (ECAI, 2004)

Complexity in Value-Based Argument Systems. - Paul E. Dunne; Trevor J. M. Bench-Capon (JELIA, 2004)

Representation and Complexity in Boolean Games. - Paul E. Dunne; Wiebe van der Hoek (JELIA, 2004)

On the computational complexity of qualitative coalitional games. - Michael J. Wooldridge; Paul E. Dunne (Artif. Intell., 2004)

Determining Preferences Through Argumentation. - Sylvie Doutre; Trevor J. M. Bench-Capon; Paul E. Dunne (AI*IA, 2005)

Multiagent Resource Allocation in the Presence of Externalities. - Paul E. Dunne (CEEMAS, 2005)

Explaining preferences with argument positions. - Sylvie Doutre; Trevor J. M. Bench-Capon; Paul E. Dunne (IJCAI, 2005)

Discovering Inconsistency through Examination Dialogues. - Paul E. Dunne; Sylvie Doutre; Trevor J. M. Bench-Capon (IJCAI, 2005)

The complexity of contract negotiation. - Paul E. Dunne; Michael J. Wooldridge; Michael Laurence (Artif. Intell., 2005)

Argumentation in AI and Law: Editors' Introduction. - Trevor J. M. Bench-Capon; Paul E. Dunne (Artif. Intell. Law, 2005)

A Value-based Argument Model of Convention Degradation. - Paul E. Dunne (Artif. Intell. Law, 2005)

The complexity of agent design problems: Determinism and history dependence. - Michael J. Wooldridge; Paul E. Dunne (Ann. Math. Artif. Intell., 2005)

Extremal Behaviour in Multiagent Contract Negotiation. - Paul E. Dunne (J. Artif. Intell. Res., 2005)

Multiagent resource allocation. - Yann Chevaleyre; Paul E. Dunne; Ulle Endriss; Jérôme Lang; Nicolas Maudet; Juan A. Rodríguez-Aguilar (Knowl. Eng. Rev., 2005)

On the Complexity of Linking Deductive and Abstract Argument Systems. - Michael J. Wooldridge; Paul E. Dunne; Simon Parsons (AAAI, 2006)

Complexity Properties of Restricted Abstract Argument Systems. - Paul E. Dunne (COMMA, 2006)

Suspicion of Hidden Agenda in Persuasive Argument. - Paul E. Dunne (COMMA, 2006)

On the computational complexity of coalitional resource games. - Michael J. Wooldridge; Paul E. Dunne (Artif. Intell., 2006)

Issues in Multiagent Resource Allocation. - Yann Chevaleyre; Paul E. Dunne; Ulle Endriss; Jérôme Lang; Michel Lemaître; Nicolas Maudet; Julian A. Padget; Steve Phelps; Juan A. Rodríguez-Aguilar; Paulo Sousa (Informatica (Slovenia), 2006)

Logic for Automated Mechanism Design - A Progress Report. - Michael J. Wooldridge; Thomas Ågotnes; Paul E. Dunne; Wiebe van der Hoek (AAAI, 2007)

Argumentation in artificial intelligence. - Trevor J. M. Bench-Capon; Paul E. Dunne (Artif. Intell., 2007)

Audiences in argumentation frameworks. - Trevor J. M. Bench-Capon; Sylvie Doutre; Paul E. Dunne (Artif. Intell., 2007)

Computational properties of argument systems satisfying graph-theoretic constraints. - Paul E. Dunne (Artif. Intell., 2007)

A logical characterisation of qualitative coalitional games. - Paul E. Dunne; Wiebe van der Hoek; Michael J. Wooldridge (J. Appl. Non Class. Logics, 2007)

Cooperative Boolean games. - Paul E. Dunne; Wiebe van der Hoek; Sarit Kraus; Michael J. Wooldridge (AAMAS (2), 2008)

Asking the right question: forcing commitment in examination dialogues. - Trevor J. M. Bench-Capon; Sylvie Doutre; Paul E. Dunne (COMMA, 2008)

The Computational Complexity of Ideal Semantics I: Abstract Argumentation Frameworks. - Paul E. Dunne (COMMA, 2008)

A Methodology for Action-Selection using Value-Based Argumentation. - Fahd Saud Nawwab; Trevor J. M. Bench-Capon; Paul E. Dunne (COMMA, 2008)

Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks. - Paul E. Dunne; Martin Caminada (JELIA, 2008)

The complexity of deciding reachability properties of distributed negotiation schemes. - Paul E. Dunne; Yann Chevaleyre (Theor. Comput. Sci., 2008)

Complexity of Abstract Argumentation. - Paul E. Dunne; Michael J. Wooldridge (Argumentation in Artificial Intelligence, 2009)

Instantiating Knowledge Bases in Abstract Argumentation Frameworks. - Adam Zachary Wyner; Trevor J. M. Bench-Capon; Paul E. Dunne (AAAI Fall Symposium: The Uses of Computational Argumentation, 2009)

Emotions in Rational Decision Making. - Fahd Saud Nawwab; Trevor J. M. Bench-Capon; Paul E. Dunne (ArgMAS, 2009)

Inconsistency tolerance in weighted argument systems. - Paul E. Dunne; Anthony Hunter; Peter McBurney; Simon Parsons; Michael J. Wooldridge (AAMAS (2), 2009)

Computational Properties of Resolution-based Grounded Semantics. - Pietro Baroni; Paul E. Dunne; Massimiliano Giacomin (IJCAI, 2009)

The computational complexity of ideal semantics. - Paul E. Dunne (Artif. Intell., 2009)

On Extension Counting Problems in Argumentation Frameworks. - Pietro Baroni; Paul E. Dunne; Massimiliano Giacomin (COMMA, 2010)

Tractability in Value-based Argumentation. - Paul E. Dunne (COMMA, 2010)

Computation with varied-strength attacks in abstract argumentation frameworks. - Paul E. Dunne; Diego C. Martínez 001; Alejandro Javier García; Guillermo Ricardo Simari (COMMA, 2010)

Exploring the Role of Emotions in Rational Decision Making. - Fahd Saud Nawwab; Paul E. Dunne; Trevor J. M. Bench-Capon (COMMA, 2010)

Computation in Extended Argumentation Frameworks. - Paul E. Dunne; Sanjay Modgil; Trevor J. M. Bench-Capon (ECAI, 2010)

Solving coalitional resource games. - Paul E. Dunne; Sarit Kraus; Efrat Manisterski; Michael J. Wooldridge (Artif. Intell., 2010)

Relating the Semantics of Abstract Dialectical Frameworks and Standard AFs. - Gerhard Brewka; Paul E. Dunne; Stefan Woltran (IJCAI, 2011)

Computing with Infinite Argumentation Frameworks: The Case of AFRAs. - Pietro Baroni; Federico Cerutti 001; Paul E. Dunne; Massimiliano Giacomin (TAFA, 2011)

On the resolution-based family of abstract argumentation semantics and its grounded instance. - Pietro Baroni; Paul E. Dunne; Massimiliano Giacomin (Artif. Intell., 2011)

Weighted argument systems: Basic definitions, algorithms, and complexity results. - Paul E. Dunne; Anthony Hunter; Peter McBurney; Simon Parsons; Michael J. Wooldridge (Artif. Intell., 2011)

On Constructing Minimal Formulae. - Paul E. Dunne (Comput. J., 2011)

Towards tractable Boolean games. - Paul E. Dunne; Michael J. Wooldridge (AAMAS, 2012)

Irrationality in Persuasive Argumentation. - Paul E. Dunne (Logic Programs, Norms and Action, 2012)

Uniform Argumentation Frameworks. - Katie Atkinson; Trevor J. M. Bench-Capon; Paul E. Dunne (COMMA, 2012)

Argument Aggregation: Basic Axioms and Complexity Results. - Paul E. Dunne; Pierre Marquis; Michael J. Wooldridge (COMMA, 2012)

On Preferred Extension Enumeration in Abstract Argumentation. - Samer Nofal; Paul E. Dunne; Katie Atkinson (COMMA, 2012)

Towards Experimental Algorithms for Abstract Argumentation. - Samer Nofal; Paul E. Dunne; Katie Atkinson (COMMA, 2012)

Towards Average-case Algorithms for Abstract Argumentation. - Samer Nofal; Paul E. Dunne; Katie Atkinson (ICAART (1), 2012)

Semi-stable semantics. - Martin W. A. Caminada; Walter Alexandre Carnielli; Paul E. Dunne (J. Log. Comput., 2012)

On the Instantiation of Knowledge Bases in Abstract Argumentation Frameworks. - Adam Z. Wyner; Trevor J. M. Bench-Capon; Paul E. Dunne (CLIMA, 2013)

Algorithms for Acceptance in Argument Systems. - Samer Nofal; Paul E. Dunne; Katie Atkinson (ICAART (2), 2013)

Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach. - Federico Cerutti 001; Paul E. Dunne; Massimiliano Giacomin; Mauro Vallati (TAFA, 2013)

Automata for infinite argumentation structures. - Pietro Baroni; Federico Cerutti 001; Paul E. Dunne; Massimiliano Giacomin (Artif. Intell., 2013)

Parametric properties of ideal semantics. - Paul E. Dunne; Wolfgang Dvorák; Stefan Woltran (Artif. Intell., 2013)

Complexity Properties of Critical Sets of Arguments. - Richard Booth 001; Martin Caminada; Paul E. Dunne; Mikolaj Podlaszewski; Iyad Rahwan (COMMA, 2014)

Properties of Random VAFs and Implications for Efficient Algorithms. - Paul E. Dunne; Katie Atkinson (COMMA, 2014)

Algorithms for decision problems in argument systems under preferred semantics. - Samer Nofal; Katie Atkinson; Paul E. Dunne (Artif. Intell., 2014)

Algorithms for Argumentation Semantics: Labeling Attacks as a Generalization of Labeling Arguments. - Samer Nofal; Katie Atkinson; Paul E. Dunne (J. Artif. Intell. Res., 2014)

Distributing Coalition Value Calculations to Coalition Members. - Luke Riley; Katie Atkinson; Paul E. Dunne; Terry R. Payne (AAAI, 2015)

Characteristics of multiple viewpoints in abstract argumentation. - Paul E. Dunne; Wolfgang Dvorák; Thomas Linsbichler; Stefan Woltran (Artif. Intell., 2015)

Senses of 'argument' in instantiated argumentation frameworks. - Adam Z. Wyner; Trevor J. M. Bench-Capon; Paul E. Dunne; Federico Cerutti 001 (Argument Comput., 2015)

A Synergy Coalition Group based Dynamic Programming Algorithm for Coalition Formation. - Luke Riley; Katie Atkinson; Paul E. Dunne; Terry R. Payne (AAMAS, 2016)

Spectral Techniques in Argumentation Framework Analysis. - James Butterworth; Paul E. Dunne (COMMA, 2016)

Forbidden Sets in Argumentation Semantics. - Paul E. Dunne (COMMA, 2016)

I Heard You the First Time: Debate in Cacophonous Surroundings. - Paul E. Dunne (COMMA, 2016)

Investigating the Relationship between Argumentation Semantics via Signatures. - Paul E. Dunne; Christof Spanring; Thomas Linsbichler; Stefan Woltran (IJCAI, 2016)

Looking-ahead in backtracking algorithms for abstract argumentation. - Samer Nofal; Katie Atkinson; Paul E. Dunne (Int. J. Approx. Reason., 2016)

Computational Problems in Formal Argumentation and their Complexity. - Wolfgang Dvorák; Paul E. Dunne (FLAP, 2017)

Unconscious Patterns in Argument: Fractal Dimension in Oratory. - Paul E. Dunne (COMMA, 2018)

On Deciding Admissibility in Abstract Argumentation Frameworks. - Samer Nofal; Katie Atkinson; Paul E. Dunne (KEOD, 2019)

A New Labelling Algorithm for Generating Preferred Extensions of Abstract Argumentation Frameworks. - Samer Nofal; Katie Atkinson; Paul E. Dunne; Ismail Omar Hababeh (ICEIS (1), 2019)

Strong admissibility revisited: Theory and applications. - Martin Caminada; Paul E. Dunne (Argument Comput., 2019)

Computation Counts - An Introduction to Analytic Concepts in Computer Science. - Paul E. Dunne (Bull. EATCS, 2019)

On checking skeptical and ideal admissibility in abstract argumentation frameworks. - Samer Nofal; Katie Atkinson; Paul E. Dunne (Inf. Process. Lett., 2019)

Minimal Strong Admissibility: A Complexity Analysis. - Martin Caminada; Paul E. Dunne (COMMA, 2020)

Characterizing strongly admissible sets. - Paul E. Dunne (Argument Comput., 2020)

Delegating Decisions in Strategic Settings. - Paul E. Dunne; Paul Harrenstein; Sarit Kraus; Michael J. Wooldridge (IEEE Trans. Artif. Intell., 2020)

Computing Grounded Extensions Of Abstract Argumentation Frameworks. - Samer Nofal; Katie Atkinson; Paul E. Dunne (Comput. J., 2021)

Well, to Be Honest, I Wouldnt Start from Here at All. - Paul E. Dunne (COMMA, 2022)

Using Two Colour Necklaces to Fairly Allocate Coalition Value Calculations. - Terry R. Payne; Luke Riley; Katie Atkinson; Paul E. Dunne (WI/IAT, 2024)

Decidability in argumentation semantics. - Paul E. Dunne (Argument Comput., 2024)