Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Completeness of two fragments of a logic for conditional strategic reasoning (2405.11418v2)

Published 19 May 2024 in cs.LO

Abstract: Classical logics for strategic reasoning, such as Coalition Logic and Alternating-time Temporal Logic, formalize absolute strategic reasoning about the unconditional strategic abilities of agents to achieve their goals. Goranko and Ju, in two papers, introduced a Logic for Conditional Strategic Reasoning (CSR). However, its completeness is still an open problem. CSR has three featured operators, and one of them has the following reading: For some action of A that guarantees the achievement of her goal, B has an action to guarantee the achievement of his goal. This operator makes good sense when A is cooperating with B. The logic about this operator is called Logic for Cooperating Conditional Strategic Reasoning (CCSR). In this paper, we prove the completeness of two fragments of CCSR: the liability fragment and the ability fragment. The key ingredients of our proof approach include standard disjunctions, the validity-reduction condition of standard disjunctions, abstract game forms, and their realization, and the derivability-reduction condition of standard disjunctions. The approach has good potential to be applied to the completeness of CSR and other strategic logics.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (14)
  1. Alternating-time temporal logic. J. ACM, 49(5):672–713, 2002.
  2. Models of Strategic Reasoning - Logics, Games, and Communities, volume 8972 of Lecture Notes in Computer Science. Springer, 2015.
  3. The temporal logic of coalitional goal assignments in concurrent multiplayer games. ACM Transactions on Computational Logic, 23(4), 2022.
  4. Complete axiomatization and decidablity of alternating-time temporal logic. Theoretical Computer Science, 353:93–117, 2006.
  5. Socially friendly and group protecting coalition logics. In Proceedings of AAMAS 2018, pages 372–380, 2018.
  6. Towards a logic for conditional local strategic reasoning. In Patrick Blackburn, Emiliano Lorini, and Meiyun Guo, editors, Logic, Rationality, and Interaction - 7th International Workshop, LORI 2019, Chongqing, China, October 18-21, 2019, Proceedings, volume 11813 of Lecture Notes in Computer Science, pages 112–125. Springer, 2019.
  7. A logic for conditional local strategic reasoning. Journal of Logic, Language and Information, 31(2):167–188, 2022.
  8. Wiebe van der Hoek and Michael Wooldridge. Cooperation, knowledge, and time: Alternating-time temporal epistemic logic and its applications. Studia Logica, 75(1):125–157, 2004.
  9. Reasoning about strategies: On the model-checking problem. ACM Transactions on Computational Logic, 15(4):34:1–34:47, 2014.
  10. Reasoning about strategies: On the satisfiability problem. Logical Methods in Computer Science, 13(1), 2017.
  11. Intelligence in strategic games. Journal of Artificial Intelligence Research, 71:521–556, 2021.
  12. Marc Pauly. Logic for social software, 2001. PhD thesis, University of Amsterdam.
  13. Marc Pauly. A modal logic for coalitional power in games. Journal of Logic and Computation, 12(1):149–166, 2002.
  14. Knowledge and ability. In Hans van Ditmarsch, Joseph Halpern, Wiebe van der Hoek, and Barteld Kooi, editors, Handbook of Epistemic Logic, pages 543–589. College Publications, 2015.

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com