And-or tableaux for fixpoint logics with converse: LTL, CTL, PDL and CPDL

DOI10.1007/978-3-319-08587-6_3zbMATH Open1423.68415OpenAlexW87797281MaRDI QIDQ3192179FDOQ3192179

Authors: Rajeev Goré 

Publication date: 26 September 2014

Published in: Automated Reasoning (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1885/74602

Recommendations

• A tableau-based decision procedure for CTL\(^*\)
• A new rule for LTL tableaux
• One-Pass Tableaux for Computation Tree Logic
• Combining deduction and model checking into tableaux and algorithms for converse-PDL.
• A faster tableau for \(\mathrm{CTL}^{\ast}\)

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in artificial intelligence (68T27) Mechanization of proofs and logical operations (03B35) Temporal logic (03B44)

Cited In (7)

• The proof theory of common knowledge
• Tableaux and sequent calculi for \textsf{CTL} and \textsf{ECTL}: satisfiability test with certifying proofs and models
• Theorem proving for pointwise metric temporal logic over the naturals via translations
• One-pass Context-based Tableaux Systems for CTL and ECTL
• Combining deduction and model checking into tableaux and algorithms for converse-PDL.
• ExpTime tableaux with global caching for hybrid PDL
• Verified Decision Procedures for Modal Logics.

This page was built for publication: And-or tableaux for fixpoint logics with converse: LTL, CTL, PDL and CPDL

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192179)