The Complexity of Model Checking Succinct Multiagent Systems
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence. Main Track. Pages 1076-1081.
Abstract
This paper studies the complexity of model checking multiagent systems, in particular systems succinctly described by two practical representations: concurrent representation and symbolic representation. The logics we concern include branching time temporal logics and several variants of alternating time temporal logics.
Xiaowei Huang, Qingliang Chen, and Kaile Su. 2015. The Complexity of Model Checking Succinct Multiagent Systems. In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI-15. IJCAI, 1076–1081. https://ijcai.org/proceedings/2015/156
Huang, X., Chen, Q., & Su, K. (2015). The Complexity of Model Checking Succinct Multiagent Systems. In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI-15 (pp. 1076–1081). IJCAI. https://ijcai.org/proceedings/2015/156
@inproceedings{ijcai2015p156,
title = {The Complexity of Model Checking Succinct Multiagent Systems},
author = {Huang, Xiaowei and Chen, Qingliang and Su, Kaile},
booktitle = {Proceedings of the Twenty-Fourth International Joint Conference on
Artificial Intelligence, {IJCAI-15}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Qiang Yang and Michael Wooldridge},
pages = {1076--1081},
year = {2015},
month = {7},
note = {Main Track},
url = {https://ijcai.org/proceedings/2015/156},
}
TY - CPAPER TI - The Complexity of Model Checking Succinct Multiagent Systems AU - Huang, Xiaowei AU - Chen, Qingliang AU - Su, Kaile T2 - Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI-15 PB - International Joint Conferences on Artificial Intelligence PY - 2015 SP - 1076 EP - 1081 UR - https://ijcai.org/proceedings/2015/156 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
