On the boundary of (un)decidability: decidable model-checking for a fragment of resource agent logic

Alechina, Natasha; Bulling, Nils; Logan, Brian; Nguyen, Hoang Nga

Abstract

The model-checking problem for Resource Agent Logic is known to be undecidable. We review existing (un)decidability results and identify a significant fragment of the logic for which model checking is decidable. We discuss aspects which makes model checking decidable and prove undecidability of two open fragments over a class of models in which agents always have a choice of doing nothing.

Citation

Alechina, N., Bulling, N., Logan, B., & Nguyen, H. N. (2015). On the boundary of (un)decidability: decidable model-checking for a fragment of resource agent logic.

• Conference Name: International Joint Conference on Artificial Intelligence (IJCAI-15)
• End Date: Jul 31, 2015
• Publication Date: Jul 25, 2015
• Deposit Date: Sep 18, 2015
• Publicly Available Date: Sep 18, 2015
• Peer Reviewed: Peer Reviewed
• Public URL: https://nottingham-repository.worktribe.com/output/756267
• Publisher URL: http://ijcai.org/papers15/Papers/IJCAI15-214.pdf
• Additional Information: Published in: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence. Palo Alto, Calif. : AAAI Press/International Joint Conferences on Artificial Intelligence, 2015. ISBN: 9781577357384