External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Tags

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

The Complexity of Generalized Satisfiability for Linear Temporal Logic

Michael Bauland, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer. The Complexity of Generalized Satisfiability for Linear Temporal Logic. In Helmut Seidl, editor, Foundations of Software Science and Computational Structures, 10th International Conference, FOSSACS 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007, Braga, Portugal, March 24-April 1, 2007, Proceedings. Volume 4423 of Lecture Notes in Computer Science, pages 48-62, Springer, 2007. [doi]

Authors

Michael Bauland

This author has not been identified. Look up 'Michael Bauland' in Google

Thomas Schneider

This author has not been identified. Look up 'Thomas Schneider' in Google

Henning Schnoor

This author has not been identified. Look up 'Henning Schnoor' in Google

Ilka Schnoor

This author has not been identified. Look up 'Ilka Schnoor' in Google

Heribert Vollmer

This author has not been identified. Look up 'Heribert Vollmer' in Google
runs on