Pages that link to "Item:Q3519515"

The following pages link to ATL* Satisfiability Is 2EXPTIME-Complete (Q3519515):

Displaying 21 items.

• Model-checking iterated games (Q1674862) (← links)
• Solving parity games via priority promotion (Q1742991) (← links)
• Alternating-time temporal logics with linear past (Q1989330) (← links)
• Complexity of finite-variable fragments of propositional temporal and modal logics of computation (Q2148903) (← links)
• Model checking and strategy synthesis for multi-agent systems for resource allocation (Q2154045) (← links)
• Robust worst cases for parity games algorithms (Q2182730) (← links)
• Natural strategic ability (Q2289013) (← links)
• Model checking open systems with alternating projection temporal logic (Q2424878) (← links)
• Reasoning About Strategies (Q2946746) (← links)
• (Q3384167) (← links)
• (Q3384177) (← links)
• Deciding $$\mathsf {ATL^*}$$ Satisfiability by Tableaux (Q3454093) (← links)
• A Tableau for Bundled Strategies (Q3455759) (← links)
• Undecidability of QLTL and QCTL with two variables and one monadic predicate letter (Q5059700) (← links)
• Results on alternating-time temporal logics with linear past (Q5079770) (← links)
• Optimal Tableau Method for Constructive Satisfiability Testing and Model Synthesis in the Alternating-Time Temporal Logic ATL ⁺ (Q5277905) (← links)
• Taming strategy logic: non-recurrent fragments (Q6077842) (← links)
• HyperATL*: A Logic for Hyperproperties in Multi-Agent Systems (Q6135762) (← links)
• HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete. (Q6168463) (← links)
• Robust alternating-time temporal logic (Q6545584) (← links)
• Priority promotion with Parysian flair (Q6627044) (← links)