{"id":"https://openalex.org/W7129329139","doi":"https://doi.org/10.1093/jigpal/jzaf097","title":"PSPACE-completeness of bimodal transitive weak-density logic","display_name":"PSPACE-completeness of bimodal transitive weak-density logic","publication_year":2025,"publication_date":"2025-12-13","ids":{"openalex":"https://openalex.org/W7129329139","doi":"https://doi.org/10.1093/jigpal/jzaf097"},"language":"en","primary_location":{"id":"doi:10.1093/jigpal/jzaf097","is_oa":false,"landing_page_url":"https://doi.org/10.1093/jigpal/jzaf097","pdf_url":null,"source":{"id":"https://openalex.org/S2734381524","display_name":"Logic Journal of IGPL","issn_l":"1367-0751","issn":["1367-0751","1368-9894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logic Journal of the IGPL","raw_type":"journal-article"},"type":"article","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/A5123026684","display_name":"Olivier Gasquet","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I134560555","display_name":"Universit\u00e9 Toulouse III - Paul Sabatier","ror":"https://ror.org/02v6kpv12","country_code":"FR","type":"education","lineage":["https://openalex.org/I134560555","https://openalex.org/I4405258862"]},{"id":"https://openalex.org/I3131550300","display_name":"Universit\u00e9 Toulouse-I-Capitole","ror":"https://ror.org/0443n9e75","country_code":"FR","type":"education","lineage":["https://openalex.org/I3131550300"]},{"id":"https://openalex.org/I4210119061","display_name":"Institut de Recherche en Informatique de Toulouse","ror":"https://ror.org/01rx4qw44","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I205747304","https://openalex.org/I205747304","https://openalex.org/I4210119061","https://openalex.org/I4387153255","https://openalex.org/I4405258862","https://openalex.org/I4405258862"]},{"id":"https://openalex.org/I4210152422","display_name":"Universit\u00e9 Toulouse - Jean Jaur\u00e8s","ror":"https://ror.org/04ezk3x31","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210152422","https://openalex.org/I4405258862"]},{"id":"https://openalex.org/I4210160189","display_name":"Institut Polytechnique de Bordeaux","ror":"https://ror.org/054qv7y42","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210160189"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Olivier Gasquet","raw_affiliation_strings":["IRIT, Universit\u00e9 de Toulouse , CNRS, France"],"affiliations":[{"raw_affiliation_string":"IRIT, Universit\u00e9 de Toulouse , CNRS, France","institution_ids":["https://openalex.org/I4210152422","https://openalex.org/I1294671590","https://openalex.org/I134560555","https://openalex.org/I4210119061","https://openalex.org/I3131550300","https://openalex.org/I4210160189"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5123026684"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I134560555","https://openalex.org/I3131550300","https://openalex.org/I4210119061","https://openalex.org/I4210152422","https://openalex.org/I4210160189"],"apc_list":{"value":4151,"currency":"USD","value_usd":4151},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.79708276,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"34","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.29030001163482666,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.29030001163482666,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.2612000107765198,"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.1071000024676323,"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.8758999705314636},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.7443000078201294},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.423799991607666},{"id":"https://openalex.org/keywords/mixing","display_name":"Mixing (physics)","score":0.38350000977516174},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.37470000982284546},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3479999899864197}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.8758999705314636},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.7443000078201294},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5817000269889832},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5360999703407288},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4629000127315521},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.423799991607666},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39640000462532043},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39399999380111694},{"id":"https://openalex.org/C138777275","wikidata":"https://www.wikidata.org/wiki/Q6884054","display_name":"Mixing (physics)","level":2,"score":0.38350000977516174},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.37470000982284546},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3479999899864197},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3384999930858612},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.28940001130104065},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.2847999930381775},{"id":"https://openalex.org/C143936061","wikidata":"https://www.wikidata.org/wiki/Q2030088","display_name":"DPLL algorithm","level":4,"score":0.2694999873638153},{"id":"https://openalex.org/C195344581","wikidata":"https://www.wikidata.org/wiki/Q2555318","display_name":"Automated reasoning","level":2,"score":0.2628999948501587},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.2554999887943268}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1093/jigpal/jzaf097","is_oa":false,"landing_page_url":"https://doi.org/10.1093/jigpal/jzaf097","pdf_url":null,"source":{"id":"https://openalex.org/S2734381524","display_name":"Logic Journal of IGPL","issn_l":"1367-0751","issn":["1367-0751","1368-9894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logic Journal of the IGPL","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5498827695846558,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1480415539","https://openalex.org/W1495949270","https://openalex.org/W1867463642","https://openalex.org/W2073491323","https://openalex.org/W2076073997","https://openalex.org/W2089991946","https://openalex.org/W4233253115","https://openalex.org/W4242309855"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"Windows":[1],"have":[2],"been":[3],"introduced":[4],"in":[5,36],"[1]":[6],"as":[7],"a":[8,18,42],"tool":[9],"for":[10,64,80],"designing":[11],"polynomial":[12],"algorithms":[13,63],"to":[14,50,59],"check":[15],"satisfiability":[16,54,75],"of":[17,21,31],"bimodal":[19,32,65],"logic":[20],"weak-density.":[22],"In":[23],"this":[24],"paper,":[25],"after":[26],"revisiting":[27],"the":[28,53],"\u201cfolklore\u201d":[29],"case":[30],"${\\textbf{K}}4$":[33,66],"already":[34],"treated":[35],"[8],":[37],"but":[38],"which":[39],"is":[40,72],"worth":[41],"fresh":[43],"review,":[44],"we":[45],"show":[46],"that":[47,73],"windows":[48],"allow":[49],"polynomially":[51],"solve":[52],"problem":[55],"when":[56],"adding":[57],"transitivity":[58],"weak-density,":[60],"by":[61],"mixing":[62],"together":[67],"with":[68],"windows-approach.":[69],"The":[70],"conclusion":[71],"both":[74],"and":[76],"validity":[77],"are":[78],"$\\textbf{PSPACE}$-complete":[79],"these":[81],"logics.":[82]},"counts_by_year":[],"updated_date":"2026-02-18T06:25:47.457606","created_date":"2026-02-18T00:00:00"}