Paul E. Dunne

According to our database1, Paul E. Dunne
  • authored at least 118 papers between 1984 and 2016.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2016
Looking-ahead in backtracking algorithms for abstract argumentation.
Int. J. Approx. Reasoning, 2016

Investigating the Relationship between Argumentation Semantics via Signatures.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

I Heard You the First Time: Debate in Cacophonous Surroundings.
Proceedings of the Computational Models of Argument, 2016

Forbidden Sets in Argumentation Semantics.
Proceedings of the Computational Models of Argument, 2016

Spectral Techniques in Argumentation Framework Analysis.
Proceedings of the Computational Models of Argument, 2016

A Synergy Coalition Group based Dynamic Programming Algorithm for Coalition Formation.
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

2015
Senses of 'argument' in instantiated argumentation frameworks.
Argument & Computation, 2015

Characteristics of multiple viewpoints in abstract argumentation.
Artif. Intell., 2015

Distributing Coalition Value Calculations to Coalition Members.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Algorithms for Argumentation Semantics: Labeling Attacks as a Generalization of Labeling Arguments.
J. Artif. Intell. Res., 2014

Algorithms for decision problems in argument systems under preferred semantics.
Artif. Intell., 2014

Characteristics of Multiple Viewpoints in Abstract Argumentation.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, 2014

Properties of Random VAFs and Implications for Efficient Algorithms.
Proceedings of the Computational Models of Argument, 2014

Complexity Properties of Critical Sets of Arguments.
Proceedings of the Computational Models of Argument, 2014

2013
Computing Preferred Extensions in Abstract Argumentation: a SAT-based Approach.
CoRR, 2013

Parametric properties of ideal semantics.
Artif. Intell., 2013

Automata for infinite argumentation structures.
Artif. Intell., 2013

Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach.
Proceedings of the Theory and Applications of Formal Argumentation, 2013

Algorithms for Acceptance in Argument Systems.
Proceedings of the ICAART 2013, 2013

On the Instantiation of Knowledge Bases in Abstract Argumentation Frameworks.
Proceedings of the Computational Logic in Multi-Agent Systems, 2013

2012
Semi-stable semantics.
J. Log. Comput., 2012

Towards Average-case Algorithms for Abstract Argumentation.
Proceedings of the ICAART 2012 - Proceedings of the 4th International Conference on Agents and Artificial Intelligence, Volume 1, 2012

Towards Experimental Algorithms for Abstract Argumentation.
Proceedings of the Computational Models of Argument, 2012

On Preferred Extension Enumeration in Abstract Argumentation.
Proceedings of the Computational Models of Argument, 2012

Argument Aggregation: Basic Axioms and Complexity Results.
Proceedings of the Computational Models of Argument, 2012

Uniform Argumentation Frameworks.
Proceedings of the Computational Models of Argument, 2012

Irrationality in Persuasive Argumentation.
Proceedings of the Logic Programs, Norms and Action, 2012

Towards tractable Boolean games.
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

2011
On Constructing Minimal Formulae.
Comput. J., 2011

Weighted argument systems: Basic definitions, algorithms, and complexity results.
Artif. Intell., 2011

On the resolution-based family of abstract argumentation semantics and its grounded instance.
Artif. Intell., 2011

Computing with Infinite Argumentation Frameworks: The Case of AFRAs.
Proceedings of the Theorie and Applications of Formal Argumentation, 2011

Parametric Properties of Ideal Semantics.
Proceedings of the IJCAI 2011, 2011

Relating the Semantics of Abstract Dialectical Frameworks and Standard AFs.
Proceedings of the IJCAI 2011, 2011

2010
Solving coalitional resource games.
Artif. Intell., 2010

Computation in Extended Argumentation Frameworks.
Proceedings of the ECAI 2010, 2010

Exploring the Role of Emotions in Rational Decision Making.
Proceedings of the Computational Models of Argument: Proceedings of COMMA 2010, 2010

Computation with varied-strength attacks in abstract argumentation frameworks.
Proceedings of the Computational Models of Argument: Proceedings of COMMA 2010, 2010

Tractability in Value-based Argumentation.
Proceedings of the Computational Models of Argument: Proceedings of COMMA 2010, 2010

