A Tableau for Bundled Strategies

DOI10.1007/978-3-319-24312-2_3zbMath1471.03039OpenAlexW2236969929MaRDI QIDQ3455759

John C. McCabe-Dansted, M. A. Reynolds

Publication date: 11 December 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-24312-2_3

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Temporal logic (03B44) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items

A Tableau for Bundled Strategies

Cites Work

• Unnamed Item
• A tableau-based decision procedure for CTL\(^*\)
• A Rooted Tableau for BCTL*
• Optimal Tableaux-Based Decision Procedure for Testing Satisfiability in the Alternating-Time Temporal Logic ATL+
• A Tableau for Bundled CTL
• Alternating-time temporal logic
• A Tableau for Bundled Strategies
• ATL* Satisfiability Is 2EXPTIME-Complete
• Deciding full branching time logic
• The Complexity of Tree Automata and Logics of Programs
• On Non-local Propositional and Weak Monodic Quantified CTL*
• A Decision Procedure for CTL* Based on Tableaux and Automata
• Axioms for Branching Time