Pages that link to "Item:Q2265816"

The following pages link to Decision procedures and expressiveness in the temporal logic of branching time (Q2265816):

Displaying 50 items.

• Strategic reasoning with a bounded number of resources: the quest for tractability (Q2238736) (← links)
• A novel approach to verifying context free properties of programs (Q2290651) (← links)
• Model checking for hybrid branching-time logics (Q2291813) (← links)
• No easy puzzles: hardness results for jigsaw puzzles (Q2346997) (← links)
• A goal-directed decision procedure for hybrid PDL (Q2351150) (← links)
• Proof-based verification approaches for dynamic properties: application to the information system domain (Q2355384) (← links)
• Sequent calculi for branching time temporal logics of knowledge and beliefwith awareness: completeness and decidability (Q2376368) (← links)
• A branching distributed temporal logic for reasoning about entanglement-free quantum state transformations (Q2401638) (← links)
• To be fair, use bundles (Q2408744) (← links)
• The expressibility of fragments of hybrid graph logic on finite digraphs (Q2446549) (← links)
• A propositional linear time logic with time flow isomorphic to \(\omega^2\) (Q2447179) (← links)
• CTL update of Kripke models through protections (Q2453698) (← links)
• Model checking abilities of agents: a closer look (Q2481560) (← links)
• \(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\) (Q2500472) (← links)
• A general tableau method for propositional interval temporal logics: theory and implementation (Q2506829) (← links)
• An axiomatization of PCTL* (Q2566222) (← links)
• Deadness and how to disprove liveness in hybrid dynamical systems (Q2629097) (← links)
• Interleaving set temporal logic (Q2639046) (← links)
• Parameterized Complexity of CTL (Q2799205) (← links)
• Branching Time? Pruning Time! (Q2908510) (← links)
• Reasoning About Substructures and Games (Q2957764) (← links)
• Correctness and Worst-Case Optimality of Pratt-Style Decision Procedures for Modal and Hybrid Logics (Q3010369) (← links)
• Constructive Formalization of Hybrid Logic with Eventualities (Q3100197) (← links)
• Temporal Logic and Fair Discrete Systems (Q3176360) (← links)
• (Q3343431) (← links)
• One-Pass Tableaux for Computation Tree Logic (Q3498455) (← links)
• From Philosophical to Industrial Logics (Q3601803) (← links)
• A Labeled Natural Deduction System for a Fragment of CTL * (Q3605539) (← links)
• Reasoning about System-Degradation and Fault-Recovery with Deontic Logic (Q3623815) (← links)
• Branching-Time Temporal Logics with Minimal Model Quantifiers (Q3637242) (← links)
• On the Complexity of Branching-Time Logics (Q3644771) (← links)
• (Q3757893) (← links)
• TTL : a formalism to describe local and global properties of distributed systems (Q3992090) (← links)
• Church's Problem Revisited (Q4262605) (← links)
• A clausal resolution method for CTL branching-time temporal logic (Q4421285) (← links)
• On Non-local Propositional and Weak Monodic Quantified CTL* (Q4461349) (← links)
• (Q4475142) (← links)
• (Q4508400) (← links)
• (Q4636296) (← links)
• Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic (Q4639929) (← links)
• (Q4733384) (← links)
• Buy one, get one free!!! (Q4895547) (← links)
• (Q4941936) (← links)
• (Q4945790) (← links)
• An On-the-fly Tableau-based Decision Procedure for PDL-satisfiability (Q4982121) (← links)
• Completeness and Complexity of Multi-modal CTL (Q4982125) (← links)
• (Q5015276) (← links)
• Probabilistic Temporal Logics (Q5024714) (← links)
• Undecidability of QLTL and QCTL with two variables and one monadic predicate letter (Q5059700) (← links)
• Extending Fairness Expressibility of ECTL+: A Tree-Style One-Pass Tableau Approach (Q5079769) (← links)