A logic of intention and action for regular BDI agents based on bisimulation of agent programs
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 60551478X | ||
| 003 | CHVBK | ||
| 005 | 20210128100706.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 210128e20150701xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1007/s10458-014-9263-3 |2 doi |
| 035 | |a (NATIONALLICENCE)springer-10.1007/s10458-014-9263-3 | ||
| 100 | 1 | |a Wobcke |D Wayne |u School of Computer Science and Engineering, University of New South Wales, 2052, Sydney, NSW, Australia |4 aut | |
| 245 | 1 | 2 | |a A logic of intention and action for regular BDI agents based on bisimulation of agent programs |h [Elektronische Daten] |c [Wayne Wobcke] |
| 520 | 3 | |a We address the problem of providing a computationally grounded semantics for belief, desire, intention (BDI) agents that explicitly relates intention to action, using as a basis for this connection a notion of bisimulation for agent programs. We first define regular BDI agents, a class of BDI agents inspired by the procedural reasoning system architecture, under the restriction that agent programs are representable as regular expressions. The operational semantics of regular agent programs is formalized using agent program execution graphs, an extension of the process graphs used to formalize regular processes. An agent's executed program represents an attempt to perform an intended plan and can include branches for both successful execution and the failure of action attempts; intended execution paths are defined in terms of successful executions, and intentions in terms of future successfully executed agent programs. We present Agent Dynamic Logic ( $$\mathsf {ADL}$$ ADL ), a logic of intention and action that faithfully represents the operational semantics of regular BDI agents. $$\mathsf {ADL}$$ ADL is a logic in the spirit of BDI logic but also includes the dynamic logic of actions and a reduction of the logic of intention to the logics of action and time. A main contribution of the paper is a completeness result for a subclass of finite $$\mathsf {ADL}$$ ADL theories with explicit representations of agent plans. | |
| 540 | |a The Author(s), 2014 | ||
| 690 | 7 | |a Rational agents |2 nationallicence | |
| 690 | 7 | |a Dynamic logic |2 nationallicence | |
| 690 | 7 | |a Temporal logic |2 nationallicence | |
| 690 | 7 | |a Bisimulation |2 nationallicence | |
| 773 | 0 | |t Autonomous Agents and Multi-Agent Systems |d Springer US; http://www.springer-ny.com |g 29/4(2015-07-01), 569-620 |x 1387-2532 |q 29:4<569 |1 2015 |2 29 |o 10458 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/s10458-014-9263-3 |q text/html |z Onlinezugriff via DOI |
| 898 | |a BK010053 |b XK010053 |c XK010000 | ||
| 900 | 7 | |a Metadata rights reserved |b Springer special CC-BY-NC licence |2 nationallicence | |
| 908 | |D 1 |a research-article |2 jats | ||
| 949 | |B NATIONALLICENCE |F NATIONALLICENCE |b NL-springer | ||
| 950 | |B NATIONALLICENCE |P 856 |E 40 |u https://doi.org/10.1007/s10458-014-9263-3 |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 100 |E 1- |a Wobcke |D Wayne |u School of Computer Science and Engineering, University of New South Wales, 2052, Sydney, NSW, Australia |4 aut | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Autonomous Agents and Multi-Agent Systems |d Springer US; http://www.springer-ny.com |g 29/4(2015-07-01), 569-620 |x 1387-2532 |q 29:4<569 |1 2015 |2 29 |o 10458 | ||