Temporal logics over transitive states

Authors:
Boris Konev;Frank Wolter;Michael Zakharyaschev
Affiliations:
Department of Computer Science, University of Liverpool, Liverpool, U.K.;Department of Computer Science, University of Liverpool, Liverpool, U.K.;Department of Computer Science, King's College London, London, U.K.
Venue:
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Year:
2005

The complexity of propositional linear temporal logics

Journal of the ACM (JACM)
The complexity of reasoning about knowledge and time. I. lower bounds

Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
On Communicating Finite-State Machines

Journal of the ACM (JACM)
Clausal temporal resolution

ACM Transactions on Computational Logic (TOCL)
Verifying lossy channel systems has nonprimitive recursive complexity

Information Processing Letters
Combining Terminological Logics with Tense Logic

EPIA '93 Proceedings of the 6th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
Modal Logic and the Two-Variable Fragment

CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Undecidable problems in unreliable computations

Theoretical Computer Science - Latin American theoretical informatics
Decidability of the termination problem for completely specified protocols

Distributed Computing
Combining spatial and temporal logics: expressiveness vs. complexity

Journal of Artificial Intelligence Research
A resolution method for temporal logic

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1

Post embedding problem is not primitive recursive, with applications to channel systems

FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
The ω-regular post embedding problem

FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures

Hi-index	0.00

We investigate the computational behaviour of ‘two-dimensional' propositional temporal logics over (ℕ,