Welcome to the InfoSci Platform
Reference Hub3
Algorithm for Decision Procedure in Temporal Logic Treating Uncertainty, Plausibility, Knowledge and Interacting Agents

Algorithm for Decision Procedure in Temporal Logic Treating Uncertainty, Plausibility, Knowledge and Interacting Agents

V. Rybakov
Copyright: © 2010 |Volume: 6 |Issue: 1 |Pages: 15
ISSN: 1548-3657|EISSN: 1548-3665|ISSN: 1548-3657|EISBN13: 9781616929183|EISSN: 1548-3665|DOI: 10.4018/jiit.2010100903
Cite Article Cite Article

MLA

Rybakov, V. "Algorithm for Decision Procedure in Temporal Logic Treating Uncertainty, Plausibility, Knowledge and Interacting Agents." IJIIT vol.6, no.1 2010: pp.31-45. http://doi.org/10.4018/jiit.2010100903

APA

Rybakov, V. (2010). Algorithm for Decision Procedure in Temporal Logic Treating Uncertainty, Plausibility, Knowledge and Interacting Agents. International Journal of Intelligent Information Technologies (IJIIT), 6(1), 31-45. http://doi.org/10.4018/jiit.2010100903

Chicago

Rybakov, V. "Algorithm for Decision Procedure in Temporal Logic Treating Uncertainty, Plausibility, Knowledge and Interacting Agents," International Journal of Intelligent Information Technologies (IJIIT) 6, no.1: 31-45. http://doi.org/10.4018/jiit.2010100903

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Our article studies logic UIALTL, which is a combination of the linear temporal logic LTL, a multi-agent logic with operation for passing knowledge via agents’ interaction, and a suggested logic based on operation of logical uncertainty. The logical operations of UIALTL also include (together with operations from LTL) operations of strong and weak until, agents’ knowledge operations, operation of knowledge via interaction, operation of logical uncertainty, the operations for environmental and global knowledge. UIALTL is defined as a set of all formulas valid at all Kripke-Hintikka like models NC. Any frame NC represents possible unbounded (in time) computation with multi-processors (parallel computational units) and agents’ channels for connections between computational units. The main aim of our article is to determine possible ways for computation logical laws of UIALTL. Principal problems we are dealing with are decidability and the satisfiability problems for UIALTL. We find an algorithm which recognizes theorems of UIALTL (so we show that UIALTL is decidable) and solves satisfiability problem for UIALTL. As an instrument we use reduction of formulas to rules in the reduced normal form and a technique to contract models NC to special non-UIALTL-models, and, then, verification of validity these rules in models of bounded size. The article uses standard results from non-classical logics based on Kripke-Hintikka models.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.