Paul E. S. Dunne
List of publications from the DBLP Bibliography Server - FAQ
2009 | ||
---|---|---|
72 | Paul E. Dunne, Anthony Hunter, Peter McBurney, Simon Parsons, Michael Wooldridge: Inconsistency tolerance in weighted argument systems. AAMAS (2) 2009: 851-858 | |
71 | Pietro Baroni, Paul E. Dunne, Massimiliano Giacomin: Computational Properties of Resolution-based Grounded Semantics. IJCAI 2009: 683-689 | |
2008 | ||
70 | Paul E. Dunne, Wiebe van der Hoek, Sarit Kraus, Michael Wooldridge: Cooperative Boolean games. AAMAS (2) 2008: 1015-1022 | |
69 | Paul E. Dunne: The Computational Complexity of Ideal Semantics I: Abstract Argumentation Frameworks. COMMA 2008: 147-158 | |
68 | Fahd Saud Nawwab, Trevor J. M. Bench-Capon, Paul E. Dunne: A Methodology for Action-Selection using Value-Based Argumentation. COMMA 2008: 264-275 | |
67 | Trevor J. M. Bench-Capon, Sylvie Doutre, Paul E. Dunne: Asking the right question: forcing commitment in examination dialogues. COMMA 2008: 49-60 | |
66 | Paul E. Dunne, Martin Caminada: Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks. JELIA 2008: 153-165 | |
65 | Paul E. Dunne, Yann Chevaleyre: The complexity of deciding reachability properties of distributed negotiation schemes. Theor. Comput. Sci. 396(1-3): 113-144 (2008) | |
2007 | ||
64 | Michael Wooldridge, Thomas Ågotnes, Paul E. Dunne, Wiebe van der Hoek: Logic for Automated Mechanism Design - A Progress Report. AAAI 2007: 9- | |
63 | Trevor J. M. Bench-Capon, Sylvie Doutre, Paul E. Dunne: Audiences in argumentation frameworks. Artif. Intell. 171(1): 42-71 (2007) | |
62 | Trevor J. M. Bench-Capon, Paul E. Dunne: Argumentation in artificial intelligence. Artif. Intell. 171(10-15): 619-641 (2007) | |
61 | Paul E. Dunne: Computational properties of argument systems satisfying graph-theoretic constraints. Artif. Intell. 171(10-15): 701-729 (2007) | |
2006 | ||
60 | Paul E. Dunne, Trevor J. M. Bench-Capon: Computational Models of Argument: Proceedings of COMMA 2006, September 11-12, 2006, Liverpool, UK IOS Press 2006 | |
59 | Michael Wooldridge, Paul E. Dunne, Simon Parsons: On the Complexity of Linking Deductive and Abstract Argument Systems. AAAI 2006 | |
58 | Paul E. Dunne: Suspicion of Hidden Agenda in Persuasive Argument. COMMA 2006: 329-340 | |
57 | Paul E. Dunne: Complexity Properties of Restricted Abstract Argument Systems. COMMA 2006: 85-96 | |
56 | Michael Wooldridge, Paul E. Dunne: On the computational complexity of coalitional resource games. Artif. Intell. 170(10): 835-871 (2006) | |
55 | 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: Issues in Multiagent Resource Allocation. Informatica (Slovenia) 30(1): 3-31 (2006) | |
2005 | ||
54 | Sylvie Doutre, Trevor J. M. Bench-Capon, Paul E. Dunne: Determining Preferences Through Argumentation. AI*IA 2005: 98-109 | |
53 | Paul E. Dunne: Multiagent Resource Allocation in the Presence of Externalities. CEEMAS 2005: 408-417 | |
52 | Sylvie Doutre, Trevor J. M. Bench-Capon, Paul E. Dunne: Explaining preferences with argument positions. IJCAI 2005: 1560-1561 | |
51 | Paul E. Dunne, Sylvie Doutre, Trevor J. M. Bench-Capon: Discovering Inconsistency through Examination Dialogues. IJCAI 2005: 1680-1681 | |
50 | Michael Wooldridge, Paul E. Dunne: The complexity of agent design problems: Determinism and history dependence. Ann. Math. Artif. Intell. 45(3-4): 343-371 (2005) | |
49 | Paul E. Dunne, Michael Wooldridge, Michael Laurence: The complexity of contract negotiation. Artif. Intell. 164(1-2): 23-46 (2005) | |
48 | Trevor J. M. Bench-Capon, Paul E. Dunne: Argumentation in AI and Law: Editors' Introduction. Artif. Intell. Law 13(1): 1-8 (2005) | |
47 | Paul E. Dunne: A Value-based Argument Model of Convention Degradation. Artif. Intell. Law 13(1): 153-188 (2005) | |
46 | Paul E. Dunne: Extremal Behaviour in Multiagent Contract Negotiation. J. Artif. Intell. Res. (JAIR) 23: 41-78 (2005) | |
45 | Yann Chevaleyre, Paul E. Dunne, Ulle Endriss, Jérôme Lang, Nicolas Maudet, Juan A. Rodríguez-Aguilar: Multiagent resource allocation. Knowledge Eng. Review 20(2): 143-149 (2005) | |
2004 | ||
44 | Paul E. Dunne, Trevor J. M. Bench-Capon: Identifying Audience Preferences in Legal and Social Domains. DEXA 2004: 518-527 | |
43 | Paul E. Dunne: Context Dependence in Multiagent Resource Allocation. ECAI 2004: 1001-1002 | |
42 | Paul E. Dunne, Michael Laurence, Michael Wooldridge: Tractability Results for Automatic Contracting. ECAI 2004: 1003-1004 | |
41 | Paul E. Dunne, Wiebe van der Hoek: Representation and Complexity in Boolean Games. JELIA 2004: 347-359 | |
40 | Paul E. Dunne, Trevor J. M. Bench-Capon: Complexity in Value-Based Argument Systems. JELIA 2004: 360-371 | |
39 | Michael Wooldridge, Paul E. Dunne: On the computational complexity of qualitative coalitional games. Artif. Intell. 158(1): 27-73 (2004) | |
2003 | ||
38 | Paul E. Dunne, Peter McBurney: Optimal utterances in dialogue protocols. AAMAS 2003: 608-615 | |
37 | Paul E. Dunne: Prevarication in Dispute Protocols. ICAIL 2003: 12-21 | |
36 | Paul E. Dunne, Peter McBurney: Concepts of Optimal Utterance in Dialogue: Selection and Complexity. Workshop on Agent Communication Languages 2003: 310-328 | |
35 | Paul E. Dunne, Trevor J. M. Bench-Capon: Two party immediate response disputes: Properties and efficiency. Artif. Intell. 149(2): 221-250 (2003) | |
2002 | ||
34 | Trevor J. M. Bench-Capon, Paul E. Dunne: No agent is an island: a framework for the study of inter-agent behavior. AAMAS 2002: 690-691 | |
33 | Paul E. Dunne, Michael Wooldridge, Michael Laurence: The computational complexity of boolean and stochastic agent design problems. AAMAS 2002: 976-983 | |
32 | Paul E. Dunne: On concise encodings of preferred extensions. NMR 2002: 392-398 | |
31 | Paul E. Dunne, Trevor J. M. Bench-Capon: Coherence in finite argument systems. Artif. Intell. 141(1/2): 187-203 (2002) | |
30 | Paul E. Dunne: On Concise Encodings of Preferred Extensions CoRR cs.AI/0207024: (2002) | |
29 | Paul E. Dunne, Paul H. Leng, Gerald F. Nwana: Demand-driven logic simulation using a network of loosely coupled processors. Journal of Systems Architecture 47(14-15): 1117-1128 (2002) | |
2001 | ||
28 | Michael Wooldridge, Paul E. Dunne: The Computational Complexity of Agent Verification. ATAL 2001: 115-127 | |
27 | William Duckworth, Paul E. Dunne, Alan Gibbons, Michele Zito: Leafy spanning trees in hypercubes. Appl. Math. Lett. 14(7): 801-804 (2001) | |
26 | Paul E. Dunne, Trevor J. M. Bench-Capon: A sharp threshold for the phase transition of a restricted Satisfiability problem for Horn clauses. J. Log. Algebr. Program. 47(1): 1-14 (2001) | |
2000 | ||
25 | Michael Wooldridge, Paul E. Dunne: Optimistic and Disjunctive Agent Design Problems. ATAL 2000: 1-14 | |
24 | Paul E. Dunne, Alan Gibbons: J.UCS Special Issue on BCTCS. J. UCS 6(4): 405-406 (2000) | |
23 | Paul E. Dunne, Alan Gibbons, Michele Zito: Complexity-theoretic models of phase transitions in search problems. Theor. Comput. Sci. 249(2): 243-263 (2000) | |
1999 | ||
22 | Paul E. Dunne, Paul H. Leng: The Average Case Performance of an Algorithm for Demand-Driven Evaluation of Boolean Formulae. J. UCS 5(5): 288-306 (1999) | |
1998 | ||
21 | Paul E. Dunne, Michele Zito: An Inproved Upper Bound on the Non-3-Colourability Threshold. Inf. Process. Lett. 65(1): 17-23 (1998) | |
1997 | ||
20 | Martyn Amos, Alan Gibbons, Paul E. Dunne: The Complexity and Viability of DNA Computations. BCEC 1997: 165-173 | |
19 | Frans Coenen, Paul E. Dunne: The Verification and Validation of Rulebases Using a Binary Encoded Incidence Matrix Technique. EUROVAV 1997: 43-54 | |
18 | Paul E. Dunne, Trevor J. M. Bench-Capon: The Maximum Length of Prime Implicates for Instances of 3-SAT. Artif. Intell. 92(1-2): 317-329 (1997) | |
1996 | ||
17 | Paul E. Dunne: Ceilings of Monotone Boolean Functions. J. UCS 2(7): 533-546 (1996) | |
1995 | ||
16 | Paul E. S. Dunne, Paul H. Leng, Gerald F. Nwana: On the Complexity of Boolean Functions Computed by Lazy Oracles. IEEE Trans. Computers 44(4): 495-502 (1995) | |
15 | Paul E. Dunne, Chris J. Gittings, Paul H. Leng: Multiprocessor Simulation Strategies with Optimal Speed-up. Inf. Process. Lett. 54(1): 23-33 (1995) | |
1994 | ||
14 | Colin C. Charlton, Paul E. Dunne, Paul H. Leng, Janet Little, M. R. Woodward: Distributing quality-controlled software via the internet. Microprocessing and Microprogramming 40(10-12): 861-864 (1994) | |
1993 | ||
13 | Geof Staniford, Trevor J. M. Bench-Capon, Paul E. S. Dunne: Cooperative Dialogues with the Support of Autonomous Agents. CoopIS 1993: 144-151 | |
12 | Trevor J. M. Bench-Capon, Paul E. S. Dunne, Geof Staniford: Linearisation Schemata for Hypertext. DEXA 1993: 697-708 | |
11 | Colin C. Charlton, Paul E. Dunne, K. Halewood, Paul H. Leng: An Algorithm to Generate Random Large Combinational Circuits. Comput. J. 36(2): 200-206 (1993) | |
10 | Paul E. Dunne, Chris J. J. Gittings, Paul H. Leng: Sequential and parallel strategies for the demand-driven simulation of logic circuits. Microprocessing and Microprogramming 38(1-5): 519-525 (1993) | |
1992 | ||
9 | Trevor J. M. Bench-Capon, Paul E. S. Dunne, Geof Staniford: Linearising Hypertext through Target Graph Specifications. DEXA 1992: 173-178 | |
1990 | ||
8 | Trevor J. M. Bench-Capon, Paul E. S. Dunne: An Approach to the Integration of Legal Support Systems. DEXA 1990: 105-111 | |
7 | Paul E. S. Dunne: Comment on Kochol's Paper ``Efficient Monotone Circuits for Threshold Functions''. Inf. Process. Lett. 34(5): 221-222 (1990) | |
1989 | ||
6 | Paul E. S. Dunne: On Monotone Simulations of Nonmonotone Networks. Theor. Comput. Sci. 66(1): 15-25 (1989) | |
1988 | ||
5 | Trevor J. M. Bench-Capon, Paul E. S. Dunne: Some Computational Properties of a Model for Electronic Documents. Electronic Publishing 2(4): 231-256 (1988) | |
1987 | ||
4 | Paul E. S. Dunne: A Result on k -Valent Graphs and Its Application to a Graph Embedding Problem. Acta Inf. 24(4): 447-459 (1987) | |
1986 | ||
3 | Paul E. S. Dunne: The Complexity of Central Slice Functions. Theor. Comput. Sci. 44: 247-257 (1986) | |
1985 | ||
2 | Paul E. Dunne: Lower bounds on the complexity of 1-time only branching programs. FCT 1985: 90-99 | |
1 | Paul E. S. Dunne: A 2.5n Lower Bound on the Monotone Network Complexity of T_3^n. Acta Inf. 22(2): 229-240 (1985) |