The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Paul E. Dunne: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michael Wooldridge, Paul E. Dunne, Simon Parsons
    On the Complexity of Linking Deductive and Abstract Argument Systems. [Citation Graph (0, 0)][DBLP]
    AAAI, 2006, pp:- [Conf]
  2. Paul E. Dunne, Peter McBurney
    Concepts of Optimal Utterance in Dialogue: Selection and Complexity. [Citation Graph (0, 0)][DBLP]
    Workshop on Agent Communication Languages, 2003, pp:310-328 [Conf]
  3. Sylvie Doutre, Trevor J. M. Bench-Capon, Paul E. Dunne
    Determining Preferences Through Argumentation. [Citation Graph (0, 0)][DBLP]
    AI*IA, 2005, pp:98-109 [Conf]
  4. Trevor J. M. Bench-Capon, Paul E. Dunne
    No agent is an island: a framework for the study of inter-agent behavior. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2002, pp:690-691 [Conf]
  5. Paul E. Dunne, Peter McBurney
    Optimal utterances in dialogue protocols. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2003, pp:608-615 [Conf]
  6. Paul E. Dunne, Michael Wooldridge, Michael Laurence
    The computational complexity of boolean and stochastic agent design problems. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2002, pp:976-983 [Conf]
  7. Michael Wooldridge, Paul E. Dunne
    Optimistic and Disjunctive Agent Design Problems. [Citation Graph (0, 0)][DBLP]
    ATAL, 2000, pp:1-14 [Conf]
  8. Michael Wooldridge, Paul E. Dunne
    The Computational Complexity of Agent Verification. [Citation Graph (0, 0)][DBLP]
    ATAL, 2001, pp:115-127 [Conf]
  9. Martyn Amos, Alan Gibbons, Paul E. Dunne
    The Complexity and Viability of DNA Computations. [Citation Graph (0, 0)][DBLP]
    BCEC, 1997, pp:165-173 [Conf]
  10. Paul E. Dunne
    Multiagent Resource Allocation in the Presence of Externalities. [Citation Graph (0, 0)][DBLP]
    CEEMAS, 2005, pp:408-417 [Conf]
  11. Paul E. Dunne, Trevor J. M. Bench-Capon
    Identifying Audience Preferences in Legal and Social Domains. [Citation Graph (0, 0)][DBLP]
    DEXA, 2004, pp:518-527 [Conf]
  12. Paul E. Dunne
    Context Dependence in Multiagent Resource Allocation. [Citation Graph (0, 0)][DBLP]
    ECAI, 2004, pp:1001-1002 [Conf]
  13. Paul E. Dunne, Michael Laurence, Michael Wooldridge
    Tractability Results for Automatic Contracting. [Citation Graph (0, 0)][DBLP]
    ECAI, 2004, pp:1003-1004 [Conf]
  14. Frans Coenen, Paul E. Dunne
    The Verification and Validation of Rulebases Using a Binary Encoded Incidence Matrix Technique. [Citation Graph (0, 0)][DBLP]
    EUROVAV, 1997, pp:43-54 [Conf]
  15. Paul E. Dunne
    Lower bounds on the complexity of 1-time only branching programs. [Citation Graph (0, 0)][DBLP]
    FCT, 1985, pp:90-99 [Conf]
  16. Paul E. Dunne
    Prevarication in Dispute Protocols. [Citation Graph (0, 0)][DBLP]
    ICAIL, 2003, pp:12-21 [Conf]
  17. Sylvie Doutre, Trevor J. M. Bench-Capon, Paul E. Dunne
    Explaining preferences with argument positions. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2005, pp:1560-1561 [Conf]
  18. Paul E. Dunne, Sylvie Doutre, Trevor J. M. Bench-Capon
    Discovering Inconsistency through Examination Dialogues. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2005, pp:1680-1681 [Conf]
  19. Paul E. Dunne, Trevor J. M. Bench-Capon
    Complexity in Value-Based Argument Systems. [Citation Graph (0, 0)][DBLP]
    JELIA, 2004, pp:360-371 [Conf]
  20. Paul E. Dunne, Wiebe van der Hoek
    Representation and Complexity in Boolean Games. [Citation Graph (0, 0)][DBLP]
    JELIA, 2004, pp:347-359 [Conf]
  21. Paul E. Dunne
    On concise encodings of preferred extensions. [Citation Graph (0, 0)][DBLP]
    NMR, 2002, pp:392-398 [Conf]
  22. Paul E. Dunne, Trevor J. M. Bench-Capon
    Coherence in finite argument systems. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2002, v:141, n:1/2, pp:187-203 [Journal]
  23. Paul E. Dunne, Trevor J. M. Bench-Capon
    Two party immediate response disputes: Properties and efficiency. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2003, v:149, n:2, pp:221-250 [Journal]
  24. Paul E. Dunne, Trevor J. M. Bench-Capon
    The Maximum Length of Prime Implicates for Instances of 3-SAT. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1997, v:92, n:1-2, pp:317-329 [Journal]
  25. Paul E. Dunne, Michael Wooldridge, Michael Laurence
    The complexity of contract negotiation. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2005, v:164, n:1-2, pp:23-46 [Journal]
  26. Michael Wooldridge, Paul E. Dunne
    On the computational complexity of qualitative coalitional games. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2004, v:158, n:1, pp:27-73 [Journal]
  27. Michael Wooldridge, Paul E. Dunne
    On the computational complexity of coalitional resource games. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2006, v:170, n:10, pp:835-871 [Journal]
  28. Trevor J. M. Bench-Capon, Sylvie Doutre, Paul E. Dunne
    Audiences in argumentation frameworks. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2007, v:171, n:1, pp:42-71 [Journal]
  29. Paul E. Dunne
    A Value-based Argument Model of Convention Degradation. [Citation Graph (0, 0)][DBLP]
    Artif. Intell. Law, 2005, v:13, n:1, pp:153-188 [Journal]
  30. Trevor J. M. Bench-Capon, Paul E. Dunne
    Argumentation in AI and Law: Editors' Introduction. [Citation Graph (0, 0)][DBLP]
    Artif. Intell. Law, 2005, v:13, n:1, pp:1-8 [Journal]
  31. Michael Wooldridge, Paul E. Dunne
    The complexity of agent design problems: Determinism and history dependence. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2005, v:45, n:3-4, pp:343-371 [Journal]
  32. William Duckworth, Paul E. Dunne, Alan Gibbons, Michele Zito
    Leafy spanning trees in hypercubes. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2001, v:14, n:7, pp:801-804 [Journal]
  33. Colin C. Charlton, Paul E. Dunne, K. Halewood, Paul H. Leng
    An Algorithm to Generate Random Large Combinational Circuits. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1993, v:36, n:2, pp:200-206 [Journal]
  34. Paul E. Dunne
    On Concise Encodings of Preferred Extensions [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  35. Paul E. Dunne, Chris J. Gittings, Paul H. Leng
    Multiprocessor Simulation Strategies with Optimal Speed-up. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:54, n:1, pp:23-33 [Journal]
  36. Paul E. Dunne, Michele Zito
    An Inproved Upper Bound on the Non-3-Colourability Threshold. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:65, n:1, pp:17-23 [Journal]
  37. Paul E. Dunne
    Extremal Behaviour in Multiagent Contract Negotiation. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2005, v:23, n:, pp:41-78 [Journal]
  38. Paul E. Dunne, Trevor J. M. Bench-Capon
    A sharp threshold for the phase transition of a restricted Satisfiability problem for Horn clauses. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2001, v:47, n:1, pp:1-14 [Journal]
  39. Paul E. Dunne
    Ceilings of Monotone Boolean Functions. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1996, v:2, n:7, pp:533-546 [Journal]
  40. Paul E. Dunne, Alan Gibbons
    J.UCS Special Issue on BCTCS. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2000, v:6, n:4, pp:405-406 [Journal]
  41. Paul E. Dunne, Paul H. Leng
    The Average Case Performance of an Algorithm for Demand-Driven Evaluation of Boolean Formulae. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1999, v:5, n:5, pp:288-306 [Journal]
  42. Paul E. Dunne, Alan Gibbons, Michele Zito
    Complexity-theoretic models of phase transitions in search problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:249, n:2, pp:243-263 [Journal]
  43. Michael Wooldridge, Thomas Ågotnes, Paul E. Dunne, Wiebe van der Hoek
    Logic for Automated Mechanism Design - A Progress Report. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:9-0 [Conf]
  44. Paul E. Dunne
    Computational properties of argument systems satisfying graph-theoretic constraints. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2007, v:171, n:10-15, pp:701-729 [Journal]
  45. Trevor J. M. Bench-Capon, Paul E. Dunne
    Argumentation in artificial intelligence. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2007, v:171, n:10-15, pp:619-641 [Journal]

  46. Emotions in Rational Decision Making. [Citation Graph (, )][DBLP]


  47. Cooperative Boolean games. [Citation Graph (, )][DBLP]


  48. Inconsistency tolerance in weighted argument systems. [Citation Graph (, )][DBLP]


  49. Computation in Extended Argumentation Frameworks. [Citation Graph (, )][DBLP]


  50. Computational Properties of Resolution-based Grounded Semantics. [Citation Graph (, )][DBLP]


  51. Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks. [Citation Graph (, )][DBLP]


  52. The Computational Complexity of Ideal Semantics I: Abstract Argumentation Frameworks. [Citation Graph (, )][DBLP]


  53. Asking the right question: forcing commitment in examination dialogues. [Citation Graph (, )][DBLP]


  54. A Methodology for Action-Selection using Value-Based Argumentation. [Citation Graph (, )][DBLP]


  55. Complexity Properties of Restricted Abstract Argument Systems. [Citation Graph (, )][DBLP]


  56. Suspicion of Hidden Agenda in Persuasive Argument. [Citation Graph (, )][DBLP]


  57. Solving coalitional resource games. [Citation Graph (, )][DBLP]


  58. The computational complexity of ideal semantics. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.009secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002