Conference item icon

Conference item

On computational tractability for rational verification

Abstract:

Rational verification involves checking which temporal logic properties hold of a concurrent/multiagent system, under the assumption that agents in the system choose strategies in game theoretic equilibrium. Rational verification can be understood as a counterpart of model checking for multiagent systems, but while model checking can be done in polynomial time for some temporal logic specification languages such as CTL, and polynomial space with LTL specifications, rational verification is mu...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
  • (Version of record, pdf, 157.8KB)
Publisher copy:
10.24963/ijcai.2019/47

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
More by this author
Institution:
University of Oxford
Division:
MPLS Division
Department:
Computer Science
Role:
Author
More by this author
Institution:
University of Oxford
Division:
MPLS Division
Department:
Computer Science
Role:
Author
Publisher:
International Joint Conferences on Artificial Intelligence
Host title:
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence
Journal:
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence More from this journal
Pages:
329-335
Publication date:
2019-08-10
Acceptance date:
2019-05-09
DOI:
ISSN:
1045-0823
Pubs id:
pubs:1022974
UUID:
uuid:f9bc4d0e-e2b6-4035-89fb-ffdce2060e01
Local pid:
pubs:1022974
Source identifiers:
1022973
Deposit date:
2019-06-26

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP