Publications

Filter publications

What type of publication do you want to show?

All

Journals

Conference papers

Chapters

Books

Other

2024

A tribute to Trevor Bench-Capon (1953–2024)

A tribute to Trevor Bench-Capon (1953–2024) (2024). Argument & Computation, 15(2), 109-112. doi:10.3233/aac-241521

DOI: 10.3233/aac-241521
: Journal article

Decidability in argumentation semantics

Dunne, P. E. (2024). Decidability in argumentation semantics. Argument & Computation, 15(2), 191-204. doi:10.3233/aac-220020

DOI: 10.3233/aac-220020
: Journal article

2022

Well, to Be Honest, I Wouldnt Start from Here at All

Dunne, P. E. (2022). Well, to Be Honest, I Wouldnt Start from Here at All. IOS Press. doi:10.3233/faia220134

DOI: 10.3233/faia220134
: Conference Paper

2021

Computing Grounded Extensions Of Abstract Argumentation Frameworks

Nofal, S., Atkinson, K., & Dunne, P. E. (2021). Computing Grounded Extensions Of Abstract Argumentation Frameworks. COMPUTER JOURNAL, 64(1), 54-63. doi:10.1093/comjnl/bxz138

DOI: 10.1093/comjnl/bxz138
: Journal article

2020

Characterizing strongly admissible sets

Dunne, P. E. (2020). Characterizing strongly admissible sets. ARGUMENT & COMPUTATION, 11(3), 239-255. doi:10.3233/AAC-200483

DOI: 10.3233/AAC-200483
: Journal article

Minimal Strong Admissibility: A Complexity Analysis

Caminada, M., & Dunne, P. E. (2020). Minimal Strong Admissibility: A Complexity Analysis. In COMPUTATIONAL MODELS OF ARGUMENT (COMMA 2020) Vol. 326 (pp. 135-146). doi:10.3233/FAIA200499

DOI: 10.3233/FAIA200499
: Conference Paper

Delegating Decisions in Strategic Settings

Dunne, P. E., Harrenstein, P., Kraus, S., & Wooldridge, M. (2020). Delegating Decisions in Strategic Settings. IEEE Transactions on Artificial Intelligence, 1(1), 19-33. doi:10.1109/tai.2020.3031545

DOI: 10.1109/tai.2020.3031545
: Journal article

Strong admissibility revisited: Theory and applications

Caminada, M., & Dunne, P. (2019). Strong admissibility revisited: Theory and applications. ARGUMENT & COMPUTATION, 10(3), 277-300. doi:10.3233/AAC-190463

DOI: 10.3233/AAC-190463
: Journal article

2019

On checking skeptical and ideal admissibility in abstract argumentation frameworks

Nofal, S., Atkinson, K., & Dunne, P. E. (2019). On checking skeptical and ideal admissibility in abstract argumentation frameworks. INFORMATION PROCESSING LETTERS, 148, 7-12. doi:10.1016/j.ipl.2019.03.013

DOI: 10.1016/j.ipl.2019.03.013
: Journal article

Computation counts - an Introduction to Analytic Concepts in Computer Science (Invited Book Introduction)

Dunne, P. E. (2019). Computation counts - an Introduction to Analytic Concepts in Computer Science (Invited Book Introduction). K. Iwama (Ed.), (Vol. 128, pp. 142-149). European Association for TCS. Retrieved from http://bulletin.eatcs.org/index.php/beatcs/index

: Other

Computation Counts - An Introduction to Analytic Concepts in Computer Science

Dunne, P. E. (2019). Computation Counts - An Introduction to Analytic Concepts in Computer Science (Vol. 23, Paperback ed.). United Kingdom: College Publications. Retrieved from https://www.collegepublications.co.uk/

: Book

A New Labelling Algorithm for Generating Preferred Extensions of Abstract Argumentation Frameworks

Nofal, S., Atkinson, K., Dunne, P. E., & Hababeh, I. (2019). A New Labelling Algorithm for Generating Preferred Extensions of Abstract Argumentation Frameworks. In PROCEEDINGS OF THE 21ST INTERNATIONAL CONFERENCE ON ENTERPRISE INFORMATION SYSTEMS (ICEIS), VOL 1 (pp. 340-348). doi:10.5220/0007737503400348

DOI: 10.5220/0007737503400348
: Conference Paper

Computation Counts - An Introduction to Analytic Concepts in Computer Science

Spirakis, P., & Dunne, P. E. (2019). Computation Counts - An Introduction to Analytic Concepts in Computer Science. BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, (128), 141-149. Retrieved from https://www.webofscience.com/

: Journal article

On Deciding Admissibility in Abstract Argumentation Frameworks

Nofal, S., Atkinson, K., & Dunne, P. E. (2019). On Deciding Admissibility in Abstract Argumentation Frameworks. In KEOD: PROCEEDINGS OF THE 11TH INTERNATIONAL JOINT CONFERENCE ON KNOWLEDGE DISCOVERY, KNOWLEDGE ENGINEERING AND KNOWLEDGE MANAGEMENT - VOL 2: KEOD (pp. 67-75). doi:10.5220/0008064300670075

DOI: 10.5220/0008064300670075
: Conference Paper

2018

Automata for Infinite Argumentation Structures

DOI: 10.48550/arxiv.1810.04892
: Preprint

Unconscious Patterns in Argument: Fractal Dimension in Oratory

Dunne, P. E. (2018). Unconscious Patterns in Argument: Fractal Dimension in Oratory. In COMPUTATIONAL MODELS OF ARGUMENT (COMMA 2018) Vol. 305 (pp. 301-312). doi:10.3233/978-1-61499-906-5-301

DOI: 10.3233/978-1-61499-906-5-301
: Conference Paper

2017

COMPUTATIONAL PROBLEMS IN FORMAL ARGUMENTATION AND THEIR COMPLEXITY

Dvorak, W., & Dunne, P. E. (2017). COMPUTATIONAL PROBLEMS IN FORMAL ARGUMENTATION AND THEIR COMPLEXITY. JOURNAL OF APPLIED LOGICS-IFCOLOG JOURNAL OF LOGICS AND THEIR APPLICATIONS, 4(8), 2557-2622. Retrieved from https://www.webofscience.com/

: Journal article

2016

Looking-ahead in backtracking algorithms for abstract argumentation

Nofal, S., Atkinson, K. M., & Dunne, P. E. (2016). Looking-ahead in backtracking algorithms for abstract argumentation. International Journal of Approximate Reasoning, 78, 265-282. doi:10.1016/j.ijar.2016.07.013

DOI: 10.1016/j.ijar.2016.07.013
: Journal article

Investigating the Relationship between Argumentation Semantics via Signatures

