Logics of time and computation
Logics of time and computation
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Hereditarily structurally complete modal logics
Journal of Symbolic Logic
Reasoning about knowledge
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
IEEE Intelligent Systems
Improved Automata Generation for Linear Temporal Logic
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Another Look at LTL Model Checking
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Undecidability of a multi-agent logic
Fundamenta Informaticae - Concurrency specification and programming
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
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
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
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
A framework to compute inference rules valid in agents' temporal logics
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part I
Inference rules in multi-agents' temporal logics
Transactions on computational collective intelligence IV
| Hi-index | 0.00 |
Our paper considers a hybrid $\mathrm{LTL}_{\mathcal{ACK}}$ between the multi-agent logic with the local common knowledge operation and an extended version of the linear temporal logic $\mathcal{LTL}$. The logic is based on the semantics of Kripe/Hintikka models with potentially infinite runs and the time points represented by clusters of states with agents' accessibility relations. We study the satisfiability problem for $\mathrm{LTL}_{\mathcal{ACK}}$ and related decidability problem. The key result is an algorithm which recognizes theorems of $\mathrm{LTL}_{\mathcal{ACK}}$ (so we show that $\mathrm{LTL}_{\mathcal{ACK}}$ is decidable), which, as a consequence, also solves the satisfiability problem. Technique is based on verification of validity for special normal reduced forms of rules in models of double exponential in the size of rules.