A complete and decidable logic for resource-bounded agents

Natasha Alechina; Brian Logan; Mark Whitsey

A complete and decidable logic for resource-bounded agents

Natasha Alechina^*, Brian Logan, Mark Whitsey

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

47 Citations (Scopus)

Abstract

We propose a context-logic style formalism, Timed Reasoning Logics (TRL), to describe resource-bounded reasoners who take time to derive consequences of their knowledge. The semantics of TRL is grounded in the agent's computation, allowing an unambiguous ascription of the set of formulas which the agent actually knows at time t. We show that TRL can capture various rule application and conflict resolution strategies that a rule-based agent may employ, and analyse two examples in detail: TRL(STEP) which models an all rules at each cycle strategy similar to that assumed in step logic [5], and TRL(CLIPS) which models a single rule at each cycle strategy similar to that employed by the CLIPS [22] rule based system architecture. We prove a general completeness and decidability results for TRL(STEP).

Original language	English
Title of host publication	Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004
Editors	N.R. Jennings, C. Sierra, L. Sonenberg, M. Tambe
Pages	606-613
Number of pages	8
Volume	2
Publication status	Published - 2004
Event	Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004 - New York, NY, United States Duration: 19 Jul 2004 → 23 Jul 2004

Other

Other	Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004
Country/Territory	United States
City	New York, NY
Period	19/07/04 → 23/07/04

Cite this

@inproceedings{dd9214bbf8ed492986341ec65945abdb,

title = "A complete and decidable logic for resource-bounded agents",

abstract = "We propose a context-logic style formalism, Timed Reasoning Logics (TRL), to describe resource-bounded reasoners who take time to derive consequences of their knowledge. The semantics of TRL is grounded in the agent's computation, allowing an unambiguous ascription of the set of formulas which the agent actually knows at time t. We show that TRL can capture various rule application and conflict resolution strategies that a rule-based agent may employ, and analyse two examples in detail: TRL(STEP) which models an all rules at each cycle strategy similar to that assumed in step logic [5], and TRL(CLIPS) which models a single rule at each cycle strategy similar to that employed by the CLIPS [22] rule based system architecture. We prove a general completeness and decidability results for TRL(STEP).",

author = "Natasha Alechina and Brian Logan and Mark Whitsey",

year = "2004",

language = "English",

isbn = "1581138644",

volume = "2",

pages = "606--613",

editor = "N.R. Jennings and C. Sierra and L. Sonenberg and M. Tambe",

booktitle = "Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004",

note = "Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004 ; Conference date: 19-07-2004 Through 23-07-2004",

}

Alechina, N, Logan, B & Whitsey, M 2004, A complete and decidable logic for resource-bounded agents. in NR Jennings, C Sierra, L Sonenberg & M Tambe (eds), Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004. vol. 2, pp. 606-613, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004, New York, NY, United States, 19/07/04.

A complete and decidable logic for resource-bounded agents. / Alechina, Natasha; Logan, Brian; Whitsey, Mark.
Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004. ed. / N.R. Jennings; C. Sierra; L. Sonenberg; M. Tambe. Vol. 2 2004. p. 606-613.

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

T1 - A complete and decidable logic for resource-bounded agents

AU - Alechina, Natasha

AU - Logan, Brian

AU - Whitsey, Mark

PY - 2004

Y1 - 2004

N2 - We propose a context-logic style formalism, Timed Reasoning Logics (TRL), to describe resource-bounded reasoners who take time to derive consequences of their knowledge. The semantics of TRL is grounded in the agent's computation, allowing an unambiguous ascription of the set of formulas which the agent actually knows at time t. We show that TRL can capture various rule application and conflict resolution strategies that a rule-based agent may employ, and analyse two examples in detail: TRL(STEP) which models an all rules at each cycle strategy similar to that assumed in step logic [5], and TRL(CLIPS) which models a single rule at each cycle strategy similar to that employed by the CLIPS [22] rule based system architecture. We prove a general completeness and decidability results for TRL(STEP).

AB - We propose a context-logic style formalism, Timed Reasoning Logics (TRL), to describe resource-bounded reasoners who take time to derive consequences of their knowledge. The semantics of TRL is grounded in the agent's computation, allowing an unambiguous ascription of the set of formulas which the agent actually knows at time t. We show that TRL can capture various rule application and conflict resolution strategies that a rule-based agent may employ, and analyse two examples in detail: TRL(STEP) which models an all rules at each cycle strategy similar to that assumed in step logic [5], and TRL(CLIPS) which models a single rule at each cycle strategy similar to that employed by the CLIPS [22] rule based system architecture. We prove a general completeness and decidability results for TRL(STEP).

UR - http://www.scopus.com/inward/record.url?scp=4544259747&partnerID=8YFLogxK

M3 - Conference proceeding contribution

AN - SCOPUS:4544259747

SN - 1581138644

VL - 2

SP - 606

EP - 613

BT - Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004

A2 - Jennings, N.R.

A2 - Sierra, C.

A2 - Sonenberg, L.

A2 - Tambe, M.

T2 - Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004

Y2 - 19 July 2004 through 23 July 2004

ER -

A complete and decidable logic for resource-bounded agents

Abstract

Other

Other files and links

Fingerprint

Cite this