On Extension Counting Problems in Argumentation Frameworks.
Proceedings of the Computational Models of Argument: Proceedings of COMMA 2010, 2010

2009
The computational complexity of ideal semantics.
Artif. Intell., 2009

Computational Properties of Resolution-based Grounded Semantics.
Proceedings of the IJCAI 2009, 2009

Inconsistency tolerance in weighted argument systems.
Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009

Emotions in Rational Decision Making.
Proceedings of the Argumentation in Multi-Agent Systems, 6th International Workshop, 2009

Instantiating Knowledge Bases in Abstract Argumentation Frameworks.
Proceedings of the Uses of Computational Argumentation, 2009

Complexity of Abstract Argumentation.
Proceedings of the Argumentation in Artificial Intelligence, 2009

2008
The complexity of deciding reachability properties of distributed negotiation schemes.
Theor. Comput. Sci., 2008

Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks.
Proceedings of the Logics in Artificial Intelligence, 11th European Conference, 2008

A Methodology for Action-Selection using Value-Based Argumentation.
Proceedings of the Computational Models of Argument: Proceedings of COMMA 2008, 2008

The Computational Complexity of Ideal Semantics I: Abstract Argumentation Frameworks.
Proceedings of the Computational Models of Argument: Proceedings of COMMA 2008, 2008

Asking the right question: forcing commitment in examination dialogues.
Proceedings of the Computational Models of Argument: Proceedings of COMMA 2008, 2008

Cooperative Boolean games.
Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), 2008

2007
A logical characterisation of qualitative coalitional games.
Journal of Applied Non-Classical Logics, 2007

Computational properties of argument systems satisfying graph-theoretic constraints.
Artif. Intell., 2007

Audiences in argumentation frameworks.
Artif. Intell., 2007

Argumentation in artificial intelligence.
Artif. Intell., 2007

Logic for Automated Mechanism Design - A Progress Report.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
Issues in Multiagent Resource Allocation.
Informatica (Slovenia), 2006

On the computational complexity of coalitional resource games.
Artif. Intell., 2006

Suspicion of Hidden Agenda in Persuasive Argument.
Proceedings of the Computational Models of Argument: Proceedings of COMMA 2006, 2006

Complexity Properties of Restricted Abstract Argument Systems.
Proceedings of the Computational Models of Argument: Proceedings of COMMA 2006, 2006

On the Complexity of Linking Deductive and Abstract Argument Systems.
Proceedings of the Proceedings, 2006

2005
Multiagent resource allocation.
Knowledge Eng. Review, 2005

Extremal Behaviour in Multiagent Contract Negotiation.
J. Artif. Intell. Res., 2005

The complexity of agent design problems: Determinism and history dependence.
Ann. Math. Artif. Intell., 2005

A Value-based Argument Model of Convention Degradation.
Artif. Intell. Law, 2005

Argumentation in AI and Law: Editors' Introduction.
Artif. Intell. Law, 2005

The complexity of contract negotiation.
Artif. Intell., 2005

Discovering Inconsistency through Examination Dialogues.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

Explaining preferences with argument positions.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

Multiagent Resource Allocation in the Presence of Externalities.
Proceedings of the Multi-Agent Systems and Applications IV, 2005

Determining Preferences Through Argumentation.
Proceedings of the AI*IA 2005: Advances in Artificial Intelligence, 2005

2004
On the computational complexity of qualitative coalitional games.
Artif. Intell., 2004

Representation and Complexity in Boolean Games.
Proceedings of the Logics in Artificial Intelligence, 9th European Conference, 2004

Complexity in Value-Based Argument Systems.
Proceedings of the Logics in Artificial Intelligence, 9th European Conference, 2004

Tractability Results for Automatic Contracting.
Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004

Context Dependence in Multiagent Resource Allocation.
Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004

Identifying Audience Preferences in Legal and Social Domains.
Proceedings of the Database and Expert Systems Applications, 15th International Conference, 2004

2003
Two party immediate response disputes: Properties and efficiency.
Artif. Intell., 2003

Prevarication in Dispute Protocols.
Proceedings of the 9th International Conference on Artificial Intelligence and Law, 2003

Optimal utterances in dialogue protocols.
Proceedings of the Second International Joint Conference on Autonomous Agents & Multiagent Systems, 2003

