{"id":"https://openalex.org/W237532749","doi":"https://doi.org/10.1007/978-3-540-71389-0_5","title":"The Complexity of Generalized Satisfiability for Linear Temporal Logic","display_name":"The Complexity of Generalized Satisfiability for Linear Temporal Logic","publication_year":2007,"publication_date":"2007-07-01","ids":{"openalex":"https://openalex.org/W237532749","doi":"https://doi.org/10.1007/978-3-540-71389-0_5","mag":"237532749"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-71389-0_5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-540-71389-0_5","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-540-71389-0_5.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"article","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-540-71389-0_5.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082114974","display_name":"Michael Bauland","orcid":null},"institutions":[{"id":"https://openalex.org/I40753682","display_name":"Ford (Germany)","ror":"https://ror.org/017vgxg86","country_code":"DE","type":"company","lineage":["https://openalex.org/I40753682"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Michael Bauland","raw_affiliation_strings":["Knipp GmbH, Martin-Schmeier-Weg 9, 44227 Dortmund, Germany"],"affiliations":[{"raw_affiliation_string":"Knipp GmbH, Martin-Schmeier-Weg 9, 44227 Dortmund, Germany","institution_ids":["https://openalex.org/I40753682"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091510344","display_name":"Thomas Schneider","orcid":"https://orcid.org/0000-0001-5592-6183"},"institutions":[{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Thomas Schneider","raw_affiliation_strings":["School of Computer Science, University of Manchester, Oxford Road, Manchester M13 9PL, UK"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Manchester, Oxford Road, Manchester M13 9PL, UK","institution_ids":["https://openalex.org/I28407311"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109427518","display_name":"Henning Schnoor","orcid":null},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Christian-Albrechts-Universit\u00e4t zu Kiel","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Henning Schnoor","raw_affiliation_strings":["Inst. fr Informatik, Christian-Albrechts-Universitt zu Kiel, 24098 Kiel, Germany"],"affiliations":[{"raw_affiliation_string":"Inst. fr Informatik, Christian-Albrechts-Universitt zu Kiel, 24098 Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025530063","display_name":"Ilka Schnoor","orcid":null},"institutions":[{"id":"https://openalex.org/I98259816","display_name":"Birkbeck, University of London","ror":"https://ror.org/02mb95055","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I98259816"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Ilka Schnoor","raw_affiliation_strings":["Inst. fr Theoretische Informatik, Universitt zu Lbeck, Ratzeburger Allee 160, 23538 Lbeck, Germany"],"affiliations":[{"raw_affiliation_string":"Inst. fr Theoretische Informatik, Universitt zu Lbeck, Ratzeburger Allee 160, 23538 Lbeck, Germany","institution_ids":["https://openalex.org/I98259816"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008982209","display_name":"Heribert Vollmer","orcid":"https://orcid.org/0000-0002-9292-1960"},"institutions":[{"id":"https://openalex.org/I114112103","display_name":"Leibniz University Hannover","ror":"https://ror.org/0304hq317","country_code":"DE","type":"education","lineage":["https://openalex.org/I114112103"]},{"id":"https://openalex.org/I32021983","display_name":"Christian-Albrechts-Universit\u00e4t zu Kiel","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Heribert Vollmer","raw_affiliation_strings":["Inst. fr Informatik, Christian-Albrechts-Universitt zu Kiel, 24098 Kiel, Germany","Inst. fr Theoretische Informatik, Universitt Hannover, Appelstr. 4, 30167 Hannover, Germany"],"affiliations":[{"raw_affiliation_string":"Inst. fr Informatik, Christian-Albrechts-Universitt zu Kiel, 24098 Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]},{"raw_affiliation_string":"Inst. fr Theoretische Informatik, Universitt Hannover, Appelstr. 4, 30167 Hannover, Germany","institution_ids":["https://openalex.org/I114112103"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5082114974"],"corresponding_institution_ids":["https://openalex.org/I40753682"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.02271079,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 5, Issue 1","issue":null,"first_page":"48","last_page":"62"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.9832000136375427,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9814000129699707,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.7102608680725098},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.661896824836731},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6123456358909607},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.5060727000236511},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48490625619888306},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.46295031905174255},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.4471757113933563},{"id":"https://openalex.org/keywords/propositional-variable","display_name":"Propositional variable","score":0.4426162838935852},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.42276692390441895},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.347398966550827},{"id":"https://openalex.org/keywords/intermediate-logic","display_name":"Intermediate logic","score":0.2759774923324585},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.25119417905807495},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25114357471466064},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2345506250858307}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7102608680725098},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.661896824836731},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6123456358909607},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.5060727000236511},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48490625619888306},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.46295031905174255},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.4471757113933563},{"id":"https://openalex.org/C14523651","wikidata":"https://www.wikidata.org/wiki/Q3492863","display_name":"Propositional variable","level":4,"score":0.4426162838935852},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.42276692390441895},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.347398966550827},{"id":"https://openalex.org/C33203268","wikidata":"https://www.wikidata.org/wiki/Q5361594","display_name":"Intermediate logic","level":3,"score":0.2759774923324585},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25119417905807495},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25114357471466064},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2345506250858307},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0}],"mesh":[],"locations_count":19,"locations":[{"id":"doi:10.1007/978-3-540-71389-0_5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-540-71389-0_5","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-540-71389-0_5.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"doi:10.2168/lmcs-5(1:1)2009","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-5(1:1)2009","pdf_url":"https://lmcs.episciences.org/1158/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/0a2de639-6971-441c-8708-bb7506f40e71","is_oa":false,"landing_page_url":"https://research.manchester.ac.uk/en/publications/0a2de639-6971-441c-8708-bb7506f40e71","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bauland, M, Schneider, T, Schnoor, H, Schnoor, I & Vollmer, H 2007, The complexity of generalized satisfiability for linear temporal logic. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.. vol. 4423, pp. 48-62, 10th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2007, Braga, 1/07/07.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:0812.4848","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0812.4848","pdf_url":"https://arxiv.org/pdf/0812.4848","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.163.6663","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.163.6663","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eccc.hpi-web.de/report/2006/153/download/","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.248.4748","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.248.4748","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0812.4848v3.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.248.5807","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.248.5807","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0812.4848v2.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.250.3495","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.250.3495","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0812.4848v1.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.552.7605","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.552.7605","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.thi.uni-hannover.de/fileadmin/forschung/esslli/07/ltl_sat_paper.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.64.6969","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.64.6969","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.minet.uni-jena.de/~thschnei/publ/bss+07_fossacs.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.68.3300","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.3300","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eccc.hpi-web.de/eccc-reports/2006/TR06-153/revisn01.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.73.6457","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.73.6457","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eccc.hpi-web.de/eccc-reports/2006/TR06-153/revisn01.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.91.5639","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.91.5639","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.thi.uni-hannover.de/forschung/publikationen/daten/bsssv06.pdf","raw_type":"text"},{"id":"pmh:oai:doaj.org/article:c30aaf21dde64da9ae6d3ab999e121ff","is_oa":true,"landing_page_url":"https://doaj.org/article/c30aaf21dde64da9ae6d3ab999e121ff","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 5, Issue 1 (2009)","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:publications/0a2de639-6971-441c-8708-bb7506f40e71","is_oa":false,"landing_page_url":"https://www.research.manchester.ac.uk/portal/en/publications/the-complexity-of-generalized-satisfiability-for-linear-temporal-logic(0a2de639-6971-441c-8708-bb7506f40e71).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bauland, M, Schneider, T, Schnoor, H, Schnoor, I & Vollmer, H 2007, The complexity of generalized satisfiability for linear temporal logic. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.. vol. 4423, pp. 48-62, 10th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2007, Braga, 1/07/07.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:www.repo.uni-hannover.de:123456789/1542","is_oa":true,"landing_page_url":"http://www.repo.uni-hannover.de/handle/123456789/1542","pdf_url":null,"source":{"id":"https://openalex.org/S4306401575","display_name":"Institutional Repository of Leibniz Universit\u00e4t Hannover (Leibniz Universit\u00e4t Hannover)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I114112103","host_organization_name":"Leibniz University Hannover","host_organization_lineage":["https://openalex.org/I114112103"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science 5 (2009), Nr. 1","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"doi:10.48550/arxiv.0812.4848","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.0812.4848","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"doi:10.15488/1517","is_oa":true,"landing_page_url":"https://doi.org/10.15488/1517","pdf_url":null,"source":{"id":"https://openalex.org/S7407052956","display_name":"Leibniz Universit\u00e4t Hannover","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"mag:237532749","is_oa":false,"landing_page_url":"http://eccc.hpi-web.de/eccc-reports/2006/TR06-153/index.html","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":{"id":"doi:10.1007/978-3-540-71389-0_5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-540-71389-0_5","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-540-71389-0_5.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[{"score":0.4000000059604645,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[{"id":"https://openalex.org/G3141750733","display_name":null,"funder_award_id":"630/6-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320875","display_name":"Deutscher Akademischer Austauschdienst","ror":"https://ror.org/039djdh30"},{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W237532749.pdf","grobid_xml":"https://content.openalex.org/works/W237532749.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W1481524021","https://openalex.org/W1486951200","https://openalex.org/W1502402009","https://openalex.org/W1528600100","https://openalex.org/W1992762998","https://openalex.org/W2003227046","https://openalex.org/W2007671683","https://openalex.org/W2023364974","https://openalex.org/W2023808162","https://openalex.org/W2026379532","https://openalex.org/W2032270529","https://openalex.org/W2036265926","https://openalex.org/W2041433942","https://openalex.org/W2065251436","https://openalex.org/W2082480388","https://openalex.org/W2082723133","https://openalex.org/W2154374418","https://openalex.org/W2158800868","https://openalex.org/W2160811334","https://openalex.org/W2398485441","https://openalex.org/W6679046596"],"related_works":["https://openalex.org/W2951449870","https://openalex.org/W2627030740","https://openalex.org/W1967362250","https://openalex.org/W2115416792","https://openalex.org/W2167907675","https://openalex.org/W2129495182","https://openalex.org/W1599584094","https://openalex.org/W2128500355","https://openalex.org/W2140541040","https://openalex.org/W1528981694","https://openalex.org/W2167135424","https://openalex.org/W2740128568","https://openalex.org/W2189598663","https://openalex.org/W2014322692","https://openalex.org/W19621713","https://openalex.org/W2252902320","https://openalex.org/W2114710125","https://openalex.org/W2040640762","https://openalex.org/W2017112542","https://openalex.org/W198954820"],"abstract_inverted_index":{"In":[0,78],"a":[1,47,69],"seminal":[2],"paper":[3,45],"from":[4],"1985,":[5],"Sistla":[6],"and":[7,60,109],"Clarke":[8],"showed":[9],"that":[10],"satisfiability":[11,51,102],"for":[12,52,103],"Linear":[13],"Temporal":[14],"Logic":[15],"(LTL)":[16],"is":[17,38,123],"either":[18,127],"NP-complete":[19],"or":[20,130],"PSPACE-complete,":[21,128],"depending":[22],"on":[23],"the":[24,33,40,97],"set":[25,34],"of":[26,35,50,58,86,100,106,114,118],"temporal":[27,61,107],"operators":[28,37,108],"used.":[29],"If,":[30],"in":[31,131],"contrast,":[32],"propositional":[36,59,65,76,115],"restricted,":[39],"complexity":[41,99],"may":[42],"decrease.":[43],"This":[44],"undertakes":[46],"systematic":[48],"study":[49],"LTL":[53,101],"formulae":[54],"over":[55],"restricted":[56],"sets":[57,85],"operators.":[62,77],"Since":[63],"every":[64],"operator":[66],"corresponds":[67],"to":[68,80,125],"Boolean":[70],"function,":[71],"there":[72],"exist":[73],"infinitely":[74,120],"many":[75,121],"order":[79],"systematically":[81],"cover":[82],"all":[83,104,110],"possible":[84],"them,":[87],"we":[88,95],"use":[89],"Post's":[90],"lattice.":[91],"With":[92],"its":[93],"help,":[94],"determine":[96],"computational":[98],"combinations":[105],"but":[111],"two":[112],"classes":[113],"functions.":[116],"Each":[117],"these":[119],"problems":[122],"shown":[124],"be":[126],"NP-complete,":[129],"P.":[132]},"counts_by_year":[],"updated_date":"2026-03-27T14:29:43.386196","created_date":"2025-10-10T00:00:00"}