Hereditarily structurally complete modal logics
Journal of Symbolic Logic
Reasoning about knowledge
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
Another Look at the Logical Uncertainty Principle
Information Retrieval
Foreword: Logics of Uncertainty
Journal of Logic, Language and Information
Another Look at LTL Model Checking
Formal Methods in System Design
IEEE Intelligent Systems
Reasoning about The Past with Two-Way Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Acceptability of arguments as `logical uncertainty'
ECSQARU '93 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
Model Checking Knowledge and Time in Systems with Perfect Recall (Extended Abstract)
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Improved Automata Generation for Linear Temporal Logic
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
A Deductive Proof System for CTL
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Complexity of some problems in positive and related calculi
Theoretical Computer Science - Logic and complexity in computer science
Mathematical modal logic: a view of its evolution
Journal of Applied Logic
Annals of Mathematics and Artificial Intelligence
Reasoning about common knowledge with infinitely many agents
Information and Computation
Model Checking Rational Agents
IEEE Intelligent Systems
Temporal Development Methods for Agent-Based
Autonomous Agents and Multi-Agent Systems
Logical Consecutions in Intransitive Temporal Linear Logic of Finite Intervals
Journal of Logic and Computation
Until-Since Temporal Logic Based on Parallel Time with Common Past. Deciding Algorithms
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Multi-agent Logics with Interacting Agents Based on Linear Temporal Logic: Deciding Algorithms
ICAISC '08 Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing
Logic of Plausibility for Discovery in Multi-agent Environment Deciding Algorithms
KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III
Logic of Discovery in Uncertain Situations--- Deciding Algorithms
KES '07 Knowledge-Based Intelligent Information and Engineering Systems and the XVII Italian Workshop on Neural Networks on Proceedings of the 11th International Conference
Linear temporal logic with until and before on integer numbers, deciding algorithms
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Undecidability of a Multi-Agent Logic
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 1
KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part I
Chance discovery and unification in linear modal logic
KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part II
| Hi-index | 0.00 |
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.