Logic of Plausibility for Discovery in multi-agent environment. Decision algorithms

Abstract

In most popular logics from the field of Artificial Intelligence (AI), knowledge is usually combined with other logical operations (e.g., awareness). We present a Logic of Plausibility for Discovery (LPD) combining agents' knowledge operations, linear time, operations for discovering information and plausibility operation. LPD is introduced via semantic models based on special Kripke frames. The main problem we focus on is finding an algorithm for recognising satisfiable in LPD formulas. We propose such an algorithm (so we show that LPD is decidable w.r.t. satisfiability). The paper is concluded with a short discussion on the essence and features of this algorithm.