{"id":"https://openalex.org/W2114710125","doi":"https://doi.org/10.1007/978-3-642-03816-7_50","title":"The Complexity of Satisfiability for Fragments of Hybrid Logic\u2014Part I","display_name":"The Complexity of Satisfiability for Fragments of Hybrid Logic\u2014Part I","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2114710125","doi":"https://doi.org/10.1007/978-3-642-03816-7_50","mag":"2114710125"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-03816-7_50","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-03816-7_50","pdf_url":null,"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":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025571978","display_name":"Arne Meier","orcid":"https://orcid.org/0000-0002-8061-5376"},"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"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Arne Meier","raw_affiliation_strings":["Theoretical Computer Science, University of Hannover, Germany"],"affiliations":[{"raw_affiliation_string":"Theoretical Computer Science, University of Hannover, Germany","institution_ids":["https://openalex.org/I114112103"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109890777","display_name":"Martin Mundhenk","orcid":null},"institutions":[{"id":"https://openalex.org/I76198965","display_name":"Friedrich Schiller University Jena","ror":"https://ror.org/05qpz1x62","country_code":"DE","type":"education","lineage":["https://openalex.org/I76198965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Martin Mundhenk","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Jena, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Jena, Germany","institution_ids":["https://openalex.org/I76198965"]}]},{"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":["Computer Science, University of Manchester, UK"],"affiliations":[{"raw_affiliation_string":"Computer Science, University of Manchester, UK","institution_ids":["https://openalex.org/I28407311"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081736632","display_name":"Michael E. Thomas","orcid":"https://orcid.org/0009-0004-2121-6983"},"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"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Michael Thomas","raw_affiliation_strings":["Theoretical Computer Science, University of Hannover, Germany"],"affiliations":[{"raw_affiliation_string":"Theoretical Computer Science, University of Hannover, Germany","institution_ids":["https://openalex.org/I114112103"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078278893","display_name":"Volker Weber","orcid":null},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Volker Weber","raw_affiliation_strings":["Fakult\u00e4t f\u00fcr Informatik, Technische Universit\u00e4t Dortmund, Germany"],"affiliations":[{"raw_affiliation_string":"Fakult\u00e4t f\u00fcr Informatik, Technische Universit\u00e4t Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043221864","display_name":"Felix Wei\u00df","orcid":null},"institutions":[{"id":"https://openalex.org/I76198965","display_name":"Friedrich Schiller University Jena","ror":"https://ror.org/05qpz1x62","country_code":"DE","type":"education","lineage":["https://openalex.org/I76198965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Felix Weiss","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Jena, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Jena, Germany","institution_ids":["https://openalex.org/I76198965"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5025571978"],"corresponding_institution_ids":["https://openalex.org/I114112103"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.3085,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.8973804,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"587","last_page":"599"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998000264167786,"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.9998000264167786,"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/T10142","display_name":"Formal Methods in Verification","score":0.9987999796867371,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9983000159263611,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.829573392868042},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.6800622344017029},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.666808545589447},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.6116898655891418},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5189611315727234},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.49941372871398926},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4979841709136963},{"id":"https://openalex.org/keywords/modal-logic","display_name":"Modal logic","score":0.47635364532470703},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.4305744767189026},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4195292890071869},{"id":"https://openalex.org/keywords/modal-operator","display_name":"Modal operator","score":0.41926291584968567},{"id":"https://openalex.org/keywords/negation","display_name":"Negation","score":0.41496551036834717},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3792688250541687},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3374813199043274},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2736843228340149},{"id":"https://openalex.org/keywords/modal","display_name":"Modal","score":0.2345699667930603},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.20813649892807007},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.15316134691238403},{"id":"https://openalex.org/keywords/multimodal-logic","display_name":"Multimodal logic","score":0.10327982902526855}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.829573392868042},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.6800622344017029},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.666808545589447},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6116898655891418},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5189611315727234},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.49941372871398926},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4979841709136963},{"id":"https://openalex.org/C27508121","wikidata":"https://www.wikidata.org/wiki/Q210841","display_name":"Modal logic","level":3,"score":0.47635364532470703},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.4305744767189026},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4195292890071869},{"id":"https://openalex.org/C78344899","wikidata":"https://www.wikidata.org/wiki/Q638442","display_name":"Modal operator","level":4,"score":0.41926291584968567},{"id":"https://openalex.org/C2185349","wikidata":"https://www.wikidata.org/wiki/Q190558","display_name":"Negation","level":2,"score":0.41496551036834717},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3792688250541687},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3374813199043274},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2736843228340149},{"id":"https://openalex.org/C71139939","wikidata":"https://www.wikidata.org/wiki/Q910194","display_name":"Modal","level":2,"score":0.2345699667930603},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.20813649892807007},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.15316134691238403},{"id":"https://openalex.org/C203659156","wikidata":"https://www.wikidata.org/wiki/Q6934805","display_name":"Multimodal logic","level":3,"score":0.10327982902526855},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C188027245","wikidata":"https://www.wikidata.org/wiki/Q750446","display_name":"Polymer chemistry","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/978-3-642-03816-7_50","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-03816-7_50","pdf_url":null,"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":"pmh:oai:pure.atira.dk:openaire_cris_publications/f77c8ef8-65c0-4bce-b331-56494bd45268","is_oa":false,"landing_page_url":"https://research.manchester.ac.uk/en/publications/f77c8ef8-65c0-4bce-b331-56494bd45268","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":"Meier, A, Mundhenk, M, Schneider, T, Thomas, M, Weber, V & Weiss, F 2009, The complexity of satisfiability for fragments of hybrid logic-part i. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.. vol. 5734, pp. 587-599, 34th International Symposium on Mathematical Foundations of Computer Science 2009, MFCS 2009, Novy Smokovec, High Tatras, 1/07/09. https://doi.org/10.1007/978-3-642-03816-7_50","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.249.3425","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.249.3425","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/0906.1489v1.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.297.985","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.985","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/fakultaet/mundhenk/papers/FoHL-Sat-1.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:publications/36bd4a87-eb5d-40aa-abdd-c39d43602f34","is_oa":false,"landing_page_url":"https://www.research.manchester.ac.uk/portal/en/publications/the-complexity-of-satisfiability-for-fragments-of-hybrid-logicpart-i(36bd4a87-eb5d-40aa-abdd-c39d43602f34).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":"","raw_type":""},{"id":"pmh:oai:pure.atira.dk:publications/f77c8ef8-65c0-4bce-b331-56494bd45268","is_oa":false,"landing_page_url":"https://www.research.manchester.ac.uk/portal/en/publications/the-complexity-of-satisfiability-for-fragments-of-hybrid-logicpart-i(f77c8ef8-65c0-4bce-b331-56494bd45268).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":"Meier, A, Mundhenk, M, Schneider, T, Thomas, M, Weber, V & Weiss, F 2009, The complexity of satisfiability for fragments of hybrid logic-part i. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.. vol. 5734, pp. 587-599, 34th International Symposium on Mathematical Foundations of Computer Science 2009, MFCS 2009, Novy Smokovec, High Tatras, 1/07/09. https://doi.org/10.1007/978-3-642-03816-7_50","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W25697800","https://openalex.org/W41330591","https://openalex.org/W62327733","https://openalex.org/W138168018","https://openalex.org/W144418952","https://openalex.org/W196093472","https://openalex.org/W1488709943","https://openalex.org/W1528600100","https://openalex.org/W1534782707","https://openalex.org/W1589711670","https://openalex.org/W1608094044","https://openalex.org/W1678486145","https://openalex.org/W1802821885","https://openalex.org/W1967362250","https://openalex.org/W1968075259","https://openalex.org/W1969184283","https://openalex.org/W1991188222","https://openalex.org/W1992762998","https://openalex.org/W1997129529","https://openalex.org/W2007671683","https://openalex.org/W2017460625","https://openalex.org/W2052882335","https://openalex.org/W2057440130","https://openalex.org/W2066955594","https://openalex.org/W2073491323","https://openalex.org/W2082723133","https://openalex.org/W2102447986","https://openalex.org/W2106171841","https://openalex.org/W2144726625","https://openalex.org/W2153838820","https://openalex.org/W2154374418","https://openalex.org/W2158800868","https://openalex.org/W2166566648","https://openalex.org/W2170352409","https://openalex.org/W2259259104","https://openalex.org/W2401138554","https://openalex.org/W2580087134","https://openalex.org/W2768141140","https://openalex.org/W2811227589","https://openalex.org/W2951449870","https://openalex.org/W3169117102","https://openalex.org/W4213009134","https://openalex.org/W4231003652","https://openalex.org/W6607641448"],"related_works":["https://openalex.org/W1556645209","https://openalex.org/W2782243532","https://openalex.org/W2963991671","https://openalex.org/W1498755214","https://openalex.org/W2240703591","https://openalex.org/W2585890227","https://openalex.org/W1543051890","https://openalex.org/W2189598663","https://openalex.org/W3209006398","https://openalex.org/W1962376575"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2017-01-13T00:00:00"}