{"id":"https://openalex.org/W2167907675","doi":"https://doi.org/10.1109/time.2003.1214891","title":"Quantified propositional temporal logic with repeating states","display_name":"Quantified propositional temporal logic with repeating states","publication_year":2004,"publication_date":"2004-01-24","ids":{"openalex":"https://openalex.org/W2167907675","doi":"https://doi.org/10.1109/time.2003.1214891","mag":"2167907675"},"language":"en","primary_location":{"id":"doi:10.1109/time.2003.1214891","is_oa":false,"landing_page_url":"https://doi.org/10.1109/time.2003.1214891","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings.","raw_type":"proceedings-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/A5030763134","display_name":"Tim French","orcid":"https://orcid.org/0000-0002-0748-8040"},"institutions":[{"id":"https://openalex.org/I177877127","display_name":"University of Western Australia","ror":"https://ror.org/047272k79","country_code":"AU","type":"education","lineage":["https://openalex.org/I177877127"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"T. French","raw_affiliation_strings":["School of Computer Science and Software Engineering, University of Western Australia, Australia"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Software Engineering, University of Western Australia, Australia","institution_ids":["https://openalex.org/I177877127"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5030763134"],"corresponding_institution_ids":["https://openalex.org/I177877127"],"apc_list":null,"apc_paid":null,"fwci":2.7634,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.90546728,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"155","last_page":"165"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"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.9994000196456909,"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.9991999864578247,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9973000288009644,"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/computer-science","display_name":"Computer science","score":0.6156361103057861},{"id":"https://openalex.org/keywords/propositional-variable","display_name":"Propositional variable","score":0.5746949911117554},{"id":"https://openalex.org/keywords/autoepistemic-logic","display_name":"Autoepistemic logic","score":0.5173958539962769},{"id":"https://openalex.org/keywords/propositional-calculus","display_name":"Propositional calculus","score":0.47936660051345825},{"id":"https://openalex.org/keywords/zeroth-order-logic","display_name":"Zeroth-order logic","score":0.4408068060874939},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.4159690737724304},{"id":"https://openalex.org/keywords/intermediate-logic","display_name":"Intermediate logic","score":0.3434150815010071},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3096168041229248},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.20972329378128052},{"id":"https://openalex.org/keywords/multimodal-logic","display_name":"Multimodal logic","score":0.15515637397766113}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6156361103057861},{"id":"https://openalex.org/C14523651","wikidata":"https://www.wikidata.org/wiki/Q3492863","display_name":"Propositional variable","level":4,"score":0.5746949911117554},{"id":"https://openalex.org/C3845977","wikidata":"https://www.wikidata.org/wiki/Q4826262","display_name":"Autoepistemic logic","level":4,"score":0.5173958539962769},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.47936660051345825},{"id":"https://openalex.org/C110039528","wikidata":"https://www.wikidata.org/wiki/Q8069651","display_name":"Zeroth-order logic","level":4,"score":0.4408068060874939},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.4159690737724304},{"id":"https://openalex.org/C33203268","wikidata":"https://www.wikidata.org/wiki/Q5361594","display_name":"Intermediate logic","level":3,"score":0.3434150815010071},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3096168041229248},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.20972329378128052},{"id":"https://openalex.org/C203659156","wikidata":"https://www.wikidata.org/wiki/Q6934805","display_name":"Multimodal logic","level":3,"score":0.15515637397766113}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/time.2003.1214891","is_oa":false,"landing_page_url":"https://doi.org/10.1109/time.2003.1214891","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/386bfba9-c48b-473f-a30e-6ae70ad51571","is_oa":false,"landing_page_url":"https://research-repository.uwa.edu.au/en/publications/386bfba9-c48b-473f-a30e-6ae70ad51571","pdf_url":null,"source":{"id":"https://openalex.org/S4306402523","display_name":"UWA Profiles and Research Repository (University of Western Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177877127","host_organization_name":"The University of Western Australia","host_organization_lineage":["https://openalex.org/I177877127"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"French, T 2003, Quantified Propositional Temporal Logic with Repeating States. in M Reynolds & A Saltar (eds), Proceedings od Time-Ictl 2003. Cairns QLD edn, vol. N/A, IEEE, Institute of Electrical and Electronics Engineers, Piscataway, pp. 155-165.","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.4699999988079071}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W74805323","https://openalex.org/W1499833455","https://openalex.org/W1501571921","https://openalex.org/W1509862761","https://openalex.org/W1549420241","https://openalex.org/W1969184283","https://openalex.org/W1976773489","https://openalex.org/W2017025480","https://openalex.org/W2023808162","https://openalex.org/W2074944668","https://openalex.org/W2085533703","https://openalex.org/W2123970780","https://openalex.org/W2154938325","https://openalex.org/W2157005730","https://openalex.org/W2170352409","https://openalex.org/W2971698717","https://openalex.org/W6603065806","https://openalex.org/W6767435306"],"related_works":["https://openalex.org/W2041170190","https://openalex.org/W2023723270","https://openalex.org/W1574887629","https://openalex.org/W1963842936","https://openalex.org/W2016310740","https://openalex.org/W2757525098","https://openalex.org/W2187885897","https://openalex.org/W2157005730","https://openalex.org/W2020639449","https://openalex.org/W1835747325"],"abstract_inverted_index":{"Quantified":[0],"Propositional":[1],"Temporal":[2],"Logic":[3],"(QPTL)":[4],"is":[5,24,43,55,175],"a":[6,22,48,75,103,147,151],"linear":[7,28],"temporal":[8],"logic":[9],"that":[10,44,83,137],"allows":[11,97],"quantification":[12],"over":[13],"propositional":[14,37,126],"variables.":[15],"In":[16,65,128],"the":[17,45,70,80,91,111,119,123,129,141,170,180],"usual":[18,81],"semantics":[19,82,93,160],"for":[20,173,179],"QPTL,":[21,76],"model":[23],"an":[25],"infinite":[26],"discrete":[27],"sequence":[29],"of":[30,41,47,74,79,114,125,132,150],"states,":[31],"with":[32],"each":[33],"state":[34],"having":[35],"some":[36],"interpretation.":[38],"The":[39],"effect":[40],"this":[42,66,87,133],"interpretation":[46,59,107],"proposition":[49],"at":[50,60],"one":[51,174],"point":[52,62],"in":[53,63,122],"time":[54],"independent":[56],"from":[57],"its":[58],"another":[61],"time.":[64],"paper,":[67,134],"we":[68,135],"examine":[69],"expressivity":[71],"and":[72,177],"decidability":[73],"given":[77],"generalizations":[78],"do":[84],"not":[85,109],"have":[86],"restriction.":[88],"We":[89,154,168],"introduce":[90],"repeating":[92],"(QPTL/sup":[94],"R/),":[95],"which":[96,161],"states":[98,164],"to":[99,165],"be":[100,166],"repeated":[101],"throughout":[102],"model.":[104],"While":[105],"semantic":[106],"does":[108],"affect":[110],"unquantified":[112],"fragment":[113],"QPTL":[115],"it":[116],"significantly":[117],"increases":[118],"expressive":[120,159],"power":[121],"presence":[124],"quantification.":[127],"main":[130],"result":[131],"show":[136],"QPTL/sup":[138],"R/":[139],"makes":[140],"satisfiability":[142,171],"problem":[143,172],"highly":[144],"undecidable":[145],"through":[146],"complicated":[148],"encoding":[149],"tiling":[152],"problem.":[153],"also":[155],"investigate":[156],"two":[157],"less":[158],"still":[162],"allow":[163],"repeated.":[167],"prove":[169],"undecidable,":[176],"decidable":[178],"other.":[181]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}