{"id":"https://openalex.org/W2162357200","doi":"https://doi.org/10.1109/time.2006.19","title":"Is There a Future for Deductive Temporal Verification?","display_name":"Is There a Future for Deductive Temporal Verification?","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2162357200","doi":"https://doi.org/10.1109/time.2006.19","mag":"2162357200"},"language":"en","primary_location":{"id":"doi:10.1109/time.2006.19","is_oa":false,"landing_page_url":"https://doi.org/10.1109/time.2006.19","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Thirteenth International Symposium on Temporal Representation and Reasoning (TIME'06)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5013515770","display_name":"Clare Dixon","orcid":"https://orcid.org/0000-0002-4610-9533"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"C. Dixon","raw_affiliation_strings":["Department of Computer Science, University of Liverpool, Liverpool, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Liverpool, Liverpool, UK","institution_ids":["https://openalex.org/I146655781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067587488","display_name":"Michael Fisher","orcid":"https://orcid.org/0000-0002-0875-3862"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"M. Fisher","raw_affiliation_strings":["Department of Computer Science, University of Liverpool, Liverpool, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Liverpool, Liverpool, UK","institution_ids":["https://openalex.org/I146655781"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032067568","display_name":"Boris Konev","orcid":"https://orcid.org/0000-0002-6507-0494"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"B. Konev","raw_affiliation_strings":["Department of Computer Science, University of Liverpool, Liverpool, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Liverpool, Liverpool, UK","institution_ids":["https://openalex.org/I146655781"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I146655781"],"apc_list":null,"apc_paid":null,"fwci":1.4703,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.80674194,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"1043","issue":null,"first_page":"11","last_page":"18"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":1.0,"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":1.0,"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.9984999895095825,"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.994700014591217,"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/b/u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.728402853012085},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.7093544602394104},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6251368522644043},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5929030179977417},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.5805287957191467},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.5631628036499023},{"id":"https://openalex.org/keywords/propositional-calculus","display_name":"Propositional calculus","score":0.5342288017272949},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.5099858045578003},{"id":"https://openalex.org/keywords/propositional-variable","display_name":"Propositional variable","score":0.5001070499420166},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.477245569229126},{"id":"https://openalex.org/keywords/interval-temporal-logic","display_name":"Interval temporal logic","score":0.44161680340766907},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43690311908721924},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.2750089764595032},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.25182557106018066},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.21524038910865784},{"id":"https://openalex.org/keywords/intermediate-logic","display_name":"Intermediate logic","score":0.1838180124759674}],"concepts":[{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.728402853012085},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.7093544602394104},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6251368522644043},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5929030179977417},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.5805287957191467},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.5631628036499023},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.5342288017272949},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.5099858045578003},{"id":"https://openalex.org/C14523651","wikidata":"https://www.wikidata.org/wiki/Q3492863","display_name":"Propositional variable","level":4,"score":0.5001070499420166},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.477245569229126},{"id":"https://openalex.org/C162670838","wikidata":"https://www.wikidata.org/wiki/Q6057295","display_name":"Interval temporal logic","level":3,"score":0.44161680340766907},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43690311908721924},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.2750089764595032},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.25182557106018066},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.21524038910865784},{"id":"https://openalex.org/C33203268","wikidata":"https://www.wikidata.org/wiki/Q5361594","display_name":"Intermediate logic","level":3,"score":0.1838180124759674}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/time.2006.19","is_oa":false,"landing_page_url":"https://doi.org/10.1109/time.2006.19","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Thirteenth International Symposium on Temporal Representation and Reasoning (TIME'06)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/dc2af87e-c7b0-43d4-9450-dbb50f27b8d9","is_oa":false,"landing_page_url":"https://research.manchester.ac.uk/en/publications/dc2af87e-c7b0-43d4-9450-dbb50f27b8d9","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Dixon, C, Fisher, M & Konev, B 2006, Is there a future for deductive temporal verification? in Proceedings of the International Workshop on Temporal Representation and Reasoning. https://doi.org/10.1109/TIME.2006.19","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.122.9370","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.122.9370","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.csc.liv.ac.uk/~konev/publications/files/time06e.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.65.5046","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.65.5046","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.csc.liv.ac.uk/research/techreports/tr2006/ulcs-06-001.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4300000071525574,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W68069235","https://openalex.org/W1486951200","https://openalex.org/W1488387378","https://openalex.org/W1500227673","https://openalex.org/W1501787710","https://openalex.org/W1512310098","https://openalex.org/W1525642073","https://openalex.org/W1575118279","https://openalex.org/W1612453857","https://openalex.org/W1810595877","https://openalex.org/W1943502734","https://openalex.org/W1976773489","https://openalex.org/W1990608809","https://openalex.org/W2003227046","https://openalex.org/W2026379532","https://openalex.org/W2053231467","https://openalex.org/W2111581283","https://openalex.org/W2131225255","https://openalex.org/W2143353707","https://openalex.org/W2157319504","https://openalex.org/W2162357200","https://openalex.org/W2166566648","https://openalex.org/W2806619258","https://openalex.org/W2913459036","https://openalex.org/W6629142598","https://openalex.org/W6629845550","https://openalex.org/W6630121347","https://openalex.org/W6630713009","https://openalex.org/W6631506586","https://openalex.org/W6638269692"],"related_works":["https://openalex.org/W2108751562","https://openalex.org/W2133149947","https://openalex.org/W1513159096","https://openalex.org/W2110468917","https://openalex.org/W2338673411","https://openalex.org/W1849580669","https://openalex.org/W2351899084","https://openalex.org/W2056547264","https://openalex.org/W1514330492","https://openalex.org/W2283260145"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,117],"consider":[4],"a":[5,16,47,68,90,122],"tractable":[6],"sub-class":[7],"of":[8,54,59,111],"propositional":[9],"linear":[10],"time":[11],"temporal":[12,131],"logic,":[13,76],"and":[14,77],"provide":[15],"complete":[17],"clausal":[18],"resolution":[19],"calculus":[20],"for":[21,46,128],"it.":[22],"The":[23],"fragment":[24],"is":[25,50,62],"important":[26],"as":[27,42,100],"it":[28],"can":[29,71,80],"be":[30,72,81],"used":[31],"to":[32,95,108],"represent":[33],"simple":[34],"Buchi":[35,48,69,114],"automata.":[36],"We":[37],"also":[38,118],"show":[39],"that,":[40],"just":[41],"the":[43,52,106,126],"emptiness":[44,79,110],"check":[45,109],"automaton":[49,70],"tractable,":[51],"complexity":[53],"deciding":[55],"unsatisfiability,":[56],"via":[57,84],"resolution,":[58],"our":[60,75],"logic":[61,123],"polynomial":[63],"(rather":[64],"than":[65],"exponential).":[66],"Consequently,":[67],"represented":[73],"within":[74],"its":[78],"tractably":[82],"decided":[83],"deductive":[85,130],"methods.":[86],"This":[87],"may":[88],"have":[89],"significant":[91],"impact":[92],"upon":[93],"approaches":[94],"verification,":[96],"since":[97],"techniques":[98],"such":[99,121],"model":[101],"checking":[102],"inherently":[103],"depend":[104],"on":[105],"ability":[107],"an":[112],"appropriate":[113],"automaton.":[115],"Thus,":[116],"discuss":[119],"how":[120],"might":[124],"form":[125],"basis":[127],"practical":[129],"verification":[132]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}