Logic of the Hide and Seek Game: Characterization, Axiomatization, Decidability

by   Qian Chen, et al.

The logic of the hide and seek game LHS was proposed to reason about search missions and interactions between agents in pursuit-evasion environments. As proved in literature, having an equality constant in the language of LHS drastically increases its computational complexity: the satisfiability problem for LHS with multiple relations is undecidable. In this work we improve the existing result by showing that LHS with a single relation is undecidable. With the existing findings, we provide a van Benthem style characterization theorem for the expressive power of the logic. Finally, by `splitting' the language of LHS-, a crucial fragment of LHS without the equality constant, into two `isolated parts', we provide a complete Hilbert style proof system for LHS- and prove that its satisfiability problem is decidable, whose proofs would indicate significant differences between the proposals of LHS- and of ordinary product logics. Although LHS and LHS- are frameworks for interactions of 2 agents, all results in the article can be easily transferred to their generalizations for settings with any n > 2 agents.


page 1

page 2

page 3

page 4


The Fluted Fragment with Transitive Relations

We study the satisfiability problem for the fluted fragment extended wit...

The Modal Logic of Stepwise Removal

We investigate the modal logic of stepwise removal of objects, both for ...

EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness

It is known that the satisfiability problems of the product logics K4xS5...

Internal Calculi for Separation Logics

We present a general approach to axiomatise separation logics with heapl...

HyperLTL Satisfiability is Σ_1^1-complete, HyperCTL* Satisfiability is Σ_1^2-complete

Temporal logics for the specification of information-flow properties are...

On the Satisfiability of Local First-Order Logics with Data

We study first-order logic over unordered structures whose elements carr...

Theories of real addition with and without a predicate for integers

We show that it is decidable whether or not a relation on the reals defi...

Please sign up or login with your details

Forgot password? Click here to reset