Paul E. Dunne

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.

[BibT_eX]

[DOI]

Proceedings of the Multi-Agent Systems and Applications IV, 2005

Determining Preferences Through Argumentation.

[BibT_eX]

[DOI]

Sylvie Doutre

Proceedings of the AI*IA 2005: Advances in Artificial Intelligence, 2005

2004

On the computational complexity of qualitative coalitional games.

[BibT_eX]

[DOI]

Artif. Intell., 2004

Representation and Complexity in Boolean Games.

[BibT_eX]

[DOI]

Wiebe van der Hoek

Proceedings of the Logics in Artificial Intelligence, 9th European Conference, 2004

Complexity in Value-Based Argument Systems.

[BibT_eX]

[DOI]

Proceedings of the Logics in Artificial Intelligence, 9th European Conference, 2004

Tractability Results for Automatic Contracting.

[BibT_eX]

Michael Laurence

Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004

Context Dependence in Multiagent Resource Allocation.

[BibT_eX]

Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004

Identifying Audience Preferences in Legal and Social Domains.

[BibT_eX]

[DOI]

Proceedings of the Database and Expert Systems Applications, 15th International Conference, 2004

2003

Two party immediate response disputes: Properties and efficiency.

[BibT_eX]

[DOI]

Artif. Intell., 2003

Prevarication in Dispute Protocols.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Artificial Intelligence and Law, 2003

Optimal utterances in dialogue protocols.

[BibT_eX]

[DOI]

Peter McBurney

Proceedings of the Second International Joint Conference on Autonomous Agents & Multiagent Systems, 2003

Concepts of Optimal Utterance in Dialogue: Selection and Complexity.

[BibT_eX]

[DOI]

Peter McBurney

Proceedings of the Advances in Agent Communication, 2003

2002

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

[BibT_eX]

[DOI]

Gerald F. Nwana

J. Syst. Archit., 2002

Coherence in finite argument systems.

[BibT_eX]

[DOI]

Artif. Intell., 2002

On concise encodings of preferred extensions.

[BibT_eX]

Proceedings of the 9th International Workshop on Non-Monotonic Reasoning (NMR 2002), 2002

The computational complexity of boolean and stochastic agent design problems.

[BibT_eX]

[DOI]

Michael Laurence

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2001

Leafy spanning trees in hypercubes.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2001

The Computational Complexity of Agent Verification.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Agents VIII, 8th International Workshop, 2001

2000

Complexity-theoretic models of phase transitions in search problems.

[BibT_eX]

[DOI]

Michele Zito

Theor. Comput. Sci., 2000

J.UCS Special Issue on BCTCS.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2000

Optimistic and Disjunctive Agent Design Problems.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 1999

1998

An Inproved Upper Bound on the Non-3-Colourability Threshold.

[BibT_eX]

[DOI]

Michele Zito

Inf. Process. Lett., 1998

Toward feasible and efficient DNA computation.

[BibT_eX]

[DOI]

Martyn Amos

Complex., 1998

1997

The Maximum Length of Prime Implicates for Instances of 3-SAT.

[BibT_eX]

[DOI]

Artif. Intell., 1997

The Verification and Validation of Rulebases Using a Binary Encoded Incidence Matrix Technique.

[BibT_eX]

Frans Coenen

Proceedings of the Fourth European Symposium on the Validation and Verification of Knowledge-Based Systems, 1997

The Complexity and Viability of DNA Computations.

[BibT_eX]

Martyn Amos

Proceedings of the Biocomputing and emergent computation: Proceedings of BCEC97, 1997

1996

Ceilings of Monotone Boolean Functions.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 1996

1995

On the Complexity of Boolean Functions Computed by Lazy Oracles.

[BibT_eX]

[DOI]

Gerald F. Nwana

IEEE Trans. Computers, 1995

Multiprocessor Simulation Strategies with Optimal Speed-up.

[BibT_eX]

[DOI]

Chris J. Gittings

Inf. Process. Lett., 1995

1994

Distributing quality-controlled software via the internet.

[BibT_eX]

[DOI]

Microprocess. Microprogramming, 1994

1993

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

[BibT_eX]

[DOI]

Chris J. J. Gittings

Microprocess. Microprogramming, 1993

An Algorithm to Generate Random Large Combinational Circuits.

[BibT_eX]

[DOI]

Comput. J., 1993

Linearisation Schemata for Hypertext.

[BibT_eX]

[DOI]

Geof Staniford

Proceedings of the Database and Expert Systems Applications, 4th International Conference, 1993

Cooperative Dialogues with the Support of Autonomous Agents.

[BibT_eX]

Geof Staniford

Proceedings of the International Conference on Intelligent and Cooperative Information Systems, 1993

1992

Linearising Hypertext through Target Graph Specifications.

[BibT_eX]

Geof Staniford

Proceedings of the International Conference on Database and Expert Systems Applications, 1992

1990

Comment on Kochol's Paper "Efficient Monotone Circuits for Threshold Functions".

[BibT_eX]

[DOI]

Inf. Process. Lett., 1990

An Approach to the Integration of Legal Support Systems.

[BibT_eX]

Proceedings of the International Conference on Database and Expert Systems Applications, 1990

1989

On Monotone Simulations of Nonmonotone Networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1989

1988

Some Computational Properties of a Model for Electronic Documents.

[BibT_eX]

Electron. Publ., 1988

1987

A Result on <i> k </i> -Valent Graphs and Its Application to a Graph Embedding Problem.

[BibT_eX]

[DOI]

Acta Informatica, 1987

1986

The Complexity of Central Slice Functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1986

1985

A 2.5<i>n</i> Lower Bound on the Monotone Network Complexity of T_3^n.

[BibT_eX]

[DOI]

Acta Informatica, 1985

Lower bounds on the complexity of 1-time only branching programs.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1985

1984

Techniques for the analysis of monotone Boolean networks.

[BibT_eX]

[DOI]