{"id":"https://openalex.org/W2111581283","doi":"https://doi.org/10.1145/1119439.1119443","title":"Monodic temporal resolution","display_name":"Monodic temporal resolution","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2111581283","doi":"https://doi.org/10.1145/1119439.1119443","mag":"2111581283"},"language":"en","primary_location":{"id":"doi:10.1145/1119439.1119443","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1119439.1119443","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","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":null,"display_name":"Anatoli Degtyarev","orcid":null},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Anatoli Degtyarev","raw_affiliation_strings":["King's College London, London, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"King's College London, London, UK","institution_ids":["https://openalex.org/I183935753"]}]},{"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":["University of Liverpool, Liverpool, UK","University of LIverpool, Liverpool, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Liverpool, Liverpool, UK","institution_ids":["https://openalex.org/I146655781"]},{"raw_affiliation_string":"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":"Boris Konev","raw_affiliation_strings":["University of Liverpool, Liverpool, UK","University of LIverpool, Liverpool, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Liverpool, Liverpool, UK","institution_ids":["https://openalex.org/I146655781"]},{"raw_affiliation_string":"University of LIverpool, Liverpool, UK","institution_ids":["https://openalex.org/I146655781"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.9266,"has_fulltext":false,"cited_by_count":50,"citation_normalized_percentile":{"value":0.97221228,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"7","issue":"1","first_page":"108","last_page":"150"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9995999932289124,"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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9988999962806702,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.8202313184738159},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.7868474721908569},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.6983412504196167},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.671830415725708},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.6087212562561035},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.5369002819061279},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5004241466522217},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4210105538368225},{"id":"https://openalex.org/keywords/first-order-logic","display_name":"First-order logic","score":0.4125003516674042},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40280452370643616},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.3990311026573181},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2841614782810211},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.249782532453537}],"concepts":[{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.8202313184738159},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7868474721908569},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.6983412504196167},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.671830415725708},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.6087212562561035},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.5369002819061279},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5004241466522217},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4210105538368225},{"id":"https://openalex.org/C100481476","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"First-order logic","level":2,"score":0.4125003516674042},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40280452370643616},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.3990311026573181},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2841614782810211},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.249782532453537},{"id":"https://openalex.org/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1119439.1119443","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1119439.1119443","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/ac069f3f-a588-4a8d-950f-8610e0f71702","is_oa":false,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/ac069f3f-a588-4a8d-950f-8610e0f71702","pdf_url":null,"source":{"id":"https://openalex.org/S4306400216","display_name":"Research Portal (King's College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I183935753","host_organization_name":"King's College London","host_organization_lineage":["https://openalex.org/I183935753"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Degtyarev, A, Fisher, M & Konev, B 2006, 'Monodic temporal resolution', ACM Transactions on Computational Logic, vol. 7, no. 1, pp. 108 - 150. https://doi.org/10.1145/1119439.1119443","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":50,"referenced_works":["https://openalex.org/W26772505","https://openalex.org/W834709404","https://openalex.org/W1498785244","https://openalex.org/W1501787710","https://openalex.org/W1506588809","https://openalex.org/W1513426895","https://openalex.org/W1513576223","https://openalex.org/W1514347419","https://openalex.org/W1520981400","https://openalex.org/W1523903952","https://openalex.org/W1525642073","https://openalex.org/W1534502685","https://openalex.org/W1537740740","https://openalex.org/W1549008998","https://openalex.org/W1549122259","https://openalex.org/W1554551469","https://openalex.org/W1558608424","https://openalex.org/W1566830909","https://openalex.org/W1569431692","https://openalex.org/W1594660938","https://openalex.org/W1601924398","https://openalex.org/W1727899138","https://openalex.org/W1790807402","https://openalex.org/W1810595877","https://openalex.org/W1978000758","https://openalex.org/W1999997889","https://openalex.org/W2010714867","https://openalex.org/W2018216922","https://openalex.org/W2021704447","https://openalex.org/W2023808162","https://openalex.org/W2040127143","https://openalex.org/W2045554431","https://openalex.org/W2053231467","https://openalex.org/W2092497338","https://openalex.org/W2093916942","https://openalex.org/W2095195283","https://openalex.org/W2115309705","https://openalex.org/W2123433341","https://openalex.org/W2123726292","https://openalex.org/W2131225255","https://openalex.org/W2138126349","https://openalex.org/W2143353707","https://openalex.org/W2157005730","https://openalex.org/W2402007929","https://openalex.org/W2512056759","https://openalex.org/W2569375046","https://openalex.org/W2896499328","https://openalex.org/W3021872309","https://openalex.org/W4213358980","https://openalex.org/W4244421355"],"related_works":["https://openalex.org/W1971653407","https://openalex.org/W2124110813","https://openalex.org/W3021103820","https://openalex.org/W2763487042","https://openalex.org/W2031188261","https://openalex.org/W4232446061","https://openalex.org/W4285022830","https://openalex.org/W2020883449","https://openalex.org/W2583111156","https://openalex.org/W1494173831"],"abstract_inverted_index":{"Until":[0],"recently,":[1],"First-Order":[2],"Temporal":[3],"Logic":[4],"(FOTL)":[5],"has":[6,20,53],"been":[7],"only":[8,128],"partially":[9],"understood.":[10],"While":[11],"it":[12,68],"is":[13,69,129],"well":[14],"known":[15],"that":[16],"the":[17,31,50,86,145,156,176,180,207],"full":[18],"logic":[19,32],"no":[21],"finite":[22],"axiomatisation,":[23],"a":[24,38,45,107,118,136,215],"more":[25],"detailed":[26],"analysis":[27],"of":[28,30,58,147,155,167,175,188,194,202,209],"fragments":[29],"was":[33],"not":[34],"previously":[35],"available.":[36],"However,":[37],"breakthrough":[39],"by":[40,198],"Hodkinson":[41],"et":[42],"al.,":[43],"identifying":[44],"finitely":[46],"axiomatisable":[47],"fragment,":[48,52],"termed":[49],"monodic":[51,78,103,112,142,157,168,191,196,210],"led":[54],"to":[55,63,71,97],"improved":[56],"understanding":[57,154],"FOTL.":[59],"Yet,":[60],"in":[61,101,114,124,206,220],"order":[62],"utilise":[64],"these":[65],"theoretical":[66],"advances,":[67],"important":[70],"have":[72],"appropriate":[73],"proof":[74,138],"techniques":[75],"for":[76,93,111,122,140,179],"this":[77,80,125,130,148],"fragment.In":[79],"paper,":[81],"we":[82,161],"modify":[83],"and":[84,116,200,223],"extend":[85],"clausal":[87,131,181,203],"temporal":[88,95,182,204],"resolution":[89,120,132,183,205],"technique,":[90],"originally":[91],"developed":[92],"propositional":[94],"logics,":[96],"enable":[98],"its":[99],"use":[100,146],"such":[102],"fragments.":[104],"We":[105],"develop":[106],"specific":[108],"normal":[109],"form":[110],"formulae":[113,123],"FOTL,":[115],"provide":[117],"complete":[119],"calculus":[121],"form.":[126],"Not":[127],"technique":[133,139],"useful":[134],"as":[135,173],"practical":[137],"certain":[141],"classes,":[143,192],"but":[144],"approach":[149],"provides":[150],"us":[151],"with":[152,212,217],"increased":[153],"fragment.":[158],"In":[159],"particular,":[160],"here":[162],"show":[163],"how":[164],"several":[165],"features":[166],"FOTL":[169],"can":[170],"be":[171],"established":[172],"corollaries":[174],"completeness":[177,201],"result":[178],"method.":[184],"These":[185],"include":[186],"definitions":[187],"new":[189],"decidable":[190],"simplification":[193],"existing":[195],"classes":[197],"reductions,":[199],"case":[208,216],"logics":[211],"expanding":[213],"domains,":[214],"much":[218],"significance":[219],"both":[221],"theory":[222],"practice.":[224]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}