Dunne, P. E., Linsbichler, T., Spanring, C., & Woltran, S. (2016). Investigating the Relationship between Argumentation Semantics via Signatures. In IJCAI'16: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (pp. 1051-1057). New York, USA. doi:10.5555/3060621.3060767

DOI: 10.5555/3060621.3060767
: Conference Paper

A Synergy Coalition Group based Dynamic Programming Algorithm for Coalition Formation

Riley, L., Atkinson, K., Dunne, P., & Payne, T. (2016). A Synergy Coalition Group based Dynamic Programming Algorithm for Coalition Formation. In 2016 International Conference on Autonomous Agents & Multiagent Systems (pp. 588). Singapore.

: Conference Paper

Forbidden Sets in Argumentation Semantics

Dunne, P. E. (2016). Forbidden Sets in Argumentation Semantics. In COMPUTATIONAL MODELS OF ARGUMENT Vol. 287 (pp. 275-286). doi:10.3233/978-1-61499-686-6-275

DOI: 10.3233/978-1-61499-686-6-275
: Conference Paper

I Heard You the First Time: Debate in Cacophonous Surroundings

Dunne, P. E. (2016). I Heard You the First Time: Debate in Cacophonous Surroundings. In COMPUTATIONAL MODELS OF ARGUMENT Vol. 287 (pp. 287-298). doi:10.3233/978-1-61499-686-6-287

DOI: 10.3233/978-1-61499-686-6-287
: Conference Paper

Investigating the Relationship between Argumentation Semantics via Signatures

Dunne, P. E., Linsbichler, T., Spanring, C., & Woltran, S. (2016). Investigating the Relationship between Argumentation Semantics via Signatures. In KI 2016: ADVANCES IN ARTIFICIAL INTELLIGENCE Vol. 9904 (pp. 271-277). Retrieved from https://www.webofscience.com/

: Conference Paper

Spectral Techniques in Argumentation Framework Analysis

Butterworth, J., & Dunne, P. E. (2016). Spectral Techniques in Argumentation Framework Analysis. In COMPUTATIONAL MODELS OF ARGUMENT Vol. 287 (pp. 167-178). doi:10.3233/978-1-61499-686-6-167

DOI: 10.3233/978-1-61499-686-6-167
: Conference Paper

2015

Characteristics of multiple viewpoints in abstract argumentation

Dunne, P. E., Dvorak, W., Linsbichler, T., & Woltran, S. (2015). Characteristics of multiple viewpoints in abstract argumentation. ARTIFICIAL INTELLIGENCE, 228, 153-178. doi:10.1016/j.artint.2015.07.006

DOI: 10.1016/j.artint.2015.07.006
: Journal article

Distributing Coalition Value Calculations to Coalition Members

Riley, L., Atkinson, K., Dunne, P., & Payne, T. (2015). Distributing Coalition Value Calculations to Coalition Members. In 29th AAAI Conference on Artificial Intelligence (AAAI-15) (pp. 2117). Austin, Texas.

: Conference Paper

JUSTICE AND THE HOLOCAUST

Dunne, P. E. (2015). JUSTICE AND THE HOLOCAUST. SIGHT AND SOUND, 25(3), 111. Retrieved from https://www.webofscience.com/

: Journal article

Senses of ‘argument’ in instantiated argumentation frameworks†

Wyner, A., Bench-Capon, T., Dunne, P., & Cerutti, F. (2015). Senses of ‘argument’ in instantiated argumentation frameworks†. Argument & Computation, 6(1), 50-72. doi:10.1080/19462166.2014.1002535

DOI: 10.1080/19462166.2014.1002535
: Journal article

2014

Algorithms for argumentation semantics: labeling attacks as a generalization of labeling arguments

Nofal, S., Atkinson, K., & Dunne, P. E. (2014). Algorithms for argumentation semantics: labeling attacks as a generalization of labeling arguments. Journal of Artificial Intelligence Research, 49, 635-668. doi:10.1613/jair.4308

DOI: 10.1613/jair.4308
: Journal article

Algorithms for decision problems in argument systems under preferred semantics

Nofal, S., Atkinson, K., & Dunne, P. E. (2014). Algorithms for decision problems in argument systems under preferred semantics. Artificial Intelligence, 207, 22-51.

: Journal article

Algorithms for decision problems in argument systems under preferred semantics

Nofal, S., Atkinson, K., & Dunne, P. E. (2014). Algorithms for decision problems in argument systems under preferred semantics. ARTIFICIAL INTELLIGENCE, 207, 23-51. doi:10.1016/j.artint.2013.11.001

DOI: 10.1016/j.artint.2013.11.001
: Journal article

Characteristics of Multiple Viewpoints in Abstract Argumentation

Dunne, P. E., Dvorak, W., Linsbichler, T., & Woltran, S. (2014). Characteristics of Multiple Viewpoints in Abstract Argumentation. In FOURTEENTH INTERNATIONAL CONFERENCE ON THE PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING (pp. 72-81). Retrieved from https://www.webofscience.com/

: Conference Paper

Complexity Properties of Critical Sets of Arguments

Booth, R., Caminada, M., Dunne, P. E., Podlaszewski, M., & Rahwan, I. (2014). Complexity Properties of Critical Sets of Arguments. In COMPUTATIONAL MODELS OF ARGUMENT Vol. 266 (pp. 173-184). doi:10.3233/978-1-61499-436-7-173

DOI: 10.3233/978-1-61499-436-7-173
: Conference Paper

Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach

Cerutti, F., Dunne, P. E., Giacomin, M., & Vallati, M. (2014). Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach. In Unknown Conference (pp. 176-193). Springer Berlin Heidelberg. doi:10.1007/978-3-642-54373-9_12

DOI: 10.1007/978-3-642-54373-9_12
: Conference Paper

Properties of Random VAFs and Implications for Efficient Algorithms

Dunne, P. E., & Atkinson, K. (2014). Properties of Random VAFs and Implications for Efficient Algorithms. In COMPUTATIONAL MODELS OF ARGUMENT Vol. 266 (pp. 261-268). doi:10.3233/978-1-61499-436-7-261

DOI: 10.3233/978-1-61499-436-7-261
: Conference Paper

Properties of random VAFs and implications for efficient algorithms

Atkinson, K., & Dunne, P. E. (2014). Properties of random VAFs and implications for efficient algorithms. In Fifth International Conference on Computational Models of Argument (COMMA 2014) (pp. In press). Amsterdam: IOS Press.

: Conference Paper

2013

On the Instantiation of Knowledge Bases in Abstract Argumentation Frameworks

