Luck, M.; Meier, A.; Schindler, I.: Parametrised complexity of satisfiability in temporal logic. In: ACM Transactions on Computational Logic 18 (2017), Nr. 1, 1. DOI: https://doi.org/10.1145/3001835
Abstract: | |
We apply the concept of formula treewidth and pathwidth to computation tree logic, linear temporal logic, and the full branching time logic. Several representations of formulas as graphlike structures are discussed, and corresponding notions of treewidth and pathwidth are introduced. As an application for such structures, we present a classification in terms of parametrised complexity of the satisfiability problem, where we make use of Courcelle's famous theorem for recognition of certain classes of structures. Our classification shows a dichotomy between W[1]-hard and fixed-parameter tractable operator fragments almost independently of the chosen graph representation. The only fragments that are proven to be fixed-parameter tractable (FPT) are those that are restricted to the X operator. By investigating Boolean operator fragments in the sense of Post's lattice, we achieve the same complexity as in the unrestricted case if the set of available Boolean functions can express the function "negation of the implication." Conversely, we show containment in FPT for almost all other clones. © ACM 2017. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in ACM Transactions on Computational Logic 18 (2017), Nr. 1, 1. DOI: https://doi.org/10.1145/3001835. | |
License of this version: | Es gilt deutsches Urheberrecht. Das Dokument darf zum eigenen Gebrauch kostenfrei genutzt, aber nicht im Internet bereitgestellt oder an Außenstehende weitergegeben werden. |
Document Type: | Article |
Publishing status: | acceptedVersion |
Issue Date: | 2017 |
Appears in Collections: | Fakultät für Architektur und Landschaft |
pos. | country | downloads | ||
---|---|---|---|---|
total | perc. | |||
1 | Germany | 182 | 70.82% | |
2 | United States | 25 | 9.73% | |
3 | China | 11 | 4.28% | |
4 | Brazil | 7 | 2.72% | |
5 | No geo information available | 4 | 1.56% | |
6 | India | 4 | 1.56% | |
7 | Japan | 3 | 1.17% | |
8 | United Kingdom | 3 | 1.17% | |
9 | Italy | 2 | 0.78% | |
10 | France | 2 | 0.78% | |
other countries | 14 | 5.45% |
Hinweis
Zur Erhebung der Downloadstatistiken kommen entsprechend dem „COUNTER Code of Practice for e-Resources“ international anerkannte Regeln und Normen zur Anwendung. COUNTER ist eine internationale Non-Profit-Organisation, in der Bibliotheksverbände, Datenbankanbieter und Verlage gemeinsam an Standards zur Erhebung, Speicherung und Verarbeitung von Nutzungsdaten elektronischer Ressourcen arbeiten, welche so Objektivität und Vergleichbarkeit gewährleisten sollen. Es werden hierbei ausschließlich Zugriffe auf die entsprechenden Volltexte ausgewertet, keine Aufrufe der Website an sich.