TTM

swMATH11997MaRDI QIDQ23931FDOQ23931

Author name not available (Why is that?)

Cited In (15)

• Extending fairness expressibility of ECTL\(^+\): a tree-style one-pass tableau approach
• Branching-time logic \(\mathsf{ECTL}^{\#}\) and its tree-style one-pass tableau: extending fairness expressibility of \(\mathsf{ECTL}^+\)
• Loop-type sequent calculi for temporal logic
• Systematic semantic tableaux for PLTL
• A new rule for LTL tableaux
• A Cut-Free and Invariant-Free Sequent Calculus for PLTL
• Cut-free sequent systems for temporal logic
• Tableaux and sequent calculi for \textsf{CTL} and \textsf{ECTL}: satisfiability test with certifying proofs and models
• More efficient proof-search for sequents of temporal logic
• On the proof theory of the modal mu-calculus
• An axiomatization of ECTL
• A derivation-loop method for temporal logic
• Invariant-free clausal temporal resolution
• Generalized qualitative spatio-temporal reasoning: complexity and tableau method
• Dual systems of tableaux and sequents for PLTL

This page was built for software: TTM