Author:
Bauland Michael,Schneider Thomas,Schnoor Henning,Schnoor Ilka,Vollmer Heribert
Publisher
Centre pour la Communication Scientifique Directe (CCSD)
Subject
General Computer Science,Theoretical Computer Science
Reference25 articles.
1. SIGACT news complexity theory column 42
2. M. Bauland, E. Hemaspaandra, H. Schnoor, and I. Schnoor. Generalized modal satisfiability. In B. Durand and W. Thomas, editors,STACS, volume 3884 ofLecture Notes in Computer Science, pages 500-511. Springer, 2006.
3. M. Bauland, M. Mundhenk, T. Schneider, H. Schnoor, I. Schnoor, and H. Vollmer. The tractability of model checking for LTL: the good, the bad, and the ugly fragments. InProceedings Methods for Modalities 5, pages 125-140. ENS Cachan, 2007. Also at CoRR http://arxiv.org/abs/0805.0498.
4. M. Bauland, T. Schneider, H. Schnoor, I. Schnoor, and H. Vollmer. The complexity of generalized satisfiability for linear temporal logic. In H. Seidl, editor,FoSSaCS, volume 4423 ofLecture Notes in Computer Science, pages 48-62. Springer, 2007.
5. The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献