Computational Complexity of Propositional Linear Temporal Logics Based on Qualitative Spatial or Temporal Reasoning

Philippe Balbiani, Jean-François Condotta. Computational Complexity of Propositional Linear Temporal Logics Based on Qualitative Spatial or Temporal Reasoning. In Alessandro Armando, editor, Frontiers of Combining Systems, 4th International Workshop, FroCoS 2002, Santa Margherita Ligure, Italy, April 8-10, 2002, Proceedings. Volume 2309 of Lecture Notes in Computer Science, pages 162-176, Springer, 2002. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.