The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Simple on-the-fly automatic verification of linear temporal logic
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
Efficient Loop-Check for Backward Proof Search in Some Non-classical Propositional Logics
TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
Propositional Logics on the Computer
TABLEAUX '95 Proceedings of the 4th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
A Decision Algorithm for Full Propositional Temporal Logic
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
ACM Transactions on Computational Logic (TOCL)
Improved Automata Generation for Linear Temporal Logic
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Systematic Semantic Tableaux for PLTL
Electronic Notes in Theoretical Computer Science (ENTCS)
A Cut-Free Sequent Calculus for Bi-intuitionistic Logic
TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
An On-the-fly Tableau-based Decision Procedure for PDL-satisfiability
Electronic Notes in Theoretical Computer Science (ENTCS)
Combining spatial and temporal logics: expressiveness vs. complexity
Journal of Artificial Intelligence Research
Decidability for Priorean Linear Time Using a Fixed-Point Labelled Calculus
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
FM '09 Proceedings of the 2nd World Congress on Formal Methods
One-pass tableaux for computation tree logic
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Tableau Tool for Testing Satisfiability in LTL: Implementation and Experimental Analysis
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Coalition Description Logic with Individuals
Electronic Notes in Theoretical Computer Science (ENTCS)
Evaluating LTL satisfiability solvers
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Query Answering with DBoxes is Hard
Electronic Notes in Theoretical Computer Science (ENTCS)
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Labelled superposition for PLTL
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Countermodels from Sequent Calculi in Multi-Modal Logics
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Invariant-Free Clausal Temporal Resolution
Journal of Automated Reasoning
A resolution calculus for the branching-time temporal logic CTL
ACM Transactions on Computational Logic (TOCL)
Beth definability in expressive description logics
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
The paper presents a one-pass tableau calculus PLTLT for the propositional linear time logic PLTL. The calculus is correct and complete and unlike in previous decision methods, there is no second phase that checks for the fulfillment of the so-called eventuality formulae. This second phase is performed locally and is incorporated into the rules of the calculus. Derivations in PLTLT are cyclic trees rather than cyclic graphs. When used as a basis for a decision procedure, it has the advantage that only one branch needs to be kept in memory at any one time. It may thus be a suitable starting point for the development of a parallel decision method for PLTL.