The following pages link to (Q4475142):
Displaying 21 items.
- Completeness of a branching-time logic with possible choices (Q622622) (← links)
- \(\mathsf{QCTL}\) model-checking with \(\mathsf{QBF}\) solvers (Q821566) (← links)
- Augmenting ATL with strategy contexts (Q897650) (← links)
- Simple interpretations among complicated theories (Q923068) (← links)
- Characterizing finite Kripke structures in propositional temporal logic (Q1123183) (← links)
- \(R\)-generability, and definability in branching time logics (Q1197983) (← links)
- On the expressivity and complexity of quantitative branching-time temporal logics (Q1401306) (← links)
- Decision procedures and expressiveness in the temporal logic of branching time (Q2265816) (← links)
- Definability and decidability of binary predicates for time granularity (Q2495389) (← links)
- An epistemic predicate \(\mathrm{CTL}^{*}\) for finite control \(\pi\)-processes (Q2825420) (← links)
- QBF Encoding of Temporal Properties and QBF-Based Verification (Q3192192) (← links)
- On the Notion of Vacuous Truth (Q3498452) (← links)
- (Q3757893) (← links)
- Pure Logic with Branched Quantifiers (Q3795664) (← links)
- On Non-local Propositional and Weak Monodic Quantified CTL* (Q4461349) (← links)
- (Q4508400) (← links)
- Parity Automata for Quantitative Linear Time Logics (Q4580202) (← links)
- Expressiveness and succinctness of a logic of robustness (Q4586143) (← links)
- Quantifying Bounds in Strategy Logic (Q5079747) (← links)
- (Q5101338) (← links)
- Good-for-Game QPTL: An Alternating Hodges Semantics (Q5875946) (← links)