Concepts of Optimal Utterance in Dialogue: Selection and Complexity.
Proceedings of the Advances in Agent Communication, 2003

2002
Demand-driven logic simulation using a network of loosely coupled processors.
Journal of Systems Architecture, 2002

On Concise Encodings of Preferred Extensions
CoRR, 2002

Coherence in finite argument systems.
Artif. Intell., 2002

On concise encodings of preferred extensions.
Proceedings of the 9th International Workshop on Non-Monotonic Reasoning (NMR 2002), 2002

The computational complexity of boolean and stochastic agent design problems.
Proceedings of the First International Joint Conference on Autonomous Agents & Multiagent Systems, 2002

No agent is an island: a framework for the study of inter-agent behavior.
Proceedings of the First International Joint Conference on Autonomous Agents & Multiagent Systems, 2002

2001
A sharp threshold for the phase transition of a restricted Satisfiability problem for Horn clauses.
J. Log. Algebr. Program., 2001

Leafy spanning trees in hypercubes.
Appl. Math. Lett., 2001

The Computational Complexity of Agent Verification.
Proceedings of the Intelligent Agents VIII, 8th International Workshop, 2001

2000
Complexity-theoretic models of phase transitions in search problems.
Theor. Comput. Sci., 2000

J.UCS Special Issue on BCTCS.
J. UCS, 2000

Optimistic and Disjunctive Agent Design Problems.
Proceedings of the Intelligent Agents VII. Agent Theories Architectures and Languages, 2000

1999
The Average Case Performance of an Algorithm for Demand-Driven Evaluation of Boolean Formulae.
J. UCS, 1999

1998
An Inproved Upper Bound on the Non-3-Colourability Threshold.
Inf. Process. Lett., 1998

Toward feasible and efficient DNA computation.
Complexity, 1998

1997
The Maximum Length of Prime Implicates for Instances of 3-SAT.
Artif. Intell., 1997

The Verification and Validation of Rulebases Using a Binary Encoded Incidence Matrix Technique.
Proceedings of the Fourth European Symposium on the Validation and Verification of Knowledge-Based Systems, 1997

The Complexity and Viability of DNA Computations.
Proceedings of the Biocomputing and emergent computation: Proceedings of BCEC97, 1997

1996
Ceilings of Monotone Boolean Functions.
J. UCS, 1996

1995
On the Complexity of Boolean Functions Computed by Lazy Oracles.
IEEE Trans. Computers, 1995

Multiprocessor Simulation Strategies with Optimal Speed-up.
Inf. Process. Lett., 1995

1994
Distributing quality-controlled software via the internet.
Microprocessing and Microprogramming, 1994

1993
Sequential and parallel strategies for the demand-driven simulation of logic circuits.
Microprocessing and Microprogramming, 1993

An Algorithm to Generate Random Large Combinational Circuits.
Comput. J., 1993

Linearisation Schemata for Hypertext.
Proceedings of the Database and Expert Systems Applications, 4th International Conference, 1993

Cooperative Dialogues with the Support of Autonomous Agents.
CoopIS, 1993

1992
Linearising Hypertext through Target Graph Specifications.
Proceedings of the International Conference on Database and Expert Systems Applications, 1992

1990
Comment on Kochol's Paper "Efficient Monotone Circuits for Threshold Functions".
Inf. Process. Lett., 1990

An Approach to the Integration of Legal Support Systems.
Proceedings of the International Conference on Database and Expert Systems Applications, 1990

1989
On Monotone Simulations of Nonmonotone Networks.
Theor. Comput. Sci., 1989

1988
Some Computational Properties of a Model for Electronic Documents.
Electronic Publishing, 1988

1987
A Result on k -Valent Graphs and Its Application to a Graph Embedding Problem.
Acta Inf., 1987

1986
The Complexity of Central Slice Functions.
Theor. Comput. Sci., 1986

1985
A 2.5n Lower Bound on the Monotone Network Complexity of T_3^n.
Acta Inf., 1985

Lower bounds on the complexity of 1-time only branching programs.
Proceedings of the Fundamentals of Computation Theory, 1985

1984
Techniques for the analysis of monotone Boolean networks.
PhD thesis, 1984


  Loading...