Wyner, A., Bench-Capon, T., & Dunne, P. (2013). On the Instantiation of Knowledge Bases in Abstract Argumentation Frameworks. In COMPUTATIONAL LOGIC IN MULTI-AGENT SYSTEMS, CLIMA XIV Vol. 8143 (pp. 34-50). Retrieved from https://www.webofscience.com/

: Conference Paper

Computing Preferred Extensions in Abstract Argumentation: a SAT-based Approach

DOI: 10.48550/arxiv.1310.4986
: Preprint

Parametric properties of ideal semantics

Dunne, P. E., Dvorak, W., & Woltran, S. (2013). Parametric properties of ideal semantics. ARTIFICIAL INTELLIGENCE, 202, 1-28. doi:10.1016/j.artint.2013.06.004

DOI: 10.1016/j.artint.2013.06.004
: Journal article

Algorithms for acceptance in argument systems

Nofal, S., Dunne, P., & Atkinson, K. (2013). Algorithms for acceptance in argument systems. In ICAART 2013 - Proceedings of the 5th International Conference on Agents and Artificial Intelligence Vol. 2 (pp. 34-43).

: Conference Paper

A SAT-based Approach for Computing Extensions in Abstract Argumentation

Cerutti, F., Dunne, P. E., Giacomin, M., & Vallati, M. (2013). A SAT-based Approach for Computing Extensions in Abstract Argumentation. In TAFA. -: Springer.

: Conference Paper

Automata for infinite argumentation structures

Baroni, P., Cerutti, F., Dunne, P. E., & Giacomin, M. (2013). Automata for infinite argumentation structures. ARTIFICIAL INTELLIGENCE, 203, 104-150. doi:10.1016/j.artint.2013.05.002

DOI: 10.1016/j.artint.2013.05.002
: Journal article

2012

Semi-stable semantics

Caminada, M. W. A., Carnielli, W. A., & Dunne, P. E. (2012). Semi-stable semantics. JOURNAL OF LOGIC AND COMPUTATION, 22(5), 1207-1254. doi:10.1093/logcom/exr033

DOI: 10.1093/logcom/exr033
: Journal article

Towards average-case algorithms for abstract argumentation

Nofal, S., Dunne, P., & Atkinson, K. (2012). Towards average-case algorithms for abstract argumentation. In ICAART 2012 - Proceedings of the 4th International Conference on Agents and Artificial Intelligence Vol. 1 (pp. 225-230).

: Conference Paper

Irrationality in Persuasive Argumentation

Dunne, P. E. (2012). Irrationality in Persuasive Argumentation. In Lecture Notes in Computer Science (pp. 234-248). Springer Berlin Heidelberg. doi:10.1007/978-3-642-29414-3_13

DOI: 10.1007/978-3-642-29414-3_13
: Chapter

Computing with Infinite Argumentation Frameworks: The Case of AFRAs

Baroni, P., Cerutti, F., Dunne, P. E., & Giacomin, M. (2012). Computing with Infinite Argumentation Frameworks: The Case of AFRAs. In Unknown Conference (pp. 197-214). Springer Berlin Heidelberg. doi:10.1007/978-3-642-29184-5_13

DOI: 10.1007/978-3-642-29184-5_13
: Conference Paper

Argument aggregation: Basic axioms and complexity results

Dunne, P. E., Marquis, P., & Wooldridge, M. (2012). Argument aggregation: Basic axioms and complexity results. In Frontiers in Artificial Intelligence and Applications Vol. 245 (pp. 129-140). doi:10.3233/978-1-61499-111-3-129

DOI: 10.3233/978-1-61499-111-3-129
: Conference Paper

On preferred extension enumeration in abstract argumentation

Nofal, S., Dunne, P., & Atkinson, K. (2012). On preferred extension enumeration in abstract argumentation. In Frontiers in Artificial Intelligence and Applications Vol. 245 (pp. 205-216). doi:10.3233/978-1-61499-111-3-205

DOI: 10.3233/978-1-61499-111-3-205
: Conference Paper

Towards experimental algorithms for abstract argumentation

Nofal, S., Dunne, P., & Atkinson, K. (2012). Towards experimental algorithms for abstract argumentation. In Frontiers in Artificial Intelligence and Applications Vol. 245 (pp. 217-228). doi:10.3233/978-1-61499-111-3-217

DOI: 10.3233/978-1-61499-111-3-217
: Conference Paper

Towards tractable Boolean Games

Dunne, P. E., & Wooldridge, M. (2012). Towards tractable Boolean Games. In 11th International Conference on Autonomous Agents and Multiagent Systems 2012, AAMAS 2012: Innovative Applications Track Vol. 2 (pp. 1040-1047).

: Conference Paper

Towards tractable Boolean games

Dunne, P. E., & Wooldridge, M. (2012). Towards tractable Boolean games. In Eleventh International Conference on Autonomous Agents and Multiagent Systems (pp. 939-946). Valencia: -.

: Conference Paper

Uniform Argumentation Frameworks

Atkinson, K., Bench-Capon, T., & Dunne, P. E. (2012). Uniform Argumentation Frameworks. In Computational Models of Argument Vol. 245 (pp. 165-176). doi:10.3233/978-1-61499-111-3-165

DOI: 10.3233/978-1-61499-111-3-165
: Conference Paper

2011

Parametric properties of ideal semantics

Dvořák, W., Dunne, P. E., & Woltran, S. (2011). Parametric properties of ideal semantics. In IJCAI International Joint Conference on Artificial Intelligence (pp. 851-856). doi:10.5591/978-1-57735-516-8/IJCAI11-148

DOI: 10.5591/978-1-57735-516-8/IJCAI11-148
: Conference Paper

Relating the semantics of abstract dialectical frameworks and standard AFs

Brewka, G., Dunne, P. E., & Woltran, S. (2011). Relating the semantics of abstract dialectical frameworks and standard AFs. In IJCAI International Joint Conference on Artificial Intelligence (pp. 780-785). doi:10.5591/978-1-57735-516-8/IJCAI11-137

DOI: 10.5591/978-1-57735-516-8/IJCAI11-137
: Conference Paper

Extremal Behaviour in Multiagent Contract Negotiation

DOI: 10.48550/arxiv.1109.2129
: Preprint

On Constructing Minimal Formulae

Dunne, P. E. (2011). On Constructing Minimal Formulae. COMPUTER JOURNAL, 54(7), 1067-1075. doi:10.1093/comjnl/bxq050

DOI: 10.1093/comjnl/bxq050
: Journal article

On the resolution-based family of abstract argumentation semantics and its grounded instance

Baroni, P., Dunne, P. E., & Giacomin, M. (2011). On the resolution-based family of abstract argumentation semantics and its grounded instance. ARTIFICIAL INTELLIGENCE, 175(3-4), 791-813. doi:10.1016/j.artint.2010.11.005

