{"id":"https://openalex.org/W2318473331","doi":"https://doi.org/10.1093/logcom/exu041","title":"A complete axiomatization of a temporal logic with obligation and robustness","display_name":"A complete axiomatization of a temporal logic with obligation and robustness","publication_year":2014,"publication_date":"2014-06-27","ids":{"openalex":"https://openalex.org/W2318473331","doi":"https://doi.org/10.1093/logcom/exu041","mag":"2318473331"},"language":"en","primary_location":{"id":"doi:10.1093/logcom/exu041","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exu041","pdf_url":null,"source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"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":"Journal of Logic and Computation","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/A5030763134","display_name":"Tim French","orcid":"https://orcid.org/0000-0002-0748-8040"},"institutions":[{"id":"https://openalex.org/I177877127","display_name":"The 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":"Tim French","raw_affiliation_strings":["School of Computer Science and Software Engineering, The University of Western Australia Crawley, Perth, WA 6009, Australia"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Software Engineering, The University of Western Australia Crawley, Perth, WA 6009, Australia","institution_ids":["https://openalex.org/I177877127"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016050623","display_name":"John C. McCabe-Dansted","orcid":"https://orcid.org/0000-0003-4343-4119"},"institutions":[{"id":"https://openalex.org/I177877127","display_name":"The University of Western Australia","ror":"https://ror.org/047272k79","country_code":"AU","type":"education","lineage":["https://openalex.org/I177877127"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"John C. McCabe-Dansted","raw_affiliation_strings":["School of Computer Science and Software Engineering, The University of Western Australia Crawley, Perth, WA 6009, Australia"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Software Engineering, The University of Western Australia Crawley, Perth, WA 6009, Australia","institution_ids":["https://openalex.org/I177877127"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036930915","display_name":"Mark Reynolds","orcid":"https://orcid.org/0000-0002-5415-0544"},"institutions":[{"id":"https://openalex.org/I177877127","display_name":"The University of Western Australia","ror":"https://ror.org/047272k79","country_code":"AU","type":"education","lineage":["https://openalex.org/I177877127"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Mark Reynolds","raw_affiliation_strings":["School of Computer Science and Software Engineering, The University of Western Australia Crawley, Perth, WA 6009, Australia"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Software Engineering, The University of Western Australia Crawley, Perth, WA 6009, Australia","institution_ids":["https://openalex.org/I177877127"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5030763134"],"corresponding_institution_ids":["https://openalex.org/I177877127"],"apc_list":{"value":4151,"currency":"USD","value_usd":4151},"apc_paid":null,"fwci":0.3656,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.67301095,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"26","issue":"5","first_page":"1439","last_page":"1467"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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.9998000264167786,"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.9994999766349792,"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.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"}}],"keywords":[{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.7450242638587952},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.7072635293006897},{"id":"https://openalex.org/keywords/ctl*","display_name":"CTL*","score":0.6804662942886353},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5725430250167847},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5481640100479126},{"id":"https://openalex.org/keywords/atomic-sentence","display_name":"Atomic sentence","score":0.5439432263374329},{"id":"https://openalex.org/keywords/computation-tree-logic","display_name":"Computation tree logic","score":0.5400590896606445},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.5317014455795288},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.5297846794128418},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.5029200911521912},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.4936264753341675},{"id":"https://openalex.org/keywords/obligation","display_name":"Obligation","score":0.4758826792240143},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.4387488067150116},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37181979417800903},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.35750508308410645},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3495936691761017},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32824569940567017},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17172035574913025},{"id":"https://openalex.org/keywords/sentence","display_name":"Sentence","score":0.08283370733261108}],"concepts":[{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.7450242638587952},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.7072635293006897},{"id":"https://openalex.org/C147969180","wikidata":"https://www.wikidata.org/wiki/Q5014579","display_name":"CTL*","level":4,"score":0.6804662942886353},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5725430250167847},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5481640100479126},{"id":"https://openalex.org/C34849589","wikidata":"https://www.wikidata.org/wiki/Q4345785","display_name":"Atomic sentence","level":3,"score":0.5439432263374329},{"id":"https://openalex.org/C198008173","wikidata":"https://www.wikidata.org/wiki/Q1040040","display_name":"Computation tree logic","level":3,"score":0.5400590896606445},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.5317014455795288},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.5297846794128418},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.5029200911521912},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.4936264753341675},{"id":"https://openalex.org/C2778447849","wikidata":"https://www.wikidata.org/wiki/Q2648051","display_name":"Obligation","level":2,"score":0.4758826792240143},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.4387488067150116},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37181979417800903},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.35750508308410645},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3495936691761017},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32824569940567017},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17172035574913025},{"id":"https://openalex.org/C2777530160","wikidata":"https://www.wikidata.org/wiki/Q41796","display_name":"Sentence","level":2,"score":0.08283370733261108},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C202751555","wikidata":"https://www.wikidata.org/wiki/Q221681","display_name":"In vitro","level":2,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0},{"id":"https://openalex.org/C154317977","wikidata":"https://www.wikidata.org/wiki/Q376266","display_name":"Cytotoxic T cell","level":3,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1093/logcom/exu041","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exu041","pdf_url":null,"source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"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":"Journal of Logic and Computation","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/239f9188-8e8b-4d5a-a20d-1aee2ccae980","is_oa":false,"landing_page_url":"https://research-repository.uwa.edu.au/en/publications/239f9188-8e8b-4d5a-a20d-1aee2ccae980","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 , Mccabe-Dansted , J & Reynolds , M 2014 , A complete axiomatization of a temporal logic with obligation and robustness . in JOURNAL OF LOGIC AND COMPUTATION . Oxford University Press , UK , pp. 1-29 . https://doi.org/10.1093/logcom/exu041","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:open-archive.highwire.org:logcom:26/5/1439","is_oa":false,"landing_page_url":"http://logcom.oxfordjournals.org/cgi/content/short/26/5/1439","pdf_url":null,"source":{"id":"https://openalex.org/S4406923041","display_name":"HighWire Press Open Archive","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"TEXT"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.699999988079071,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W111790121","https://openalex.org/W1493891971","https://openalex.org/W1512750313","https://openalex.org/W1534292130","https://openalex.org/W1572619574","https://openalex.org/W1594291313","https://openalex.org/W1887821159","https://openalex.org/W1998468461","https://openalex.org/W2003017965","https://openalex.org/W2005939826","https://openalex.org/W2012585852","https://openalex.org/W2028942690","https://openalex.org/W2055848982","https://openalex.org/W2072887965","https://openalex.org/W2077212436","https://openalex.org/W2088603570","https://openalex.org/W2088654937","https://openalex.org/W2107789250","https://openalex.org/W2116233866","https://openalex.org/W2126917225","https://openalex.org/W2153737593","https://openalex.org/W2163751633","https://openalex.org/W2168830266","https://openalex.org/W2485103889","https://openalex.org/W2758969507","https://openalex.org/W2912836678","https://openalex.org/W2914920010","https://openalex.org/W4206793348"],"related_works":["https://openalex.org/W858755136","https://openalex.org/W1981889059","https://openalex.org/W3005864166","https://openalex.org/W2143025323","https://openalex.org/W31328628","https://openalex.org/W3091862538","https://openalex.org/W1969550103","https://openalex.org/W1031601050","https://openalex.org/W2105438026","https://openalex.org/W2007635637"],"abstract_inverted_index":{"RoCTL*":[0,12,45,65],"was":[1],"proposed":[2],"to":[3,57,62],"model":[4],"and":[5,20,28,73,101],"specify":[6],"the":[7,16,42,47,50,63,81,84],"robustness":[8],"of":[9,18,44,49,83],"reactive":[10],"systems.":[11],"extended":[13],"CTL*":[14],"with":[15,30,46],"addition":[17],"Obligatory":[19],"Robustly":[21],"operators,":[22],"which":[23],"quantify":[24],"over":[25],"failure-free":[26],"paths":[27,29],"one":[31],"more":[32],"failure,":[33],"respectively.":[34],"This":[35],"article":[36],"gives":[37],"an":[38],"axiomatization":[39],"for":[40,104],"all":[41],"operators":[43],"exception":[48],"Until":[51],"operator;":[52],"this":[53,69],"fragment":[54],"is":[55],"able":[56],"express":[58],"similar":[59],"contrary-to-duty":[60],"obligations":[61],"full":[64],"logic.":[66],"We":[67,78,97],"call":[68],"formal":[70],"system":[71],"NORA,":[72],"give":[74],"a":[75],"completeness":[76],"proof.":[77],"also":[79],"consider":[80],"fragments":[82],"language":[85],"containing":[86],"only":[87],"path":[88],"quantifiers":[89],"but":[90],"where":[91],"atoms":[92],"are":[93],"dependent":[94],"on":[95],"histories.":[96],"examine":[98],"semantic":[99],"properties":[100],"potential":[102],"axiomatizations":[103],"these":[105],"fragments.":[106]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}