The Complexity of Generalized Satisfiability for Linear Temporal Logic-Reference-Cited by-同舟云学术

The Complexity of Generalized Satisfiability for Linear Temporal Logic

Published: Issue: Volume: Page:48-62
ISSN:
Container-title:Foundations of Software Science and Computational Structures
language:
Short-container-title:

Author:

Bauland Michael,Schneider Thomas,Schnoor Henning,Schnoor Ilka,Vollmer Heribert

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-71389-0_5.pdf

Reference16 articles.

1. Böhler, E., et al.: Playing with Boolean blocks, part I: Post’s lattice with applications to complexity theory. SIGACT News 34(4), 38–52 (2003)

2. Lecture Notes in Computer Science;M. Bauland,2006

3. Bauland, M., et al.: The complexity of generalized satisfiability for linear temporal logic. Technical Report TR06-153, Electronic Colloquium on Computational Complexity (2006)

4. Cook, S.A.: The complexity of theorem proving procedures. In: Proceedings 3rd Symposium on Theory of Computing, pp. 151–158. ACM Press, New York (1971)

5. Dalmau, V.: Computational Complexity of Problems over Generalized Formulas. PhD thesis, Department de Llenguatges i Sistemes Informàtica, Universitat Politécnica de Catalunya (2000)

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Complexity of Linear-Time Temporal Logic Model Repair;Structured Object-Oriented Formal Language and Method;2018

2. Conformance for DecSerFlow Constraints;Service-Oriented Computing;2014

3. The Complexity of Circumscriptive Inference in Post’s Lattice;Theory of Computing Systems;2011-01-11

4. The Complexity of Generalized Satisfiability for Linear Temporal Logic;Logical Methods in Computer Science;2009-01-26

5. The Complexity of Circumscriptive Inference in Post’s Lattice;Logic Programming and Nonmonotonic Reasoning;2009