DOI: 10.1016/j.artint.2010.11.005
: Journal article

Weighted argument systems: Basic definitions, algorithms, and complexity results

Dunne, P. E., Hunter, A., McBurney, P., Parsons, S., & Wooldridge, M. (2011). Weighted argument systems: Basic definitions, algorithms, and complexity results. ARTIFICIAL INTELLIGENCE, 175(2), 457-486. doi:10.1016/j.artint.2010.09.005

DOI: 10.1016/j.artint.2010.09.005
: Journal article

2010

Emotions in Rational Decision Making

Nawwab, F. S., Bench-Capon, T., & Dunne, P. E. (2010). Emotions in Rational Decision Making. In ARGUMENTATION IN MULTI-AGENT SYSTEMS Vol. 6057 (pp. 273-291). Retrieved from https://www.webofscience.com/

: Conference Paper

Computation in Extended Argumentation Frameworks

Dunne, P. E., Modgil, S., & Bench-Capon, T. (2010). Computation in Extended Argumentation Frameworks. In ECAI 2010 - 19TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE Vol. 215 (pp. 119-124). doi:10.3233/978-1-60750-606-5-119

DOI: 10.3233/978-1-60750-606-5-119
: Conference Paper

Computation with varied-strength attacks in abstract argumentation frameworks

Dunne, P. E., Martínez, D. C., García, A. J., & Simari, G. R. (2010). Computation with varied-strength attacks in abstract argumentation frameworks. In Frontiers in Artificial Intelligence and Applications Vol. 216 (pp. 207-218). doi:10.3233/978-1-60750-619-5-207

DOI: 10.3233/978-1-60750-619-5-207
: Conference Paper

Exploring the Role of Emotions in Rational Decision Making

Nawwab, F. S., Dunne, P. E., & Bench-Capon, T. (2010). Exploring the Role of Emotions in Rational Decision Making. In COMPUTATIONAL MODELS OF ARGUMENT: PROCEEDINGS OF COMMA 2010 Vol. 216 (pp. 367-378). doi:10.3233/978-1-60750-619-5-367

DOI: 10.3233/978-1-60750-619-5-367
: Conference Paper

Formal properties of argumentation and negotiation frameworks

Dunne, P. E. (2010). Formal properties of argumentation and negotiation frameworks. (PhD Thesis, Edinburgh University).

: Thesis / Dissertation

On extension counting problems in argumentation frameworks

Baroni, P., Dunne, P. E., & Giacomin, M. (2010). On extension counting problems in argumentation frameworks. In Frontiers in Artificial Intelligence and Applications Vol. 216 (pp. 63-74). doi:10.3233/978-1-60750-619-5-63

DOI: 10.3233/978-1-60750-619-5-63
: Conference Paper

Solving coalitional resource games

Dunne, P. E., Kraus, S., Manisterski, E., & Wooldridge, M. (2010). Solving coalitional resource games. ARTIFICIAL INTELLIGENCE, 174(1), 20-50. doi:10.1016/j.artint.2009.09.005

DOI: 10.1016/j.artint.2009.09.005
: Journal article

Tractability in value-based argumentation

Dunne, P. E. (2010). Tractability in value-based argumentation. In Frontiers in Artificial Intelligence and Applications Vol. 216 (pp. 195-206). doi:10.3233/978-1-60750-619-5-195

DOI: 10.3233/978-1-60750-619-5-195
: Conference Paper

2009

Complexity of Abstract Argumentation

Dunne, P. E., & Wooldridge, M. (2009). Complexity of Abstract Argumentation. In ARGUMENTATION IN ARTIFICIAL INTELLIGENCE (pp. 85-104). doi:10.1007/978-0-387-98197-0_5

DOI: 10.1007/978-0-387-98197-0_5
: Chapter

Instantiating knowledge bases in abstract argumentation frameworks

Wyner, A., Bench-Capon, T., & Dunne, P. (2009). Instantiating knowledge bases in abstract argumentation frameworks. In AAAI Fall Symposium - Technical Report Vol. FS-09-06 (pp. 76-83).

: Conference Paper

The computational complexity of ideal semantics

Dunne, P. E. (2009). The computational complexity of ideal semantics. ARTIFICIAL INTELLIGENCE, 173(18), 1559-1591. doi:10.1016/j.artint.2009.09.001

DOI: 10.1016/j.artint.2009.09.001
: Journal article

Computational properties of resolution-based grounded semantics

Baroni, P., Dunne, P. E., & Giacomin, M. (2009). Computational properties of resolution-based grounded semantics. In IJCAI International Joint Conference on Artificial Intelligence (pp. 683-689).

: Conference Paper

Inconsistency tolerance in weighted argument systems

Dunne, P. E., Hunter, A., McBurney, P., Parsons, S., & Wooldridge, M. (2009). Inconsistency tolerance in weighted argument systems. In AAMAS09 (pp. 851-858). Budapest: IFAAMAS.

: Conference Paper

Inconsistency tolerance in weighted argument systems

Dunne, P. E., Parsons, S., Hunter, A., McBurney, P., & Wooldridge, M. (2009). Inconsistency tolerance in weighted argument systems. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS Vol. 1 (pp. 616-623).

: Conference Paper

2008

Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks

Dunne, P. E., & Caminada, M. (n.d.). Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks. In Unknown Conference (pp. 153-165). Springer Berlin Heidelberg. doi:10.1007/978-3-540-87803-2_14

DOI: 10.1007/978-3-540-87803-2_14
: Conference Paper

The complexity of deciding reachability properties of distributed negotiation schemes

Dunne, P. E., & Chevaleyre, Y. (2008). The complexity of deciding reachability properties of distributed negotiation schemes. THEORETICAL COMPUTER SCIENCE, 396(1-3), 113-144. doi:10.1016/j.tcs.2008.01.031

DOI: 10.1016/j.tcs.2008.01.031
: Journal article

A Methodology for Action-Selection using Value-Based Argumentation

Nawwab, F. S., Bench-Capon, T., & Dunne, P. E. (2008). A Methodology for Action-Selection using Value-Based Argumentation. In COMPUTATIONAL MODELS OF ARGUMENT, PROCEEDINGS OF COMMA 2008 Vol. 172 (pp. 264-275). Retrieved from https://www.webofscience.com/

: Conference Paper

Asking the Right Question: Forcing Commitment in Examination Dialogues

Bench-Capon, T. J. M., Doutre, S., & Dunne, P. E. (2008). Asking the Right Question: Forcing Commitment in Examination Dialogues. In COMPUTATIONAL MODELS OF ARGUMENT, PROCEEDINGS OF COMMA 2008 Vol. 172 (pp. 49-+). Retrieved from https://www.webofscience.com/

: Conference Paper

Cooperative Boolean Games

