One-Pass Tableaux for Computation Tree Logic-Reference-Cited by-同舟云学术

One-Pass Tableaux for Computation Tree Logic

Published: Issue: Volume: Page:32-46
ISSN:
Container-title:Logic for Programming, Artificial Intelligence, and Reasoning
language:
Short-container-title:

Author:

Abate Pietro,Goré Rajeev,Widmann Florian

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-75560-9_5.pdf

Reference24 articles.

1. Abate, P.: The Tableau Workbench: a framework for building automated tableau-based theorem provers. PhD thesis, The Australian National University (2006)

2. Lecture Notes in Artificial Intelligence;F. Baader,2001

3. Baader, F.: Augmenting concept languages by transitive closure of roles: an alternative to terminological cycles. Technical Report, DFKI (1990)

4. Basukoski, A., Bolotov, A.: A clausal resolution method for branching time logic ECTL+. Annals of Mathematics and Artificial Intelligence 46(3), 235–263 (2006)

5. Ben-Ari, M., Manna, Z., Pnueli, A.: The temporal logic of branching time. In: Proceedings of Principles of Programming Languages (1981)

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Tableaux and sequent calculi for CTL and ECTL: Satisfiability test with certifying proofs and models;Journal of Logical and Algebraic Methods in Programming;2023-01

2. Branching-time logic ECTL# and its tree-style one-pass tableau: Extending fairness expressibility of ECTL+;Theoretical Computer Science;2020-04

3. Temporal Logics in Computer Science;CAM T THEOR;2016

4. A resolution calculus for the branching-time temporal logic CTL;ACM Transactions on Computational Logic;2014-02

5. And-Or Tableaux for Fixpoint Logics with Converse: LTL, CTL, PDL and CPDL;Automated Reasoning;2014