Multi-Agent Logics with Multi-Valuations and Intensional Logical Operations

We consider a multi-agent logic based on linear temporal logic. This logic uses as the semantics relational temporal models with multi-valuations-the models have separate valuations for all agents. We introduce in the logical language two new intensional logical operations-plausibleanddominates-to capture the feature of uncertainty. The main mathematical problem we are dealing with is the satisfiability problem. We solve it and find deciding algorithm. In the final part of paper we discuss interesting open problems for possible further investigations.