Name
Abstract | ||
|---|---|---|
This paper studies knowledge representation in multi-agent environment. We investigate technique for computation truth-values of statements based at a new temporal, agent's-knowledge logic TL. A logical language, mathematical symbolic models and a temporal logic TL based at these models are suggested. We find an algorithm which computes theorems of TL and satisfiability of statements, this implies that TL is decidable (i.e. -- the satisfiability problem for TL is solvable). Application areas are pointed and discussed. |
Year | Venue | Field |
|---|---|---|
2014 | CoRR | Discrete mathematics,Knowledge representation and reasoning,Boolean satisfiability problem,Satisfiability,Algorithm,Decidability,Temporal logic,Mathematics,Computation |
DocType | Volume | Citations |
Journal | abs/1406.5495 | 0 |
PageRank | References | Authors |
0.34 | 11 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Maybin K. Muyeba | 1 | 47 | 7.61 |
| Vladimir V. Rybakov | 2 | 268 | 31.70 |