{"id":"https://openalex.org/W3016709696","doi":"https://doi.org/10.29007/f5wh","title":"Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard","display_name":"Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard","publication_year":2020,"publication_date":"2020-05-27","ids":{"openalex":"https://openalex.org/W3016709696","doi":"https://doi.org/10.29007/f5wh","mag":"3016709696"},"language":"en","primary_location":{"id":"doi:10.29007/f5wh","is_oa":true,"landing_page_url":"https://doi.org/10.29007/f5wh","pdf_url":"https://easychair.org/publications/open/DdNg","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://easychair.org/publications/open/DdNg","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5010578735","display_name":"Mnacho Echenim","orcid":"https://orcid.org/0000-0001-5765-0758"},"institutions":[{"id":"https://openalex.org/I899635006","display_name":"Universit\u00e9 Grenoble Alpes","ror":"https://ror.org/02rx3b187","country_code":"FR","type":"education","lineage":["https://openalex.org/I899635006"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Mnacho Echenim","raw_affiliation_strings":["Universit\u00e9 Grenoble Alpes, Saint-Martin-d'H\u00e8res, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Grenoble Alpes, Saint-Martin-d'H\u00e8res, France","institution_ids":["https://openalex.org/I899635006"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074143130","display_name":"Radu Iosif","orcid":"https://orcid.org/0000-0003-3204-3294"},"institutions":[{"id":"https://openalex.org/I899635006","display_name":"Universit\u00e9 Grenoble Alpes","ror":"https://ror.org/02rx3b187","country_code":"FR","type":"education","lineage":["https://openalex.org/I899635006"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Radu Iosif","raw_affiliation_strings":["Universit\u00e9 Grenoble Alpes, Saint-Martin-d'H\u00e8res, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Grenoble Alpes, Saint-Martin-d'H\u00e8res, France","institution_ids":["https://openalex.org/I899635006"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079985573","display_name":"Nicolas Peltier","orcid":"https://orcid.org/0000-0002-8943-7000"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nicolas Peltier","raw_affiliation_strings":["Calculs algorithmes programmes et preuves"],"affiliations":[{"raw_affiliation_string":"Calculs algorithmes programmes et preuves","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5010578735"],"corresponding_institution_ids":["https://openalex.org/I899635006"],"apc_list":null,"apc_paid":null,"fwci":0.29417621,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.60332647,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"73","issue":null,"first_page":"191","last_page":"169"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998999834060669,"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/T11567","display_name":"semigroups and automata theory","score":0.9998999834060669,"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.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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9979000091552734,"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/exptime","display_name":"EXPTIME","score":0.721587061882019},{"id":"https://openalex.org/keywords/logical-consequence","display_name":"Logical consequence","score":0.7018072605133057},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.6058926582336426},{"id":"https://openalex.org/keywords/separation-logic","display_name":"Separation logic","score":0.5685073137283325},{"id":"https://openalex.org/keywords/predicate-logic","display_name":"Predicate logic","score":0.48038822412490845},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4578394591808319},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4566991627216339},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4370032846927643},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.43311840295791626},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.42811012268066406},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4023178219795227},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.30292510986328125},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28541475534439087},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.2111981213092804},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.1976509690284729},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.19178006052970886},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.1877296268939972},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14272499084472656},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.13905534148216248}],"concepts":[{"id":"https://openalex.org/C56049555","wikidata":"https://www.wikidata.org/wiki/Q1276570","display_name":"EXPTIME","level":4,"score":0.721587061882019},{"id":"https://openalex.org/C134752490","wikidata":"https://www.wikidata.org/wiki/Q374182","display_name":"Logical consequence","level":2,"score":0.7018072605133057},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6058926582336426},{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.5685073137283325},{"id":"https://openalex.org/C19689857","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"Predicate logic","level":3,"score":0.48038822412490845},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4578394591808319},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4566991627216339},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4370032846927643},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.43311840295791626},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.42811012268066406},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4023178219795227},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30292510986328125},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28541475534439087},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.2111981213092804},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.1976509690284729},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.19178006052970886},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.1877296268939972},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14272499084472656},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13905534148216248},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.29007/f5wh","is_oa":true,"landing_page_url":"https://doi.org/10.29007/f5wh","pdf_url":"https://easychair.org/publications/open/DdNg","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},{"id":"mag:3016709696","is_oa":true,"landing_page_url":"http://arxiv.org/pdf/2004.07578.pdf","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.2004.07578","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2004.07578","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"}],"best_oa_location":{"id":"doi:10.29007/f5wh","is_oa":true,"landing_page_url":"https://doi.org/10.29007/f5wh","pdf_url":"https://easychair.org/publications/open/DdNg","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3016709696.pdf","grobid_xml":"https://content.openalex.org/works/W3016709696.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W122465024","https://openalex.org/W134837158","https://openalex.org/W777621473","https://openalex.org/W1581674879","https://openalex.org/W1757770995","https://openalex.org/W1910824881","https://openalex.org/W2008132476","https://openalex.org/W2103490167","https://openalex.org/W2137628566","https://openalex.org/W2543538425","https://openalex.org/W2930217943","https://openalex.org/W3004864368"],"related_works":["https://openalex.org/W3032212576","https://openalex.org/W3010227999","https://openalex.org/W3183368753","https://openalex.org/W3156074505","https://openalex.org/W3091716098","https://openalex.org/W2044028378","https://openalex.org/W2002981190","https://openalex.org/W2121496524","https://openalex.org/W2079842345","https://openalex.org/W2017112542","https://openalex.org/W2971592291","https://openalex.org/W2033075656","https://openalex.org/W2992863903","https://openalex.org/W2914576081","https://openalex.org/W2040640762","https://openalex.org/W2183571250","https://openalex.org/W2971036089","https://openalex.org/W3194603731","https://openalex.org/W1608094044","https://openalex.org/W3101316517"],"abstract_inverted_index":{"The":[0,65],"entailment":[1,59],"between":[2,60],"separation":[3],"logic":[4],"formul\u00e6":[5],"with":[6],"inductive":[7,26],"predicates,":[8],"also":[9],"known":[10],"as":[11],"sym-":[12],"bolic":[13],"heaps,":[14],"has":[15],"been":[16],"shown":[17],"to":[18],"be":[19],"decidable":[20],"for":[21,76],"a":[22,30,70],"large":[23],"class":[24],"of":[25],"definitions":[27],"[7].":[28],"Recently,":[29],"2-EXPTIME":[31],"algorithm":[32],"was":[33,41],"proposed":[34],"[10,":[35],"14]":[36],"and":[37],"an":[38],"EXPTIME-hard":[39],"bound":[40,49],"established":[42],"in":[43],"[8];":[44],"however":[45],"no":[46],"precise":[47],"lower":[48],"is":[50,63,67],"known.":[51],"In":[52],"this":[53],"paper,":[54],"we":[55],"show":[56],"that":[57],"deciding":[58],"predicate":[61],"atoms":[62],"2-EXPTIME-hard.":[64],"proof":[66],"based":[68],"on":[69],"reduction":[71],"from":[72],"the":[73],"membership":[74],"problem":[75],"exponential-space":[77],"bounded":[78],"alternating":[79],"Turing":[80],"machines":[81],"[5].":[82]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}