All Outputs (7)

Practical zero-knowledge proofs for circuit evaluation (2009)
Journal Article
Ghadafi, E., Smart, N. P., & Warinschi, B. (2009). Practical zero-knowledge proofs for circuit evaluation. Lecture Notes in Artificial Intelligence, 5921 LNCS, 469-494. https://doi.org/10.1007/978-3-642-10868-6_28

Showing that a circuit is satisfiable without revealing information is a key problem in modern cryptography. The related (and more general) problem of showing that a circuit evaluates to a particular value if executed on the input contained in a publ... Read More about Practical zero-knowledge proofs for circuit evaluation.

Reasoning about other agents' beliefs under bounded resources (2009)
Journal Article
Alechina, N., Logan, B., Nguyen, H. N., & Rakib, A. (2009). Reasoning about other agents' beliefs under bounded resources. Lecture Notes in Artificial Intelligence, 5605 LNAI, 1-15. https://doi.org/10.1007/978-3-642-05301-6_1

There exists a considerable body of work on epistemic logics for bounded reasoners where the bound can be time, memory, or the amount of information the reasoners can exchange. In much of this work the epistemic logic is used as a meta-logic to reaso... Read More about Reasoning about other agents' beliefs under bounded resources.

Expressing properties of coalitional ability under resource bounds (2009)
Journal Article
Alechina, N., Logan, B., Nga, N. H., & Rakib, A. (2009). Expressing properties of coalitional ability under resource bounds. Lecture Notes in Artificial Intelligence, 5834 LNAI, 1-14. https://doi.org/10.1007/978-3-642-04893-7_1

We introduce Coalition Logic for Resource Games (CLRG) which extends Coalition Logic by allowing explicit reasoning about resource endowments of coalitions of agents and resource bounds on strategies. We show how to express interesting properties of... Read More about Expressing properties of coalitional ability under resource bounds.

A robust solution to multi-modal image registration by combining mutual information with multi-scale derivatives (2009)
Journal Article
Morgan, J. E., Rosin, P. L., Legg, P., & Marshall, D. (2009). A robust solution to multi-modal image registration by combining mutual information with multi-scale derivatives. Lecture Notes in Artificial Intelligence, 5761 LNCS(PART 1), 616-623. https://doi.org/10.1007/978-3-642-04268-3_76

In this paper we present a novel method for performing image registration of different modalities. Mutual Information (MI) is an established method for performing such registration. However, it is recognised that standard MI is not without some probl... Read More about A robust solution to multi-modal image registration by combining mutual information with multi-scale derivatives.

On dynamical genetic programming: Random boolean networks in learning classifier systems (2009)
Journal Article
Bull, L., & Preen, R. (2009). On dynamical genetic programming: Random boolean networks in learning classifier systems. Lecture Notes in Artificial Intelligence, 5481 LNCS, 37-48. https://doi.org/10.1007/978-3-642-01181-8_4

Many representations have been presented to enable the effective evolution of computer programs. Turing was perhaps the first to present a general scheme by which to achieve this end. Significantly, Turing proposed a form of discrete dynamical system... Read More about On dynamical genetic programming: Random boolean networks in learning classifier systems.

Verifying time, memory and communication bounds in systems of reasoning agents (2009)
Journal Article
Alechina, N., Logan, B., Nguyen, H. N., & Rakib, A. (2009). Verifying time, memory and communication bounds in systems of reasoning agents. Synthese, 169(2), 385-403. https://doi.org/10.1007/s11229-009-9557-1

We present a framework for verifying systems composed of heterogeneous reasoning agents, in which each agent may have differing knowledge and inferential capabilities, and where the resources each agent is prepared to commit to a goal (time, memory a... Read More about Verifying time, memory and communication bounds in systems of reasoning agents.

Verifying time and communication costs of rule-based reasoners (2009)
Journal Article
Alechina, N., Logan, B., Nga, N. H., & Rakib, A. (2009). Verifying time and communication costs of rule-based reasoners. Lecture Notes in Artificial Intelligence, 5348 LNAI, 1-14. https://doi.org/10.1007/978-3-642-00431-5_1

We present a framework for the automated verification of time and communication requirements in systems of distributed rule-based reasoning agents which allows us to determine how many rule-firing cycles are required to solve the problem, how many me... Read More about Verifying time and communication costs of rule-based reasoners.