Logic of plausibility for discovery in multi-agent environment deciding algorithms

In most popular hybrid logics from the field of Artificial Intelligence, knowledge is usually combined with other logical operations (e.g. awareness). We consider a hybrid logic LPD combining agent’s knowledge operations, linear time, operations for discovering information and plausibility operation. The plausibility operation is seemed to be quite new in this framework. The paper introduces LPD via semantical models based on special Kripke/Hintikka frames. We provide formation rules and rules for computing truth values of formulas in the chosen language inside such models, discuss properties of the described logic comparing to some other already known logics. The main problem we are focused on is finding an algorithm for recognition of satisfiable in LPD formulas, we propose such an algorithm (so we show that LPD is decidable w.r.t. satisfiability). The paper is completed with a short discussion on the essence and features of this algorithm