Abstract:
We study intransitive temporal multi-agent logic with agents' multi-valuations for formulas letters. This logic is defined in a semantic as a set of formulas which are true at linear models with multi-valued variables and clusters of states. We propose a background for such approach and a technique for computation truth values of formulas. Main results concerns solvability problem, we prove that the resulting logic is decidable.
Keywords:frame and Kripke model, multi-agent logics, NLM-logics, decidability problem.
UDC:
510.665, 510.643
Received: 10.08.2024 Received in revised form: 05.03.2025 Accepted: 04.06.2025