Strategic Reasoning with a Bounded Number of Resources: the Quest for Tractability

Autor: Francesco Belardinelli, Stéphane Demri

Publikováno v: Artificial Intelligence
Artificial Intelligence, 2021, 300, pp.103557. ⟨10.1016/j.artint.2021.103557⟩
Artificial Intelligence, Elsevier, 2021, 300, pp.103557. ⟨10.1016/j.artint.2021.103557⟩

International audience; The resource-bounded alternating-time temporal logic RB±ATL combines strategic reasoning with reasoning about resources. Its model-checking problem is known to be 2EXPTIME-complete (the same as its proper extension RB±ATL$^�

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0f79213dfba908036b155521646e7073
https://hal.science/hal-03298703/document

Model Checking for the Full Hybrid Computation Tree Logic.

Autor: Kernberger, Daniel, Lange, Martin

Publikováno v: 2016 23rd International Symposium on Temporal Representation & Reasoning (TIME); 2016, p31-40, 10p

Verifying Correctness of Transactional Memories.

Autor: Cohen, Ariel, O'Leary, John W., Pnueli, Amir, Tuttle, Mark R., Zuck, Lenore D.

Publikováno v: Formal Methods in Computer Aided Design (FMCAD'07); 2007, p37-44, 8p

Computer Aided Verification : 20th International Conference, CAV 2008 Princeton, NJ, USA, July 7-14, 2008, Proceedings

Autor: Aarti Gupta, Sharad Malik

This book constitutes the refereed proceedings of the 20th International Conference on Computer Aided Verification, CAV 2008, held in Princeton, NJ, USA, in July 2008. The 33 revised full papers presented together with 14 tool papers and 2 invited pa

Intensional Programming Ii

Autor: Ian T Jolliffe, Manolis Gergatsoulis, Panos Rondogiannis

There is a growing interest in programming languages and systems based on nonclassical logics such as temporal logics, interval logics, modal and intuitionistic logics. In fact, a whole new programming paradigm called'intensional programming'has been