Dunne, P. E., Kraus, S., van der Hoek, W., & Wooldridge, M. (2008). Cooperative Boolean Games. In 7th Int. Conf. on Autonomous Agents and Multiagent Systems (pp. 1015-1022). Estoril: IFAAMAS.

: Conference Paper

Cooperative boolean games

Dunne, P. E., Van Der Hoek, W., Kraus, S., & Wooldridge, M. (2008). Cooperative boolean hames. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS Vol. 2 (pp. 997-1004).

: Conference Paper

The computational complexity of ideal semantics I: Abstract argumentation frameworks

Dunne, P. E. (2008). The computational complexity of ideal semantics I: Abstract argumentation frameworks. In Frontiers in Artificial Intelligence and Applications Vol. 172 (pp. 147-158).

: Conference Paper

2007

A logical characterisation of qualitative coalitional games

Dunne, P. E., van der Hoek, W., & Wooldridge, M. (2007). A logical characterisation of qualitative coalitional games. Journal of Applied Non-Classical Logics, 17(4), 477-509. doi:10.3166/jancl.17.477-509

DOI: 10.3166/jancl.17.477-509
: Journal article

Logic for automated mechanism design - A progress report

Wooldridge, M., Agotnes, T., Dunne, P. E., & Van Der Hoek, W. (2007). Logic for automated mechanism design - A progress report. In Proceedings of the National Conference on Artificial Intelligence Vol. 1 (pp. 9-17).

: Conference Paper

Argumentation in artificial intelligence

Bench-Capon, T. J. M., & Dunne, P. E. (2007). Argumentation in artificial intelligence. ARTIFICIAL INTELLIGENCE, 171(10-15), 619-641. doi:10.1016/j.artint.2007.05.001

DOI: 10.1016/j.artint.2007.05.001
: Journal article

Computational properties of argument systems satisfying graph-theoretic constraints

Dunne, P. E. (2007). Computational properties of argument systems satisfying graph-theoretic constraints. ARTIFICIAL INTELLIGENCE, 171(10-15), 701-729. doi:10.1016/j.artint.2007.03.006

DOI: 10.1016/j.artint.2007.03.006
: Journal article

Artificial Inteligence

Dunne, P. E., & Bench-Capon, T. (Eds.) (2007). Artificial Inteligence (Vol. 171). Elsevier.

: Edited special journal issue

Audiences in argumentation frameworks

Bench-Capon, T. J. M., Doutre, S., & Dunne, P. E. (2007). Audiences in argumentation frameworks. ARTIFICIAL INTELLIGENCE, 171(1), 42-71. doi:10.1016/j.artint.2006.10.013

DOI: 10.1016/j.artint.2006.10.013
: Journal article

Logic for Automated Mechanism Design - A Progress Report

Wooldridge, M., Agotnes, T., Dunne, P. E., & van der Hoek, W. (2007). Logic for Automated Mechanism Design - A Progress Report. In Proceedings of the 22nd AAAI Conference on Artificial Intelligence, AAAI 2007 (pp. 9-16).

: Conference Paper

2006

On the complexity of linking deductive and abstract argument systems

Wooldridge, M., Dunne, P. E., & Parsons, S. (2006). On the complexity of linking deductive and abstract argument systems. In Proceedings of the National Conference on Artificial Intelligence Vol. 1 (pp. 299-304).

: Conference Paper

On the computational complexity of coalitional resource games

Wooldridge, M., & Dunne, P. E. (2006). On the computational complexity of coalitional resource games. ARTIFICIAL INTELLIGENCE, 170(10), 835-871. doi:10.1016/j.artint.2006.03.003

DOI: 10.1016/j.artint.2006.03.003
: Journal article

Complexity Properties of Restricted Abstract Argument Systems

Dunne, P. E. (2006). Complexity Properties of Restricted Abstract Argument Systems. In Frontiers in Artificial Intelligence and Applications Vol. 144 (pp. 85-96).

: Conference Paper

Computational Models of Argument

Bench-Capon, T. J. M., & Dunne, P. E. (Eds.) (2006). Computational Models of Argument. In COMMA 06 (pp. 341). Amsterdam: IOS Press.

: Conference Paper

Issues in Multiagent Resource Allocation

Chevaleyre, Y., Dunne, P. E., Endriss, U., Lang, J., Lemaître, M., Maudet, N., . . . Sousa, P. (2006). Issues in Multiagent Resource Allocation. Informatica (Ljubljana), 30(1), 3-31.

: Journal article

On the complexity of linking deductive and abstract argument systems

Wooldridge, M., Dunne, P. E., & Parsons, S. (2006). On the complexity of linking deductive and abstract argument systems. In AAAI-06 (pp. in press). Boston: AAAI Press.

: Conference Paper

Preface

Dunne, P. E., Bench-Capon, T., & Wooldridge, M. (2006). Preface. In Unknown Book (Vol. 144, pp. v).

: Chapter

Suspicion of Hidden Agenda in Persuasive Argument

Dunne, P. E. (2006). Suspicion of Hidden Agenda in Persuasive Argument. In Frontiers in Artificial Intelligence and Applications Vol. 144 (pp. 329-340).

: Conference Paper

2005

Determining preferences through argumentation

Doutre, S., Bench-Capon, T. R., & Dunne, P. E. (2005). Determining preferences through argumentation. In AI*IA2005: ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS Vol. 3673 (pp. 98-109). Retrieved from https://www.webofscience.com/

: Conference Paper

Discovering Inconsistency through Examination Dialogues

Dunne, P. E., Doutre, S., & Bench-Capon, T. (2005). Discovering Inconsistency through Examination Dialogues. In 19TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-05) (pp. 1680-1681). Retrieved from https://www.webofscience.com/

: Conference Paper

Explaining preferences with argument positions

Doutre, S., Bench-Capon, T., & Dunne, P. E. (2005). Explaining preferences with argument positions. In 19TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-05) (pp. 1560-1561). Retrieved from https://www.webofscience.com/

: Conference Paper

Multiagent Resource Allocation in the Presence of Externalities

Dunne, P. E. (2005). Multiagent Resource Allocation in the Presence of Externalities. In Unknown Conference (pp. 408-417). Springer Berlin Heidelberg. doi:10.1007/11559221_41

DOI: 10.1007/11559221_41
: Conference Paper

The complexity of agent design problems: Determinism and history dependence

Wooldridge, M., & Dunne, P. E. (2005). The complexity of agent design problems: Determinism and history dependence. ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 45(3-4), 343-371. doi:10.1007/s10472-005-9003-0

DOI: 10.1007/s10472-005-9003-0
: Journal article

The complexity of contract negotiation

Dunne, P. E., Wooldridge, M., & Laurence, M. (2005). The complexity of contract negotiation. ARTIFICIAL INTELLIGENCE, 164(1-2), 23-46. doi:10.1016/j.artint.2005.01.006

DOI: 10.1016/j.artint.2005.01.006
: Journal article

A Value-based Argument Model of Convention Degradation

Dunne, P. E. (2005). A Value-based Argument Model of Convention Degradation. Artificial Intelligence and Law, 13(1), 153-188. doi:10.1007/s10506-006-9006-0

DOI: 10.1007/s10506-006-9006-0
: Journal article

Argumentation in AI and Law: Editors' Introduction

Bench-Capon, T. J. M., & Dunne, P. E. (2005). Argumentation in AI and Law: Editors' Introduction. Artificial Intelligence and Law, 13(1), 1-8. doi:10.1007/s10506-006-9007-z

DOI: 10.1007/s10506-006-9007-z
: Journal article

A value-based argument model of convention degradation

Dunne, P. E. (2005). A value-based argument model of convention degradation. In P. E. Dunne, & T. J. M. Bench-Capon (Eds.), Argumentation in Artificial Intelligence and Law (pp. 39-51). Tilburg: Wolf Legal Publishers.

: Chapter

Argumentation in AI and Law

Dunne, P. E., & Bench-Capon, T. J. M. (Eds.) (2005). Argumentation in AI and Law. Nijmegan: Woolf Publishing.

: Book

Extremal behaviour in multiagent contract negotiation

Dunne, P. E. (2005). Extremal behaviour in multiagent contract negotiation. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 23, 41-78. doi:10.1613/jair.1526

DOI: 10.1613/jair.1526
: Journal article

Multi-Issue Negotiation with Deadlines

Fatima, S. S., Wooldridge, M. J., & Jennings, N. R. (n.d.). Multi-Issue Negotiation with Deadlines. Journal of Artificial Intelligence Research, 27, 381-417. doi:10.1613/jair.2056

DOI: 10.1613/jair.2056
: Journal article

Multiagent resource allocation

Chevaleyre, Y., Dunne, P. E., Endriss, U., Lang, J., Maudet, N., & Rodríguez-Aguilar, J. A. (2005). Multiagent resource allocation. KNOWLEDGE ENGINEERING REVIEW, 20(2), 143-149. doi:10.1017/S0269888905000470

DOI: 10.1017/S0269888905000470
: Journal article

2004

On the computational complexity of qualitative coalitional games

Wooldridge, M., & Dunne, P. E. (2004). On the computational complexity of qualitative coalitional games. ARTIFICIAL INTELLIGENCE, 158(1), 27-73. doi:10.1016/j.artint.2004.04.002

DOI: 10.1016/j.artint.2004.04.002
: Journal article

Complexity in value-based argument systems

Dunne, P. E., & Bench-Capon, T. (2004). Complexity in value-based argument systems. In LOGICS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS Vol. 3229 (pp. 360-371). doi:10.1007/978-3-540-30227-8_31

DOI: 10.1007/978-3-540-30227-8_31
: Conference Paper

Complexity results for agent design problems

Dunne, P. E., Laurence, M. R., & Wooldridge, M. J. (2004). Complexity results for agent design problems. Annals of Mathematics, Computing, and Teleinformatics, 1, 19-36.

: Journal article

Concepts of Optimal Utterance in Dialogue: Selection and Complexity

Dunne, P. E., & McBurney, P. (2004). Concepts of Optimal Utterance in Dialogue: Selection and Complexity. In Unknown Conference (pp. 310-328). Springer Berlin Heidelberg. doi:10.1007/978-3-540-24608-4_18

DOI: 10.1007/978-3-540-24608-4_18
: Conference Paper

Context dependence in multi agent resource allocation

Dunne, P. E. (2004). Context dependence in multi agent resource allocation. In Frontiers in Artificial Intelligence and Applications Vol. 110 (pp. 1001-1002).

: Conference Paper

Identifying audience preferences in legal and social domains

Dunne, P. E., & Bench-Capon, T. (2004). Identifying audience preferences in legal and social domains. In DATABASE AND EXPERT SYSTEMS APPLICATIONS, PROCEEDINGS Vol. 3180 (pp. 518-527). Retrieved from https://www.webofscience.com/

: Conference Paper

Representation and Complexity in Boolean Games

Dunne, P. E., & van der Hoek, W. (2004). Representation and Complexity in Boolean Games. In Unknown Conference (pp. 347-359). Springer Berlin Heidelberg. doi:10.1007/978-3-540-30227-8_30

DOI: 10.1007/978-3-540-30227-8_30
: Conference Paper

Tractability results for automatic contracting

Dunne, P. E., Laurence, M., & Wooldridge, M. (2004). Tractability results for automatic contracting. In Frontiers in Artificial Intelligence and Applications Vol. 110 (pp. 1003-1004).

: Conference Paper

2003

Prevarication in dispute protocols

Dunne, P. E. (2003). Prevarication in dispute protocols. In Proceedings of the 9th international conference on Artificial intelligence and law - ICAIL '03 (pp. 12). ACM Press. doi:10.1145/1047788.1047791

DOI: 10.1145/1047788.1047791
: Conference Paper

Two party immediate response disputes: Properties and efficiency

Dunne, P. E., & Bench-Capon, T. J. M. (2003). Two party immediate response disputes: Properties and efficiency. ARTIFICIAL INTELLIGENCE, 149(2), 221-250. doi:10.1016/S0004-3702(03)00076-6

DOI: 10.1016/S0004-3702(03)00076-6
: Journal article

Optimal utterances in dialogue protocols

Dunne, P. E., & McBurney, P. (2003). Optimal utterances in dialogue protocols. In Proceedings of the second international joint conference on Autonomous agents and multiagent systems (pp. 608-615). ACM. doi:10.1145/860575.860673

DOI: 10.1145/860575.860673
: Conference Paper

Optimal utterances in dialogue protocols

DOI: 10.1145/860672.860673
: Conference Paper

2002

Coherence in finite argument systems

Dunne, P. E., & Bench-Capon, T. J. M. (2002). Coherence in finite argument systems. ARTIFICIAL INTELLIGENCE, 141(1-2), 187-203. doi:10.1016/S0004-3702(02)00261-8

DOI: 10.1016/S0004-3702(02)00261-8
: Journal article

Demand-driven logic simulation using a network of loosely coupled processors

Dunne, P. E., Leng, P. H., & Nwana, G. F. (2002). Demand-driven logic simulation using a network of loosely coupled processors. JOURNAL OF SYSTEMS ARCHITECTURE, 47(14-15), 1117-1128. doi:10.1016/S1383-7621(02)00062-0

DOI: 10.1016/S1383-7621(02)00062-0
: Journal article

