Nexttime is not necessary

Authors:
Edith Spaan
Affiliations:
University of Amsterdam, Amsterdam
Venue:
TARK '90 Proceedings of the 3rd conference on Theoretical aspects of reasoning about knowledge
Year:
1990

Citing 5
Cited 2

The complexity of propositional linear temporal logics

Journal of the ACM (JACM)
The complexity of reasoning about knowledge and time

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The logic of distributed protocols

Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
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
Recurring Dominoes: Making the Highly Undecidable Highly Understandable (Preliminary Report)

Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory

A universally defined undecidable unimodal logic

MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
A combination of explicit and deductive knowledge with branching time: completeness and decidability results

DALT'05 Proceedings of the Third international conference on Declarative Agent Languages and Technologies

Quantified Score

Hi-index	0.03

Visualization

Abstract

We investigate the propositional modal logic of knowledge and time for distributed systems. Previous results by Halpern and Vardi [HV89] and Ladner and Reif [LR] illustrate that the validity problems for a number of these logics are highly intractable; in particular they prove a number of Π11-completeness results. The logics considered by the above authors contain at least two out of the three temporal logic operators: "sometimes", "nexttime", and "until". Although their proofs rely heavily on either the "nexttime" or the "until" operator, we show that the completeness results remain valid if we restrict the temporal operators to "sometimes".