Paul E. Dunne

123 papers A* 10A 8B 4C 25Journal 54Unranked 20
YearRankTypeTitle / Venue / Authors
2024 J jnl
Decidability in argumentation semantics.
Argument Comput.
Paul E. Dunne
2024 — conf
Using Two Colour Necklaces to Fairly Allocate Coalition Value Calculations.
WI/IAT
Terry R. Payne, Luke Riley, Katie Atkinson, Paul E. Dunne
2022 C conf
Well, to Be Honest, I Wouldnt Start from Here at All.
COMMA
Paul E. Dunne
2021 J jnl
Computing Grounded Extensions Of Abstract Argumentation Frameworks.
Comput. J.
Samer Nofal, Katie Atkinson, Paul E. Dunne
2020 J jnl
Characterizing strongly admissible sets.
Argument Comput.
Paul E. Dunne
2020 J jnl
Delegating Decisions in Strategic Settings.
IEEE Trans. Artif. Intell.
Paul E. Dunne, Paul Harrenstein, Sarit Kraus, Michael J. Wooldridge
2020 C conf
Minimal Strong Admissibility: A Complexity Analysis.
COMMA
Martin Caminada, Paul E. Dunne
2019 — conf
A New Labelling Algorithm for Generating Preferred Extensions of Abstract Argumentation Frameworks.
ICEIS (1)
Samer Nofal, Katie Atkinson, Paul E. Dunne, Ismail Omar Hababeh
2019 J jnl
Computation Counts - An Introduction to Analytic Concepts in Computer Science.
Bull. EATCS
Paul E. Dunne
2019 C conf
On Deciding Admissibility in Abstract Argumentation Frameworks.
KEOD
Samer Nofal, Katie Atkinson, Paul E. Dunne
2019 J jnl
On checking skeptical and ideal admissibility in abstract argumentation frameworks.
Inf. Process. Lett.
Samer Nofal, Katie Atkinson, Paul E. Dunne
2019 J jnl
Strong admissibility revisited: Theory and applications.
Argument Comput.
Martin Caminada, Paul E. Dunne
2018 J jnl
Automata for Infinite Argumentation Structures.
CoRR
Pietro Baroni, Federico Cerutti, Paul E. Dunne, Massimiliano Giacomin
2018 C conf
Unconscious Patterns in Argument: Fractal Dimension in Oratory.
COMMA
Paul E. Dunne
2017 J jnl
Computational Problems in Formal Argumentation and their Complexity.
FLAP
Wolfgang Dvorák, Paul E. Dunne
2016 A conf
A Synergy Coalition Group based Dynamic Programming Algorithm for Coalition Formation.
AAMAS
Luke Riley, Katie Atkinson, Paul E. Dunne, Terry R. Payne
2016 C conf
Forbidden Sets in Argumentation Semantics.
COMMA
Paul E. Dunne
2016 C conf
I Heard You the First Time: Debate in Cacophonous Surroundings.
COMMA
Paul E. Dunne
2016 A* conf
Investigating the Relationship between Argumentation Semantics via Signatures.
IJCAI
Paul E. Dunne, Christof Spanring, Thomas Linsbichler, Stefan Woltran
2016 J jnl
Looking-ahead in backtracking algorithms for abstract argumentation.
Int. J. Approx. Reason.
Samer Nofal, Katie Atkinson, Paul E. Dunne
2016 C conf
Spectral Techniques in Argumentation Framework Analysis.
COMMA
James Butterworth, Paul E. Dunne
2015 J jnl
Characteristics of multiple viewpoints in abstract argumentation.
Artif. Intell.
Paul E. Dunne, Wolfgang Dvorák, Thomas Linsbichler, Stefan Woltran
2015 A* conf
Distributing Coalition Value Calculations to Coalition Members.
AAAI
Luke Riley, Katie Atkinson, Paul E. Dunne, Terry R. Payne
2015 J jnl
Senses of 'argument' in instantiated argumentation frameworks.
Argument Comput.
Adam Z. Wyner, Trevor J. M. Bench-Capon, Paul E. Dunne, Federico Cerutti
2014 J jnl
Algorithms for Argumentation Semantics: Labeling Attacks as a Generalization of Labeling Arguments.
J. Artif. Intell. Res.
Samer Nofal, Katie Atkinson, Paul E. Dunne
2014 J jnl
Algorithms for decision problems in argument systems under preferred semantics.
Artif. Intell.
Samer Nofal, Katie Atkinson, Paul E. Dunne
2014 A* conf
Characteristics of Multiple Viewpoints in Abstract Argumentation.
KR
Paul E. Dunne, Wolfgang Dvorák, Thomas Linsbichler, Stefan Woltran
2014 C conf
Complexity Properties of Critical Sets of Arguments.
COMMA
Richard Booth, Martin Caminada, Paul E. Dunne, Mikolaj Podlaszewski, Iyad Rahwan
2014 C conf
Properties of Random VAFs and Implications for Efficient Algorithms.
COMMA
Paul E. Dunne, Katie Atkinson
2013 — conf
Algorithms for Acceptance in Argument Systems.
ICAART (2)
Samer Nofal, Paul E. Dunne, Katie Atkinson
2013 J jnl
Automata for infinite argumentation structures.
Artif. Intell.
Pietro Baroni, Federico Cerutti, Paul E. Dunne, Massimiliano Giacomin
2013 — conf
Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach.
TAFA
Federico Cerutti, Paul E. Dunne, Massimiliano Giacomin, Mauro Vallati
2013 J jnl
Computing Preferred Extensions in Abstract Argumentation: a SAT-based Approach.
CoRR
Federico Cerutti, Paul E. Dunne, Massimiliano Giacomin, Mauro Vallati
2013 — conf
On the Instantiation of Knowledge Bases in Abstract Argumentation Frameworks.
CLIMA
Adam Z. Wyner, Trevor J. M. Bench-Capon, Paul E. Dunne
2013 J jnl
Parametric properties of ideal semantics.
Artif. Intell.
Paul E. Dunne, Wolfgang Dvorák, Stefan Woltran
2012 C conf
Argument Aggregation: Basic Axioms and Complexity Results.
COMMA
Paul E. Dunne, Pierre Marquis, Michael J. Wooldridge
2012 — conf
Irrationality in Persuasive Argumentation.
Logic Programs, Norms and Action
Paul E. Dunne
2012 C conf
On Preferred Extension Enumeration in Abstract Argumentation.
COMMA
Samer Nofal, Paul E. Dunne, Katie Atkinson
2012 J jnl
Semi-stable semantics.
J. Log. Comput.
Martin W. A. Caminada, Walter Alexandre Carnielli, Paul E. Dunne
2012 — conf
Towards Average-case Algorithms for Abstract Argumentation.
ICAART (1)
Samer Nofal, Paul E. Dunne, Katie Atkinson
2012 C conf
Towards Experimental Algorithms for Abstract Argumentation.
COMMA
Samer Nofal, Paul E. Dunne, Katie Atkinson
2012 A conf
Towards tractable Boolean games.
AAMAS
Paul E. Dunne, Michael J. Wooldridge
2012 C conf
Uniform Argumentation Frameworks.
COMMA
Katie Atkinson, Trevor J. M. Bench-Capon, Paul E. Dunne
2011 — conf
Computing with Infinite Argumentation Frameworks: The Case of AFRAs.
TAFA
Pietro Baroni, Federico Cerutti, Paul E. Dunne, Massimiliano Giacomin
2011 J jnl
On Constructing Minimal Formulae.
Comput. J.
Paul E. Dunne
2011 J jnl
On the resolution-based family of abstract argumentation semantics and its grounded instance.
Artif. Intell.
Pietro Baroni, Paul E. Dunne, Massimiliano Giacomin
2011 A* conf
Parametric Properties of Ideal Semantics.
IJCAI
Wolfgang Dvorák, Paul E. Dunne, Stefan Woltran
2011 A* conf
Relating the Semantics of Abstract Dialectical Frameworks and Standard AFs.
IJCAI
Gerhard Brewka, Paul E. Dunne, Stefan Woltran
2011 J jnl
Weighted argument systems: Basic definitions, algorithms, and complexity results.
Artif. Intell.
Paul E. Dunne, Anthony Hunter, Peter McBurney, Simon Parsons, Michael J. Wooldridge
2010 A conf
Computation in Extended Argumentation Frameworks.
ECAI
Paul E. Dunne, Sanjay Modgil, Trevor J. M. Bench-Capon
2010 C conf
Computation with varied-strength attacks in abstract argumentation frameworks.
COMMA
Paul E. Dunne, Diego C. Martínez, Alejandro Javier García, Guillermo Ricardo Simari
2010 C conf
Exploring the Role of Emotions in Rational Decision Making.
COMMA
Fahd Saud Nawwab, Paul E. Dunne, Trevor J. M. Bench-Capon
2010 C conf
On Extension Counting Problems in Argumentation Frameworks.
COMMA
Pietro Baroni, Paul E. Dunne, Massimiliano Giacomin
2010 J jnl
Solving coalitional resource games.
Artif. Intell.
Paul E. Dunne, Sarit Kraus, Efrat Manisterski, Michael J. Wooldridge
2010 C conf
Tractability in Value-based Argumentation.
COMMA
Paul E. Dunne
2009 — ch.
Complexity of Abstract Argumentation.
Argumentation in Artificial Intelligence
Paul E. Dunne, Michael J. Wooldridge
2009 A* conf
Computational Properties of Resolution-based Grounded Semantics.
IJCAI
Pietro Baroni, Paul E. Dunne, Massimiliano Giacomin
2009 — conf
Emotions in Rational Decision Making.
ArgMAS
Fahd Saud Nawwab, Trevor J. M. Bench-Capon, Paul E. Dunne
2009 — conf
Inconsistency tolerance in weighted argument systems.
AAMAS (2)
Paul E. Dunne, Anthony Hunter, Peter McBurney, Simon Parsons, Michael J. Wooldridge
2009 — conf
Instantiating Knowledge Bases in Abstract Argumentation Frameworks.
AAAI Fall Symposium: The Uses of Computational Argumentation
Adam Zachary Wyner, Trevor J. M. Bench-Capon, Paul E. Dunne
2009 J jnl
The computational complexity of ideal semantics.
Artif. Intell.
Paul E. Dunne
2008 C conf
A Methodology for Action-Selection using Value-Based Argumentation.
COMMA
Fahd Saud Nawwab, Trevor J. M. Bench-Capon, Paul E. Dunne
2008 C conf
Asking the right question: forcing commitment in examination dialogues.
COMMA
Trevor J. M. Bench-Capon, Sylvie Doutre, Paul E. Dunne
2008 B conf
Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks.
JELIA
Paul E. Dunne, Martin Caminada
2008 — conf
Cooperative Boolean games.
AAMAS (2)
Paul E. Dunne, Wiebe van der Hoek, Sarit Kraus, Michael J. Wooldridge
2008 C conf
The Computational Complexity of Ideal Semantics I: Abstract Argumentation Frameworks.
COMMA
Paul E. Dunne
2008 J jnl
The complexity of deciding reachability properties of distributed negotiation schemes.
Theor. Comput. Sci.
Paul E. Dunne, Yann Chevaleyre
2007 J jnl
A logical characterisation of qualitative coalitional games.
J. Appl. Non Class. Logics
Paul E. Dunne, Wiebe van der Hoek, Michael J. Wooldridge
2007 J jnl
Argumentation in artificial intelligence.
Artif. Intell.
Trevor J. M. Bench-Capon, Paul E. Dunne
2007 J jnl
Audiences in argumentation frameworks.
Artif. Intell.
Trevor J. M. Bench-Capon, Sylvie Doutre, Paul E. Dunne
2007 J jnl
Computational properties of argument systems satisfying graph-theoretic constraints.
Artif. Intell.
Paul E. Dunne
2007 A* conf
Logic for Automated Mechanism Design - A Progress Report.
AAAI
Michael J. Wooldridge, Thomas Ågotnes, Paul E. Dunne, Wiebe van der Hoek
2006 C conf
Complexity Properties of Restricted Abstract Argument Systems.
COMMA
Paul E. Dunne
2006 C ed.
Computational Models of Argument: Proceedings of COMMA 2006, September 11-12, 2006, Liverpool, UK
COMMA
Paul E. Dunne, Trevor J. M. Bench-Capon
2006 J jnl
Issues in Multiagent Resource Allocation.
Informatica (Slovenia)
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
2006 A* conf
On the Complexity of Linking Deductive and Abstract Argument Systems.
AAAI
Michael J. Wooldridge, Paul E. Dunne, Simon Parsons
2006 J jnl
On the computational complexity of coalitional resource games.
Artif. Intell.
Michael J. Wooldridge, Paul E. Dunne
2006 C conf
Suspicion of Hidden Agenda in Persuasive Argument.
COMMA
Paul E. Dunne
2005 J jnl
A Value-based Argument Model of Convention Degradation.
Artif. Intell. Law
Paul E. Dunne
2005 J jnl
Argumentation in AI and Law: Editors' Introduction.
Artif. Intell. Law
Trevor J. M. Bench-Capon, Paul E. Dunne
2005 — conf
Determining Preferences Through Argumentation.
AI*IA
Sylvie Doutre, Trevor J. M. Bench-Capon, Paul E. Dunne
2005 A* conf
Discovering Inconsistency through Examination Dialogues.
IJCAI
Paul E. Dunne, Sylvie Doutre, Trevor J. M. Bench-Capon
2005 A* conf
Explaining preferences with argument positions.
IJCAI
Sylvie Doutre, Trevor J. M. Bench-Capon, Paul E. Dunne
2005 J jnl
Extremal Behaviour in Multiagent Contract Negotiation.
J. Artif. Intell. Res.
Paul E. Dunne
2005 — conf
Multiagent Resource Allocation in the Presence of Externalities.
CEEMAS
Paul E. Dunne
2005 J jnl
Multiagent resource allocation.
Knowl. Eng. Rev.
Yann Chevaleyre, Paul E. Dunne, Ulle Endriss, Jérôme Lang, Nicolas Maudet, Juan A. Rodríguez-Aguilar
2005 J jnl
The complexity of agent design problems: Determinism and history dependence.
Ann. Math. Artif. Intell.
Michael J. Wooldridge, Paul E. Dunne
2005 J jnl
The complexity of contract negotiation.
Artif. Intell.
Paul E. Dunne, Michael J. Wooldridge, Michael Laurence
2004 B conf
Complexity in Value-Based Argument Systems.
JELIA
Paul E. Dunne, Trevor J. M. Bench-Capon
2004 A conf
Context Dependence in Multiagent Resource Allocation.
ECAI
Paul E. Dunne
2004 C conf
Identifying Audience Preferences in Legal and Social Domains.
DEXA
Paul E. Dunne, Trevor J. M. Bench-Capon
2004 J jnl
On the computational complexity of qualitative coalitional games.
Artif. Intell.
Michael J. Wooldridge, Paul E. Dunne
2004 B conf
Representation and Complexity in Boolean Games.
JELIA
Paul E. Dunne, Wiebe van der Hoek
2004 A conf
Tractability Results for Automatic Contracting.
ECAI
Paul E. Dunne, Michael Laurence, Michael J. Wooldridge
2003 — conf
Concepts of Optimal Utterance in Dialogue: Selection and Complexity.
Workshop on Agent Communication Languages
Paul E. Dunne, Peter McBurney
2003 A conf
Optimal utterances in dialogue protocols.
AAMAS
Paul E. Dunne, Peter McBurney
2003 C conf
Prevarication in Dispute Protocols.
ICAIL
Paul E. Dunne
2003 J jnl
Two party immediate response disputes: Properties and efficiency.
Artif. Intell.
Paul E. Dunne, Trevor J. M. Bench-Capon
2002 J jnl
Coherence in finite argument systems.
Artif. Intell.
Paul E. Dunne, Trevor J. M. Bench-Capon
2002 J jnl
Demand-driven logic simulation using a network of loosely coupled processors.
J. Syst. Archit.
Paul E. Dunne, Paul H. Leng, Gerald F. Nwana
2002 A conf
No agent is an island: a framework for the study of inter-agent behavior.
AAMAS
Trevor J. M. Bench-Capon, Paul E. Dunne
2002 J jnl
On Concise Encodings of Preferred Extensions
CoRR
Paul E. Dunne
2002 — conf
On concise encodings of preferred extensions.
NMR
Paul E. Dunne
2002 A conf
The computational complexity of boolean and stochastic agent design problems.
AAMAS
Paul E. Dunne, Michael J. Wooldridge, Michael Laurence
2001 J jnl
A sharp threshold for the phase transition of a restricted Satisfiability problem for Horn clauses.
J. Log. Algebraic Methods Program.
Paul E. Dunne, Trevor J. M. Bench-Capon
2001 J jnl
Leafy spanning trees in hypercubes.
Appl. Math. Lett.
William Duckworth, Paul E. Dunne, Alan Gibbons, Michele Zito
2001 — conf
The Computational Complexity of Agent Verification.
ATAL
Michael J. Wooldridge, Paul E. Dunne
2000 J jnl
Complexity-theoretic models of phase transitions in search problems.
Theor. Comput. Sci.
Paul E. Dunne, Alan Gibbons, Michele Zito
2000 J jnl
J.UCS Special Issue on BCTCS.
J. Univers. Comput. Sci.
Paul E. Dunne, Alan Gibbons
2000 — conf
Optimistic and Disjunctive Agent Design Problems.
ATAL
Michael J. Wooldridge, Paul E. Dunne
1999 J jnl
The Average Case Performance of an Algorithm for Demand-Driven Evaluation of Boolean Formulae.
J. Univers. Comput. Sci.
Paul E. Dunne, Paul H. Leng
1998 J jnl
An Inproved Upper Bound on the Non-3-Colourability Threshold.
Inf. Process. Lett.
Paul E. Dunne, Michele Zito
1998 J jnl
Toward feasible and efficient DNA computation.
Complex.
Martyn Amos, Alan Gibbons, Paul E. Dunne
1997 — conf
The Complexity and Viability of DNA Computations.
BCEC
Martyn Amos, Alan Gibbons, Paul E. Dunne
1997 J jnl
The Maximum Length of Prime Implicates for Instances of 3-SAT.
Artif. Intell.
Paul E. Dunne, Trevor J. M. Bench-Capon
1997 — conf
The Verification and Validation of Rulebases Using a Binary Encoded Incidence Matrix Technique.
EUROVAV
Frans Coenen, Paul E. Dunne
1996 J jnl
Ceilings of Monotone Boolean Functions.
J. Univers. Comput. Sci.
Paul E. Dunne
1995 J jnl
Multiprocessor Simulation Strategies with Optimal Speed-up.
Inf. Process. Lett.
Paul E. Dunne, Chris J. Gittings, Paul H. Leng
1994 J jnl
Distributing quality-controlled software via the internet.
Microprocess. Microprogramming
Colin C. Charlton, Paul E. Dunne, Paul H. Leng, Janet Little, Martin R. Woodward
1993 J jnl
An Algorithm to Generate Random Large Combinational Circuits.
Comput. J.
Colin C. Charlton, Paul E. Dunne, Keith Halewood, Paul H. Leng
1993 J jnl
Sequential and parallel strategies for the demand-driven simulation of logic circuits.
Microprocess. Microprogramming
Paul E. Dunne, Chris J. J. Gittings, Paul H. Leng
1985 B conf
Lower bounds on the complexity of 1-time only branching programs.
FCT
Paul E. Dunne
1984 — —
Techniques for the analysis of monotone Boolean networks.
Paul E. Dunne