Glamorgan DSpace >
University of South Wales >
Advanced Technology >
Computer Science >
Please use this identifier to cite or link to this item:
|Title: ||On the (un-)decidability of model-checking resource-bounded agents|
|Authors: ||Muller, Berndt|
|Issue Date: ||3-May-2012|
|Citation: ||Bulling, N. and Farwar, B. (2010) 'On the (un-)decidability of model-checking resource-bounded agents', in Coelho, H., Studer, R. and Wooldridge (eds.) Frontiers in artificial intelligence and applications, vol. 215, ECAI 2010 - 19th European Conference on Artificial Intelligence, Lisbon, Portugal, 16-20 August. : IOS Press.|
|Abstract: ||The verification and modelling of multi-agent systems is an important topic that has attracted much attention in recent years. Resources, however, have only recently been studied as simple extensions to well-known logics. Trying to find a set of useful features while retaining essential properties for practical use, we explore the question: Where are the limits of what can be verified about resource-bounded agents? We try to answer this question by considering several natural logic-based settings that may arise and prove that verification is usually undecidable apart from bounded or otherwise restrictive settings. Most interestingly, we identify various factors that influence the (un-)decidability and provide grounds for future research on more promising constraints leading to decidable fragments.|
|Appears in Collections:||Computer Science|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.