Pages that link to "Item:Q3498455"
From MaRDI portal
The following pages link to One-Pass Tableaux for Computation Tree Logic (Q3498455):
Displayed 13 items.
- Invariant-free clausal temporal resolution (Q352974) (← links)
- Syntactic cut-elimination for common knowledge (Q1024553) (← links)
- Dual systems of tableaux and sequents for PLTL (Q1035676) (← links)
- Branching-time logic \(\mathsf{ECTL}^{\#}\) and its tree-style one-pass tableau: extending fairness expressibility of \(\mathsf{ECTL}^+\) (Q1989347) (← links)
- Tableaux and sequent calculi for \textsf{CTL} and \textsf{ECTL}: satisfiability test with certifying proofs and models (Q2095426) (← links)
- Efficient SAT-based minimal model generation methods for modal logic S5 (Q2118302) (← links)
- The Proof Theory of Common Knowledge (Q3299587) (← links)
- An On-the-fly Tableau-based Decision Procedure for PDL-satisfiability (Q4982121) (← links)
- Syntactic Cut-elimination for Common Knowledge (Q4982123) (← links)
- Modal Logic S5 Satisfiability in Answer Set Programming (Q5019595) (← links)
- A Refined Resolution Calculus for CTL (Q5191106) (← links)
- A resolution calculus for the branching-time temporal logic CTL (Q5410337) (← links)
- One-pass Context-based Tableaux Systems for CTL and ECTL (Q6060101) (← links)