Pages that link to "Item:Q4982095"

The following pages link to The Complexity of Satisfiability for Fragments of CTL and CTL⋆ (Q4982095):

Displaying 16 items.

• A purely model-theoretic proof of the exponential succinctness gap between CTL\(^{+}\) and CTL (Q975478) (← links)
• The complexity of propositional implication (Q989577) (← links)
• Complexity and expressivity of branching- and alternating-time temporal logics with finitely many variables (Q1623150) (← links)
• Complexity results for modal dependence logic (Q1956378) (← links)
• Intention as commitment toward time (Q1989411) (← links)
• The model checking fingerprints of CTL operators (Q2317834) (← links)
• Erratum to: ``The complexity of satisfiability for fragments of CTL and \(\mathrm{CTL}^\star\)'' (Q2800418) (← links)
• The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I (Q3182957) (← links)
• A Decidable Spatial Logic with Cone-Shaped Cardinal Directions (Q3644762) (← links)
• THE COMPLEXITY OF SATISFIABILITY FOR FRAGMENTS OF CTL AND CTL⋆ (Q3646173) (← links)
• Flat fragments of CTL and CTL: separating the expressive and distinguishing powers (Q4238500) (← links)
• Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic (Q4639929) (← links)
• Developments in Language Theory (Q5711966) (← links)
• An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning (Q5918962) (← links)
• An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning (Q5925549) (← links)
• HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete. (Q6168463) (← links)