{"id":"https://openalex.org/W1525642073","doi":"https://doi.org/10.1007/3-540-45616-3_7","title":"A Simplified Clausal Resolution Procedure for Propositional Linear-Time Temporal Logic","display_name":"A Simplified Clausal Resolution Procedure for Propositional Linear-Time Temporal Logic","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W1525642073","doi":"https://doi.org/10.1007/3-540-45616-3_7","mag":"1525642073"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-45616-3_7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45616-3_7","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://kclpure.kcl.ac.uk/portal/en/publications/d2dc90f3-57f7-4d0d-974b-189c4b3747ff","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Anatoli Degtyarev","orcid":null},"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":"Anatoli Degtyarev","raw_affiliation_strings":["Logic and Computation Group, Department of Computer Science, University of Liverpool, Liverpool, L69 7ZF, UK","#N##TAB##TAB##TAB##TAB# University of Liverpool#N##TAB##TAB##TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Logic and Computation Group, Department of Computer Science, University of Liverpool, Liverpool, L69 7ZF, UK","institution_ids":["https://openalex.org/I146655781"]},{"raw_affiliation_string":"#N##TAB##TAB##TAB##TAB# University of Liverpool#N##TAB##TAB##TAB#","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":"Michael Fisher","raw_affiliation_strings":["Logic and Computation Group, Department of Computer Science, University of Liverpool, Liverpool, L69 7ZF, UK","#N##TAB##TAB##TAB##TAB# University of Liverpool#N##TAB##TAB##TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Logic and Computation Group, Department of Computer Science, University of Liverpool, Liverpool, L69 7ZF, UK","institution_ids":["https://openalex.org/I146655781"]},{"raw_affiliation_string":"#N##TAB##TAB##TAB##TAB# University of Liverpool#N##TAB##TAB##TAB#","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":"Boris Konev","raw_affiliation_strings":["Logic and Computation Group, Department of Computer Science, University of Liverpool, Liverpool, L69 7ZF, UK","#N##TAB##TAB##TAB##TAB# University of Liverpool#N##TAB##TAB##TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Logic and Computation Group, Department of Computer Science, University of Liverpool, Liverpool, L69 7ZF, UK","institution_ids":["https://openalex.org/I146655781"]},{"raw_affiliation_string":"#N##TAB##TAB##TAB##TAB# University of Liverpool#N##TAB##TAB##TAB#","institution_ids":["https://openalex.org/I146655781"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":1.0805,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.7633812,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"85","last_page":"99"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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.9997000098228455,"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.9994000196456909,"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.9994000196456909,"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.7265987992286682},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.6557234525680542},{"id":"https://openalex.org/keywords/propositional-calculus","display_name":"Propositional calculus","score":0.6132157444953918},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.5783279538154602},{"id":"https://openalex.org/keywords/propositional-variable","display_name":"Propositional variable","score":0.5463387370109558},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.5421913266181946},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5349956750869751},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.528908371925354},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.5196896195411682},{"id":"https://openalex.org/keywords/interval-temporal-logic","display_name":"Interval temporal logic","score":0.48673298954963684},{"id":"https://openalex.org/keywords/propositional-formula","display_name":"Propositional formula","score":0.4442417025566101},{"id":"https://openalex.org/keywords/intermediate-logic","display_name":"Intermediate logic","score":0.3192722797393799},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2878841459751129},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23932433128356934},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.18980354070663452},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.10348305106163025}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7265987992286682},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.6557234525680542},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.6132157444953918},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.5783279538154602},{"id":"https://openalex.org/C14523651","wikidata":"https://www.wikidata.org/wiki/Q3492863","display_name":"Propositional variable","level":4,"score":0.5463387370109558},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.5421913266181946},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5349956750869751},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.528908371925354},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.5196896195411682},{"id":"https://openalex.org/C162670838","wikidata":"https://www.wikidata.org/wiki/Q6057295","display_name":"Interval temporal logic","level":3,"score":0.48673298954963684},{"id":"https://openalex.org/C74640108","wikidata":"https://www.wikidata.org/wiki/Q1372900","display_name":"Propositional formula","level":5,"score":0.4442417025566101},{"id":"https://openalex.org/C33203268","wikidata":"https://www.wikidata.org/wiki/Q5361594","display_name":"Intermediate logic","level":3,"score":0.3192722797393799},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2878841459751129},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23932433128356934},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.18980354070663452},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.10348305106163025}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/3-540-45616-3_7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45616-3_7","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.11.3790","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.3790","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dcs.kcl.ac.uk/staff/anatoli/papers/simpres_tabl.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.128.6689","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.6689","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/TABLEAUX.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.20.1715","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.1715","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/~michael/tableaux02.ps","raw_type":"text"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/d2dc90f3-57f7-4d0d-974b-189c4b3747ff","is_oa":true,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/d2dc90f3-57f7-4d0d-974b-189c4b3747ff","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Degtyarev , A , Fisher , M & Konev , B 2002 , A Simplified Clausal Resolution Procedure for Propositional Linear-Time Temporal Logic . in U Egly & C G Ferm\u00fcller (eds) , Automated Reasoning with Analytic Tableaux and Related Methods : International Conference, TABLEAUX 2002 Copenhagen, Denmark, July 30 \u2013 August 1, 2002 Proceedings . Lecture Notes in Computer Science , vol. 2381 , pp. 85-99 , Automated Reasoning with Analytic Tableaux and Related Methods, International Conference, TABLEAUX 2002 , Copenhagen , Denmark , 1/01/2002 . https://doi.org/10.1007/3-540-45616-3_7","raw_type":"bookPart"}],"best_oa_location":{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/d2dc90f3-57f7-4d0d-974b-189c4b3747ff","is_oa":true,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/d2dc90f3-57f7-4d0d-974b-189c4b3747ff","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Degtyarev , A , Fisher , M & Konev , B 2002 , A Simplified Clausal Resolution Procedure for Propositional Linear-Time Temporal Logic . in U Egly & C G Ferm\u00fcller (eds) , Automated Reasoning with Analytic Tableaux and Related Methods : International Conference, TABLEAUX 2002 Copenhagen, Denmark, July 30 \u2013 August 1, 2002 Proceedings . Lecture Notes in Computer Science , vol. 2381 , pp. 85-99 , Automated Reasoning with Analytic Tableaux and Related Methods, International Conference, TABLEAUX 2002 , Copenhagen , Denmark , 1/01/2002 . https://doi.org/10.1007/3-540-45616-3_7","raw_type":"bookPart"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.41999998688697815,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W142385736","https://openalex.org/W1506588809","https://openalex.org/W1523903952","https://openalex.org/W1543362735","https://openalex.org/W1566830909","https://openalex.org/W1589223644","https://openalex.org/W2016206563","https://openalex.org/W2093916942","https://openalex.org/W2103739844","https://openalex.org/W2115309705","https://openalex.org/W2131225255","https://openalex.org/W2133939266","https://openalex.org/W2146819619","https://openalex.org/W2340735175","https://openalex.org/W2402007929","https://openalex.org/W2913459036","https://openalex.org/W3140030144","https://openalex.org/W3216931281","https://openalex.org/W6634182046","https://openalex.org/W6684644128","https://openalex.org/W6805162605"],"related_works":["https://openalex.org/W2022840750","https://openalex.org/W1492881020","https://openalex.org/W1859833606","https://openalex.org/W2081976468","https://openalex.org/W1986625420","https://openalex.org/W2373482785","https://openalex.org/W62016554","https://openalex.org/W1969569184","https://openalex.org/W2285760602","https://openalex.org/W3200682096"],"abstract_inverted_index":{"The":[0,22],"clausal":[1,29,63],"resolution":[2,43,64],"method":[3,23,65],"for":[4,16,69],"propositional":[5],"linear-time":[6],"temporal":[7,20],"logics":[8],"is":[9,24],"well":[10],"known":[11],"and":[12,38],"provides":[13],"the":[14,51],"basis":[15],"a":[17,39,61],"number":[18,41],"of":[19,42,73],"provers.":[21],"based":[25],"on":[26],"an":[27],"intuitive":[28],"form,":[30],"called":[31],"SNF,":[32],"comprising":[33],"three":[34],"main":[35],"clause":[36],"types":[37],"small":[40],"rules.":[44],"In":[45],"this":[46,70],"paper,":[47],"we":[48],"show":[49],"how":[50,60],"normal":[52],"form":[53],"can":[54,66],"be":[55,67],"radically":[56],"simplified":[57,62],"and,":[58],"consequently,":[59],"defined":[68],"important":[71],"variety":[72],"logic.":[74]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}