Verifying time, memory and communication bounds in systems of reasoning agents.
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 and communication bandwidth) are bounded. The frame...
| Publicado en: | Synthese Vol. 169; no. 2; pp. 385 - 404 |
|---|---|
| Autores principales: | , , , |
| Formato: | Artículo |
| Publicado: |
Springer Nature
Jul2009
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=41132814&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 41132814 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00397857 4LI jtl: Synthese issn: 00397857 maglogo: N pubinfo: dt: Jul2009 vid: 169 iid: 2 pid: 237 pub: Springer Nature artinfo: ui: 41132814 10.1007/s11229-009-9557-1 ppf: 385 ppct: 19 formats: fmt: @attributes: type: P size: 303KB tig: atl: Verifying time, memory and communication bounds in systems of reasoning agents. aug: au: Alechina, Natasha Logan, Brian Nguyen, Hoang Nga Rakib, Abdur affil: School of Computer Science, University of Nottingham, Nottingham NG8 1BB, UK su: Problem solving research Agent (Philosophy) Reason Axioms Confirmation (Logic) sug: subj: Problem solving research Agent (Philosophy) Reason Axioms Confirmation (Logic) keyword: Distributed reasoning Epistemic logic Resource bounds ab: 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 and communication bandwidth) are bounded. The framework allows us to investigate, for example, whether a goal can be achieved if a particular agent, perhaps possessing key information or inferential capabilities, is unable (or unwilling) to contribute more than a given portion of its available computational resources or bandwidth to the problem. We present a novel temporal epistemic logic, BMCL-CTL, which allows us to describe a set of reasoning agents with bounds on time, memory and the number of messages they can exchange. The bounds on memory and communication are expressed as axioms in the logic. As an example, we show how to axiomatise a system of agents which reason using resolution and prove that the resulting logic is sound and complete. We then show how to encode a simple system of reasoning agents specified in BMCL-CTL in the description language of the Mocha model checker (Alur et al., Proceedings of the tenth international conference on computer-aided verification (CAV), 1998), and verify that the agents can achieve a goal only if they are prepared to commit certain time, memory and communication resources. pubtype: Academic Journal doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y custom: Synthese is a copyright of Springer, 2009. All Rights Reserved. item: Synthese holder: Springer Nature dt: @attributes: year: 2009 holdings: @attributes: islocal: N |
|---|