An On-the-fly Tableau-based Decision Procedure for PDL-satisfiability-Reference-Cited by-同舟云学术

An On-the-fly Tableau-based Decision Procedure for PDL-satisfiability

Published:2009-03 Issue: Volume:231 Page:191-209
ISSN:1571-0661
Container-title:Electronic Notes in Theoretical Computer Science
language:en
Short-container-title:Electronic Notes in Theoretical Computer Science

Author:

Abate Pietro,Goré Rajeev,Widmann Florian

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference18 articles.

1. One-pass tableaux for computation tree logic;Abate,2007

2. About cut elimination for logics of common knowledge;Alberucci;Annal of Pure and Applied Logic,2005

3. Baader, F. Augmenting concept languages by transitive closure of roles: an alternative to terminological cycles. Technical Report RR-90-13, DFKI, Kaiserslautern, Germany, 1990

4. Ben-Ari, M., Z. Manna, and A. Pnueli. The temporal logic of branching time. In Proc. Eighth ACM Symposium on Principles of Programming Languages, pages 164–176, 1981

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

1. SAT Meets Tableaux for Linear Temporal Logic Satisfiability;Journal of Automated Reasoning;2024-03-15

2. A SAT-Based Encoding of the One-Pass and Tree-Shaped Tableau System for LTL;Lecture Notes in Computer Science;2019

3. Completeness and decidability of converse PDL in the constructive type theory of Coq;Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs;2018-01-08

4. ExpTime Tableaux with Global Caching for Graded Propositional Dynamic Logic;Fundamenta Informaticae;2016-11-17

5. A Goal-Directed Decision Procedure for Hybrid PDL;Journal of Automated Reasoning;2013-10-24