Reasoning about resource-bounded multi-agent systems
The thesis presents logic-based formalisms for modelling and reasoning about resource-bounded multi-agent systems. In the field of multi-agent system, it is well-known that temporal logics such as CTL and ATL are powerful tools for reasoning about multi-agent systems. However, there is no natural wa...
| Main Author: | |
|---|---|
| Format: | Thesis (University of Nottingham only) |
| Language: | English |
| Published: |
2011
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/11851/ |
| _version_ | 1848791373941047296 |
|---|---|
| author | Nguyen, Nguyen |
| author_facet | Nguyen, Nguyen |
| author_sort | Nguyen, Nguyen |
| building | Nottingham Research Data Repository |
| collection | Online Access |
| description | The thesis presents logic-based formalisms for modelling and reasoning about resource-bounded multi-agent systems. In the field of multi-agent system, it is well-known that temporal logics such as CTL and ATL are powerful tools for reasoning about multi-agent systems. However, there is no natural way to utilise these logics for expressing and reasoning about properties of multi-agent systems where actions of agents require resources to be able to perform. This thesis extends logics including Computational Tree Logic (CTL), Coalition Logic (CL) and Alternating-time Temporal Logic (ATL) which have been used to reasoning about multi-agent systems so that the extended ones have the power to specify and to reason about properties of resource-bounded multi-agent systems. While the extension of CTL is adapted for specifying and reasoning about properties of systems of resource-bounded reasoners where the resources are explicitly memory, communication and time, the extensions of CL and ATL are generalised so that any resource-bounded multi-agent system can be modelled, specified and reasoned about. For each of the logics, we describe the range of resource-bounded multi-agent systems they can account for and axiomatisation systems for reasoning which are proved to be sound and complete. Moreover, we also study the satisfiability problem of these logics. |
| first_indexed | 2025-11-14T18:27:29Z |
| format | Thesis (University of Nottingham only) |
| id | nottingham-11851 |
| institution | University of Nottingham Malaysia Campus |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-14T18:27:29Z |
| publishDate | 2011 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | nottingham-118512025-02-28T11:15:59Z https://eprints.nottingham.ac.uk/11851/ Reasoning about resource-bounded multi-agent systems Nguyen, Nguyen The thesis presents logic-based formalisms for modelling and reasoning about resource-bounded multi-agent systems. In the field of multi-agent system, it is well-known that temporal logics such as CTL and ATL are powerful tools for reasoning about multi-agent systems. However, there is no natural way to utilise these logics for expressing and reasoning about properties of multi-agent systems where actions of agents require resources to be able to perform. This thesis extends logics including Computational Tree Logic (CTL), Coalition Logic (CL) and Alternating-time Temporal Logic (ATL) which have been used to reasoning about multi-agent systems so that the extended ones have the power to specify and to reason about properties of resource-bounded multi-agent systems. While the extension of CTL is adapted for specifying and reasoning about properties of systems of resource-bounded reasoners where the resources are explicitly memory, communication and time, the extensions of CL and ATL are generalised so that any resource-bounded multi-agent system can be modelled, specified and reasoned about. For each of the logics, we describe the range of resource-bounded multi-agent systems they can account for and axiomatisation systems for reasoning which are proved to be sound and complete. Moreover, we also study the satisfiability problem of these logics. 2011-07-13 Thesis (University of Nottingham only) NonPeerReviewed application/pdf en arr https://eprints.nottingham.ac.uk/11851/1/thesis.pdf Nguyen, Nguyen (2011) Reasoning about resource-bounded multi-agent systems. PhD thesis, University of Nottingham. multi-agent systems intelligent agents ctl atl logics |
| spellingShingle | multi-agent systems intelligent agents ctl atl logics Nguyen, Nguyen Reasoning about resource-bounded multi-agent systems |
| title | Reasoning about resource-bounded multi-agent systems |
| title_full | Reasoning about resource-bounded multi-agent systems |
| title_fullStr | Reasoning about resource-bounded multi-agent systems |
| title_full_unstemmed | Reasoning about resource-bounded multi-agent systems |
| title_short | Reasoning about resource-bounded multi-agent systems |
| title_sort | reasoning about resource-bounded multi-agent systems |
| topic | multi-agent systems intelligent agents ctl atl logics |
| url | https://eprints.nottingham.ac.uk/11851/ |