No agent is an island

Bench-Capon, T. J. M., & Dunne, P. E. (2002). No agent is an island. In Proceedings of the first international joint conference on Autonomous agents and multiagent systems part 2 - AAMAS '02 (pp. 690). ACM Press. doi:10.1145/544862.544907

DOI: 10.1145/544862.544907
: Conference Paper

No agent is an island: A framework for the study of inter-agent behavior

Bench-Capon, T. J. M., & Dunne, P. E. (2002). No agent is an island: A framework for the study of inter-agent behavior. In Proceedings of the International Conference on Autonomous Agents (pp. 690-691).

: Conference Paper

The Computational Complexity of Agent Verification

Wooldridge, M., & Dunne, P. E. (2002). The Computational Complexity of Agent Verification. In Unknown Conference (pp. 115-127). Springer Berlin Heidelberg. doi:10.1007/3-540-45448-9_9

DOI: 10.1007/3-540-45448-9_9
: Conference Paper

The computational complexity of boolean and stochastic agent design problems

Dunne, P. E., Wooldridge, M., & Laurence, M. (2002). The computational complexity of boolean and stochastic agent design problems. In Proceedings of the first international joint conference on Autonomous agents and multiagent systems part 2 - AAMAS '02. ACM Press. doi:10.1145/544964.544968

DOI: 10.1145/544964.544968
: Conference Paper

The computational complexity of boolean and stochastic agent design problems

DOI: 10.1145/544862.544968
: Conference Paper

2001

Leafy spanning trees in hypercubes

Duckworth, W., Dunne, P. E., Gibbons, A. M., & Zito, M. (2001). Leafy spanning trees in hypercubes. APPLIED MATHEMATICS LETTERS, 14(7), 801-804. doi:10.1016/S0893-9659(01)00047-7

DOI: 10.1016/S0893-9659(01)00047-7
: Journal article

A sharp threshold for the phase transition of a restricted Satisfiability problem for Horn clauses

Dunne, P. E., & Bench-Capon, T. J. M. (2001). A sharp threshold for the phase transition of a restricted Satisfiability problem for Horn clauses. JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING, 47(1), 1-14. doi:10.1016/S1567-8326(00)00002-3

DOI: 10.1016/S1567-8326(00)00002-3
: Journal article

Optimistic and Disjunctive Agent Design Problems

Wooldridge, M., & Dunne, P. E. (2001). Optimistic and Disjunctive Agent Design Problems. In Unknown Conference (pp. 1-14). Springer Berlin Heidelberg. doi:10.1007/3-540-44631-1_1

DOI: 10.1007/3-540-44631-1_1
: Conference Paper

2000

J. UCS special issue on BCTCS

Dunne, P. E., & Gibbons, A. (2000). J. UCS special issue on BCTCS. Journal of Universal Computer Science, 6(4), 405-406.

: Journal article

Complexity-theoretic models of phase transitions in search problems

Dunne, P. E., Gibbons, A., & Zito, M. (2000). Complexity-theoretic models of phase transitions in search problems. THEORETICAL COMPUTER SCIENCE, 249(2), 243-263. doi:10.1016/S0304-3975(00)00061-X

DOI: 10.1016/S0304-3975(00)00061-X
: Journal article

1999

The average case performance of an algorithm for demand-driven evaluation of boolean formulae

Dunne, P. E., & Leng, P. H. (1999). The average case performance of an algorithm for demand-driven evaluation of boolean formulae. Journal of Universal Computer Science, 5(5).

: Journal article

Algorithms and complexity issues concerning phase-transition phenomena in combinatorial problems

Dunne, P., Gibbons, A., & Zito, M. (1999). Algorithms and complexity issues concerning phase-transition phenomena in combinatorial problems. In R. Raman, & J. Simpson (Eds.), Unknown Conference (pp. 76-90).

: Conference Paper

1998

An improved upper bound on the non-3-colourability threshold

Dunne, P. E., & Zito, M. (1998). An improved upper bound on the non-3-colourability threshold. INFORMATION PROCESSING LETTERS, 65(1), 17-23. doi:10.1016/S0020-0190(97)00193-2

DOI: 10.1016/S0020-0190(97)00193-2
: Journal article

Toward feasible and efficient DNA computation

Amos, M., Gibbons, A., & Dunne, P. E. (1998). Toward feasible and efficient DNA computation. Complexity, 4(1), 20-24. doi:3.0.co;2-h">10.1002/(sici)1099-0526(199809/10)4:1<20::aid-cplx7>3.0.co;2-h

DOI: 10.1002/(sici)1099-0526(199809/10)4:1<20::aid-cplx7>3.0.co;2-h
: Journal article

1997

Modelling Legal Documents as Graphs

Bench‐Capon, T. J. M., Dunne, P. E. S., & Stamford, G. (1997). Modelling Legal Documents as Graphs. Information & Communications Technology Law, 6(2), 103-120. doi:10.1080/13600834.1997.9965761

DOI: 10.1080/13600834.1997.9965761
: Journal article

The maximum length of prime implicates for instances of 3-SAT

Dunne, P. E., & BenchCapon, T. J. M. (1997). The maximum length of prime implicates for instances of 3-SAT. ARTIFICIAL INTELLIGENCE, 92(1-2), 317-329. doi:10.1016/S0004-3702(97)00018-0

DOI: 10.1016/S0004-3702(97)00018-0
: Journal article

1996

Ceilings of monotone Boolean functions

Dunne, P. E. (1996). Ceilings of monotone Boolean functions. Journal of Universal Computer Science, 2(7), 533-548.

: Journal article

1995

MULTIPROCESSOR SIMULATION STRATEGIES WITH OPTIMAL SPEED-UP

DUNNE, P. E., GITTINGS, C. J., & LENG, P. H. (1995). MULTIPROCESSOR SIMULATION STRATEGIES WITH OPTIMAL SPEED-UP. INFORMATION PROCESSING LETTERS, 54(1), 23-33. doi:10.1016/0020-0190(94)00226-O

DOI: 10.1016/0020-0190(94)00226-O
: Journal article

ON THE COMPLEXITY OF BOOLEAN FUNCTIONS COMPUTED BY LAZY ORACLES

DUNNE, P. E., LENG, P. H., & NWANA, G. F. (1995). ON THE COMPLEXITY OF BOOLEAN FUNCTIONS COMPUTED BY LAZY ORACLES. IEEE TRANSACTIONS ON COMPUTERS, 44(4), 495-502. doi:10.1109/12.376165

DOI: 10.1109/12.376165
: Journal article

1994

Autonomous Agents in the Support of Cooperative Authorship

