Scholarlink

In this chapter we discuss a modal logic of substitutions which provide us a way to describe winning strategies in hide and seek game played over any game graph. To this end, a modal logic of iterated substitutions is proposed, and a number of properties of this logic are explored including their expressive strength and satisfiability problems. The proposed framework is also compared with the existing ones involving iterative reasoning, which in turn showcases certain advantages of the proposal.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Modelling Strategies in Hide and Seek Game: A Substitution Approach

  • 章节

  • 发表日期：

    2026年

查看全文
  • Yaxin Tu,
  • Sujata Ghosh,
  • Fenrong Liu,
  • Dazhu Li

摘要

In this chapter we discuss a modal logic of substitutions which provide us a way to describe winning strategies in hide and seek game played over any game graph. To this end, a modal logic of iterated substitutions is proposed, and a number of properties of this logic are explored including their expressive strength and satisfiability problems. The proposed framework is also compared with the existing ones involving iterative reasoning, which in turn showcases certain advantages of the proposal.