{"id":"https://openalex.org/W4224211475","doi":"https://doi.org/10.1080/11663081.2022.2050135","title":"A separation theorem for discrete-time interval temporal logic","display_name":"A separation theorem for discrete-time interval temporal logic","publication_year":2022,"publication_date":"2022-01-02","ids":{"openalex":"https://openalex.org/W4224211475","doi":"https://doi.org/10.1080/11663081.2022.2050135"},"language":"en","primary_location":{"id":"doi:10.1080/11663081.2022.2050135","is_oa":false,"landing_page_url":"https://doi.org/10.1080/11663081.2022.2050135","pdf_url":null,"source":{"id":"https://openalex.org/S93822064","display_name":"Journal of Applied Non-Classical Logics","issn_l":"1166-3081","issn":["1166-3081","1958-5780"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Applied Non-Classical Logics","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/A5052887063","display_name":"Dimitar P. Guelev","orcid":"https://orcid.org/0000-0002-3101-7433"},"institutions":[{"id":"https://openalex.org/I24768866","display_name":"Bulgarian Academy of Sciences","ror":"https://ror.org/01x8hew03","country_code":"BG","type":"government","lineage":["https://openalex.org/I24768866"]},{"id":"https://openalex.org/I4210105926","display_name":"Institute of Mathematics and Informatics","ror":"https://ror.org/01b5dy719","country_code":"BG","type":"facility","lineage":["https://openalex.org/I24768866","https://openalex.org/I4210105926"]}],"countries":["BG"],"is_corresponding":true,"raw_author_name":"Dimitar P. Guelev","raw_affiliation_strings":["Department of Algebra and Logic, Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Sofia, Bulgaria"],"raw_orcid":"https://orcid.org/0000-0002-3101-7433","affiliations":[{"raw_affiliation_string":"Department of Algebra and Logic, Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Sofia, Bulgaria","institution_ids":["https://openalex.org/I4210105926","https://openalex.org/I24768866"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086002006","display_name":"Ben Moszkowski","orcid":"https://orcid.org/0000-0002-8965-9308"},"institutions":[{"id":"https://openalex.org/I84884186","display_name":"Newcastle University","ror":"https://ror.org/01kj2bm70","country_code":"GB","type":"education","lineage":["https://openalex.org/I84884186"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Ben Moszkowski","raw_affiliation_strings":["School of Computing, Newcastle University, Newcastle upon Tyne, UK"],"raw_orcid":"https://orcid.org/0000-0002-8965-9308","affiliations":[{"raw_affiliation_string":"School of Computing, Newcastle University, Newcastle upon Tyne, UK","institution_ids":["https://openalex.org/I84884186"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5052887063"],"corresponding_institution_ids":["https://openalex.org/I24768866","https://openalex.org/I4210105926"],"apc_list":null,"apc_paid":null,"fwci":0.1508,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.46918518,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"32","issue":"1","first_page":"28","last_page":"54"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"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/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"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.9987999796867371,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9987000226974487,"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/interval-temporal-logic","display_name":"Interval temporal logic","score":0.8035658001899719},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.7168738842010498},{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.6992195248603821},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.604271411895752},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5798189043998718},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.522107720375061},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44540420174598694},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4249642491340637},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3273385167121887},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27637478709220886},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.1797327995300293},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.15842977166175842},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.15541979670524597}],"concepts":[{"id":"https://openalex.org/C162670838","wikidata":"https://www.wikidata.org/wiki/Q6057295","display_name":"Interval temporal logic","level":3,"score":0.8035658001899719},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.7168738842010498},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.6992195248603821},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.604271411895752},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5798189043998718},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.522107720375061},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44540420174598694},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4249642491340637},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3273385167121887},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27637478709220886},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.1797327995300293},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.15842977166175842},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.15541979670524597}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/11663081.2022.2050135","is_oa":false,"landing_page_url":"https://doi.org/10.1080/11663081.2022.2050135","pdf_url":null,"source":{"id":"https://openalex.org/S93822064","display_name":"Journal of Applied Non-Classical Logics","issn_l":"1166-3081","issn":["1166-3081","1958-5780"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Applied Non-Classical Logics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.4000000059604645,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W32421893","https://openalex.org/W1489828373","https://openalex.org/W1497559908","https://openalex.org/W1528592560","https://openalex.org/W1543522563","https://openalex.org/W1549122259","https://openalex.org/W1949723230","https://openalex.org/W1966994121","https://openalex.org/W1970635712","https://openalex.org/W1979971526","https://openalex.org/W1991802248","https://openalex.org/W2008796796","https://openalex.org/W2017960715","https://openalex.org/W2023808162","https://openalex.org/W2025480213","https://openalex.org/W2038569232","https://openalex.org/W2053231467","https://openalex.org/W2062273688","https://openalex.org/W2062926163","https://openalex.org/W2069709605","https://openalex.org/W2073245887","https://openalex.org/W2087983477","https://openalex.org/W2089606312","https://openalex.org/W2092486735","https://openalex.org/W2103146530","https://openalex.org/W2103976539","https://openalex.org/W2154503781","https://openalex.org/W2156429182","https://openalex.org/W2161484642","https://openalex.org/W2167467151","https://openalex.org/W2187379055","https://openalex.org/W2293667833","https://openalex.org/W2496598940","https://openalex.org/W2567289819","https://openalex.org/W2797441266","https://openalex.org/W2952938415","https://openalex.org/W2996139545","https://openalex.org/W3023191323","https://openalex.org/W3098256944","https://openalex.org/W3103541787","https://openalex.org/W4213219346","https://openalex.org/W4288601052","https://openalex.org/W4292003697","https://openalex.org/W6607108141"],"related_works":["https://openalex.org/W55334476","https://openalex.org/W4232446061","https://openalex.org/W2124110813","https://openalex.org/W2092656858","https://openalex.org/W4285022830","https://openalex.org/W4387188591","https://openalex.org/W2996932295","https://openalex.org/W2084686863","https://openalex.org/W946220898","https://openalex.org/W2352091395"],"abstract_inverted_index":{"Gabbay's":[0],"separation":[1,62],"theorem":[2],"about":[3,31],"linear":[4],"temporal":[5,21],"logic":[6],"with":[7,39,67],"past":[8],"has":[9],"proved":[10],"to":[11],"be":[12],"one":[13],"of":[14,42,55],"the":[15,46,51],"most":[16],"useful":[17],"theoretical":[18],"results":[19],"in":[20],"logic.":[22],"In":[23],"this":[24],"paper,":[25],"we":[26],"establish":[27],"an":[28],"analogous":[29],"statement":[30],"Moszkowski's":[32],"discrete-time":[33],"propositional":[34],"Interval":[35],"Temporal":[36],"Logic":[37],"(ITL)":[38],"two":[40],"sets":[41],"expanding":[43],"modalities,":[44],"namely":[45],"unary":[47],"neighbourhood":[48],"modalities":[49],"and":[50,68],"binary":[52],"weak":[53],"inverses":[54],"ITL's":[56],"chop":[57],"operator.":[58],"We":[59],"prove":[60],"that":[61],"holds":[63],"for":[64],"ITL":[65],"both":[66],"without":[69],"its":[70],"loop":[71],"construct":[72],"chop-star.":[73]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}