Staniford, G., & Dunne, P. E. S. (1994). Autonomous Agents in the Support of Cooperative Authorship. In Computer Supported Cooperative Work (pp. 47-65). Springer London. doi:10.1007/978-1-4471-2035-3_5

DOI: 10.1007/978-1-4471-2035-3_5
: Chapter

Distributing quality-controlled software via the internet

Charlton, C. C., Dunne, P. E., Leng, P. H., Little, J., & Woodward, M. R. (1994). Distributing quality-controlled software via the internet. Microprocessing and Microprogramming, 40(10-12), 861-864. doi:10.1016/0165-6074(94)90056-6

DOI: 10.1016/0165-6074(94)90056-6
: Journal article

1993

AN ALGORITHM TO GENERATE RANDOM LARGE COMBINATIONAL-CIRCUITS

CHARLTON, C. C., DUNNE, P. E., HALEWOOD, K., & LENG, P. H. (1993). AN ALGORITHM TO GENERATE RANDOM LARGE COMBINATIONAL-CIRCUITS. COMPUTER JOURNAL, 36(2), 200-206. doi:10.1093/comjnl/36.2.200

DOI: 10.1093/comjnl/36.2.200
: Journal article

Linearisation schemata for hypertext

Bench-Capon, T. J. M., Dunne, P. E. S., & Staniford, G. (1993). Linearisation schemata for hypertext. In Unknown Conference (pp. 697-708). Springer Berlin Heidelberg. doi:10.1007/3-540-57234-1_73

DOI: 10.1007/3-540-57234-1_73
: Conference Paper

Sequential and parallel strategies for the demand-driven simulation of logic circuits

Dunne, P. E., Gittings, C. J. J., & Leng, P. H. (1993). Sequential and parallel strategies for the demand-driven simulation of logic circuits. Microprocessing and Microprogramming, 38(1-5), 519-525. doi:10.1016/0165-6074(93)90190-v

DOI: 10.1016/0165-6074(93)90190-v
: Journal article

1992

INTEGRATING LEGAL SUPPORT SYSTEMS THROUGH DOCUMENT MODELS

BENCHCAPON, T. J. M., COENEN, F., & DUNNE, P. E. S. (1992). INTEGRATING LEGAL SUPPORT SYSTEMS THROUGH DOCUMENT MODELS. EXPERT SYSTEMS WITH APPLICATIONS, 4(4), 355-362. doi:10.1016/0957-4174(92)90128-F

DOI: 10.1016/0957-4174(92)90128-F
: Journal article

Linearising Hypertext through Target Graph Specifications

Bench-Capon, T. J. M., Dunne, P. E. S., & Staniford, G. (1992). Linearising Hypertext through Target Graph Specifications. In Database and Expert Systems Applications (pp. 173-178). Springer Vienna. doi:10.1007/978-3-7091-7557-6_30

DOI: 10.1007/978-3-7091-7557-6_30
: Chapter

1991

Algorithm for optimising signal selection in demand-driven digital circuit simulation

Dunne, P. E., & Leng, P. H. (1991). Algorithm for optimising signal selection in demand-driven digital circuit simulation. Transactions of the Society for Computer Simulation, 8(4), 269-293.

: Journal article

Computability theory concepts and applications

Dunne, P. E. (1991). Computability theory concepts and applications. Chichester, England: Ellis Horwood. Retrieved from http://www.csc.liv.ac.uk/~ped/

: Book

1990

EFFICIENT MONOTONE CIRCUITS FOR THRESHOLD FUNCTIONS - COMMENT

DUNNE, P. E. (1990). EFFICIENT MONOTONE CIRCUITS FOR THRESHOLD FUNCTIONS - COMMENT. INFORMATION PROCESSING LETTERS, 34(5), 221-222. doi:10.1016/0020-0190(90)90125-H

DOI: 10.1016/0020-0190(90)90125-H
: Journal article

An Approach to the Integration of Legal Support Systems

Bench-Capon, T. J. M., & Dunne, P. E. S. (1990). An Approach to the Integration of Legal Support Systems. In Database and Expert Systems Applications (pp. 105-111). Springer Vienna. doi:10.1007/978-3-7091-7553-8_17

DOI: 10.1007/978-3-7091-7553-8_17
: Chapter

Expertext: From semantic nets to logic Petri nets

Rada, R., Dunne, P. E. S., & Barlow, J. (1990). Expertext: From semantic nets to logic Petri nets. Expert Systems with Applications, 1(1), 51-62. doi:10.1016/0957-4174(90)90068-6

DOI: 10.1016/0957-4174(90)90068-6
: Journal article

1989

ON MONOTONE SIMULATIONS OF NONMONOTONE NETWORKS

DUNNE, P. E. (1989). ON MONOTONE SIMULATIONS OF NONMONOTONE NETWORKS. THEORETICAL COMPUTER SCIENCE, 66(1), 15-25. doi:10.1016/0304-3975(89)90142-4

DOI: 10.1016/0304-3975(89)90142-4
: Journal article

1988

The complexity of Boolean networks

Dunne, P. E. (1988). The complexity of Boolean networks (Vol. 29). London, UK: Academic Press. Retrieved from http://www.csc.liv.ac.uk/~ped/

: Book

1987

A RESULT ON KAPPA-VALENT GRAPHS AND ITS APPLICATION TO A GRAPH EMBEDDING PROBLEM

DUNNE, P. E. (1987). A RESULT ON KAPPA-VALENT GRAPHS AND ITS APPLICATION TO A GRAPH EMBEDDING PROBLEM. ACTA INFORMATICA, 24(4), 447-459. doi:10.1007/BF00292113

DOI: 10.1007/BF00292113
: Journal article

1986

THE COMPLEXITY OF CENTRAL SLICE FUNCTIONS

DUNNE, P. E. (1986). THE COMPLEXITY OF CENTRAL SLICE FUNCTIONS. THEORETICAL COMPUTER SCIENCE, 44(3), 247-257. doi:10.1016/0304-3975(86)90122-2

DOI: 10.1016/0304-3975(86)90122-2
: Journal article

1985

A 2.5N LOWER BOUND ON THE MONOTONE NETWORK COMPLEXITY OF T3N

DUNNE, P. E. (1985). A 2.5N LOWER BOUND ON THE MONOTONE NETWORK COMPLEXITY OF T3N. ACTA INFORMATICA, 22(2), 229-240. Retrieved from https://www.webofscience.com/

: Journal article

Lower bounds on the complexity of 1-time only branching programs (Preliminary version)

Dunne, P. E. (n.d.). Lower bounds on the complexity of 1-time only branching programs (Preliminary version). In Unknown Conference (pp. 90-99). Springer-Verlag. doi:10.1007/bfb0028795

DOI: 10.1007/bfb0028795
: Conference Paper