Logic of Plausibility for Discovery in multi-agent environment. Decision algorithms
by Sergey Babenyshev, Vladimir Rybakov
International Journal of Intelligent Defence Support Systems (IJIDSS), Vol. 2, No. 1, 2009

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.

Online publication date: Fri, 31-Jul-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Defence Support Systems (IJIDSS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com