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

Authors: Sergey Babenyshev, Vladimir Rybakov

Addresses: Department of Computing and Mathematics, Manchester Metropolitan University, John Dalton Building, Chester Street, Manchester M1 5GD, UK; Institute of Mathematics, Siberian Federal University, 79, Svobodny Prospect, Krasnoyarsk 660041, Russia. ' Department of Computing and Mathematics, Manchester Metropolitan University, John Dalton Building, Chester Street, Manchester M1 5GD, UK; Institute of Mathematics, Siberian Federal University, 79, Svobodny Prospect, Krasnoyarsk 660041, Russia

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.

Keywords: hybrid logics; plausibility; multi-agent reasoning; linear temporal logic; decision algorithms; Kripke-Hintikka models; semantic modelling; information discovery.

DOI: 10.1504/IJIDSS.2009.027549

International Journal of Intelligent Defence Support Systems, 2009 Vol.2 No.1, pp.34 - 44

Published online: 31 Jul 2009 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article