Decidability of Quantifed Propositional Branching Time Logics
AI '01 Proceedings of the 14th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Decision procedures and expressiveness in the temporal logic of branching time
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A Temporal Logic of Robustness
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Normative pragmatics for agent communication languages
ER'05 Proceedings of the 24th international conference on Perspectives in Conceptual Modeling
Designing normative behaviour via landmarks
AAMAS'05 Proceedings of the 2005 international conference on Agents, Norms and Institutions for Regulated Multi-Agent Systems
A resolution calculus for the branching-time temporal logic CTL
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
It can be desirable to specify polices that require a system to achieve some outcome even if a certain number of failures occur. The temporal logic of robustness RoCTL* extends CTL* with operators from Deontic logic, and a novel operator referred to as "Robustly" [7]. The only known decision procedure for RoCTL* involves a reduction to QCTL*. This paper presents a tableau for the related bundled tree logic RoBCTL*; this is the first decision procedure for RoBCTL*, and although non-elementary in degenerate cases has much better performance than the QCTL* based decision procedure for RoCTL*. The degenerate cases where this tableau performs poorly provide clues as to where we might look to prove that RoBCTL* is non-elementary.