{"id":"https://openalex.org/W2123726292","doi":"https://doi.org/10.1109/time.2003.1214882","title":"Towards the implementation of first-order temporal resolution: the expanding domain case","display_name":"Towards the implementation of first-order temporal resolution: the expanding domain case","publication_year":2004,"publication_date":"2004-01-23","ids":{"openalex":"https://openalex.org/W2123726292","doi":"https://doi.org/10.1109/time.2003.1214882","mag":"2123726292"},"language":"en","primary_location":{"id":"doi:10.1109/time.2003.1214882","is_oa":false,"landing_page_url":"https://doi.org/10.1109/time.2003.1214882","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":true,"oa_status":"gold","oa_url":"https://kclpure.kcl.ac.uk/portal/en/publications/4c31aeb3-5512-4906-a838-f87b31131f07","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","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"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013515770","display_name":"Clare Dixon","orcid":"https://orcid.org/0000-0002-4610-9533"},"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"]},{"id":"https://openalex.org/I4210119896","display_name":"King's College School","ror":"https://ror.org/02bbqcn27","country_code":"GB","type":"education","lineage":["https://openalex.org/I4210119896"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"C. Dixon","raw_affiliation_strings":["Department of Computer Science, King''s College, London, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, King''s College, London, UK","institution_ids":["https://openalex.org/I4210119896","https://openalex.org/I183935753"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013433601","display_name":"Alexander Degtyarev","orcid":"https://orcid.org/0000-0003-0967-2949"},"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":"A. Degtyarev","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/A5076121047","display_name":"Ullrich Hustadt","orcid":"https://orcid.org/0000-0002-0455-0267"},"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":"U. Hustadt","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":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.5513,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.95707754,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"72","last_page":"82"},"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.9997000098228455,"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.9997000098228455,"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.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.9990000128746033,"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.711733877658844},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6587837338447571},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.6453226804733276},{"id":"https://openalex.org/keywords/notation","display_name":"Notation","score":0.6405291557312012},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.6191769242286682},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.579882800579071},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.5752266049385071},{"id":"https://openalex.org/keywords/recursively-enumerable-language","display_name":"Recursively enumerable language","score":0.5220950841903687},{"id":"https://openalex.org/keywords/first-order","display_name":"First order","score":0.5080030560493469},{"id":"https://openalex.org/keywords/first-order-logic","display_name":"First-order logic","score":0.49177268147468567},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.483851820230484},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.46492719650268555},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.4368988871574402},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.4181613028049469},{"id":"https://openalex.org/keywords/interval-temporal-logic","display_name":"Interval temporal logic","score":0.4176277220249176},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41116929054260254},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40301746129989624},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3647919297218323},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1970556080341339},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.07947155833244324},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.07680585980415344}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.711733877658844},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6587837338447571},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6453226804733276},{"id":"https://openalex.org/C45357846","wikidata":"https://www.wikidata.org/wiki/Q2001982","display_name":"Notation","level":2,"score":0.6405291557312012},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.6191769242286682},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.579882800579071},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.5752266049385071},{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.5220950841903687},{"id":"https://openalex.org/C2987642246","wikidata":"https://www.wikidata.org/wiki/Q5452196","display_name":"First order","level":2,"score":0.5080030560493469},{"id":"https://openalex.org/C100481476","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"First-order logic","level":2,"score":0.49177268147468567},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.483851820230484},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.46492719650268555},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.4368988871574402},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.4181613028049469},{"id":"https://openalex.org/C162670838","wikidata":"https://www.wikidata.org/wiki/Q6057295","display_name":"Interval temporal logic","level":3,"score":0.4176277220249176},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41116929054260254},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40301746129989624},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3647919297218323},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1970556080341339},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.07947155833244324},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.07680585980415344},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1109/time.2003.1214882","is_oa":false,"landing_page_url":"https://doi.org/10.1109/time.2003.1214882","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:openaire_cris_publications/934d06c3-9fec-40b4-910d-c66146ff94bf","is_oa":false,"landing_page_url":"https://research.manchester.ac.uk/en/publications/934d06c3-9fec-40b4-910d-c66146ff94bf","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":"Konev, B, Dixon, C, Degtyarev, A, Fisher, M & Hustadt, U 2003, Towards the implementation of first-order temporal resolution: The expanding domain case. in Proceedings of the International Workshop on Temporal Representation and Reasoning. IEEE. https://doi.org/10.1109/TIME.2003.1214882","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.10.6393","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.6393","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/toimp_temp03.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.13.1360","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.1360","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/tr2003/ulcs-03-005.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.13.8258","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.8258","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/time03fine.ps","raw_type":"text"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/4c31aeb3-5512-4906-a838-f87b31131f07","is_oa":true,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/4c31aeb3-5512-4906-a838-f87b31131f07","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":"Konev , B , Dixon , C , Degtyarev , A , Fisher , M & Hustadt , U 2003 , Towards the Implementation of First-Order Temporal Resolution : the Expanding Domain Case . in M Reynolds & A Sattar (eds) , Proceedings. 10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic : 8-10 July 2003, Cairns, Queensland, Australia . International Symposium on Temporal Representation and Reasoning. Proceedings , Los Alamitos, California , pp. 72 - 82 , 4th International Conference on Temporal Logic (TIME-ICTL 2003)/10th International Symposium on Temporal Representation and Reasoning , Cairns , Australia , 1/01/2003 . https://doi.org/10.1109/TIME.2003.1214882","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.atira.dk:publications/934d06c3-9fec-40b4-910d-c66146ff94bf","is_oa":false,"landing_page_url":"https://www.research.manchester.ac.uk/portal/en/publications/towards-the-implementation-of-firstorder-temporal-resolution(934d06c3-9fec-40b4-910d-c66146ff94bf).html","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Konev, B, Dixon, C, Degtyarev, A, Fisher, M & Hustadt, U 2003, Towards the implementation of first-order temporal resolution: The expanding domain case. in Proceedings of the International Workshop on Temporal Representation and Reasoning. IEEE. https://doi.org/10.1109/TIME.2003.1214882","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/4c31aeb3-5512-4906-a838-f87b31131f07","is_oa":true,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/4c31aeb3-5512-4906-a838-f87b31131f07","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":"Konev , B , Dixon , C , Degtyarev , A , Fisher , M & Hustadt , U 2003 , Towards the Implementation of First-Order Temporal Resolution : the Expanding Domain Case . in M Reynolds & A Sattar (eds) , Proceedings. 10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic : 8-10 July 2003, Cairns, Queensland, Australia . International Symposium on Temporal Representation and Reasoning. Proceedings , Los Alamitos, California , pp. 72 - 82 , 4th International Conference on Temporal Logic (TIME-ICTL 2003)/10th International Symposium on Temporal Representation and Reasoning , Cairns , Australia , 1/01/2003 . https://doi.org/10.1109/TIME.2003.1214882","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1488387378","https://openalex.org/W1506588809","https://openalex.org/W1507112684","https://openalex.org/W1513576223","https://openalex.org/W1534502685","https://openalex.org/W1552843312","https://openalex.org/W1566830909","https://openalex.org/W1601924398","https://openalex.org/W1790807402","https://openalex.org/W1978000758","https://openalex.org/W2018216922","https://openalex.org/W2021704447","https://openalex.org/W2023808162","https://openalex.org/W2045554431","https://openalex.org/W2053231467","https://openalex.org/W2093916942","https://openalex.org/W2111581283","https://openalex.org/W2115309705","https://openalex.org/W2131024968","https://openalex.org/W2131225255","https://openalex.org/W2138126349","https://openalex.org/W2569375046","https://openalex.org/W4244421355","https://openalex.org/W6636235631","https://openalex.org/W6644709684","https://openalex.org/W6731819418"],"related_works":["https://openalex.org/W55334476","https://openalex.org/W59129029","https://openalex.org/W2396555304","https://openalex.org/W2143050727","https://openalex.org/W4232446061","https://openalex.org/W4285022830","https://openalex.org/W2512033590","https://openalex.org/W1612453857","https://openalex.org/W1688113412","https://openalex.org/W2352091395"],"abstract_inverted_index":{"First-order":[0],"temporal":[1,32,57],"logic":[2,23,58],"is":[3,24,106],"a":[4,47,65,101],"concise":[5],"and":[6,17,38,71,90,112],"powerful":[7],"notation,":[8],"with":[9],"many":[10],"potential":[11],"applications":[12],"in":[13,83],"both":[14],"Computer":[15],"Science":[16],"Artificial":[18],"Intelligence.":[19],"While":[20],"the":[21,52,94,98],"full":[22],"highly":[25],"complex,":[26],"recent":[27],"work":[28],"on":[29,100,108],"monodic":[30,53,69],"first-order":[31,56,110],"logics":[33],"has":[34],"identified":[35],"important":[36],"enumerable":[37],"even":[39],"decidable":[40],"fragments.":[41],"In":[42],"this":[43,84],"paper,":[44],"we":[45],"develop":[46],"clausal":[48],"resolution":[49,75,111],"method":[50,99,105],"for":[51,68,93],"fragment":[54],"of":[55],"over":[59],"expanding":[60],"domains.":[61],"We":[62,87,96],"first":[63],"define":[64],"normal":[66,85],"form":[67],"formulae":[70,82],"then":[72],"introduce":[73],"novel":[74],"calculi":[76],"that":[77],"can":[78],"be":[79,115],"applied":[80],"to":[81],"form.":[86],"state":[88],"correctness":[89],"completeness":[91],"results":[92],"method.":[95],"illustrate":[97],"comprehensive":[102],"example.":[103],"The":[104],"based":[107],"classical":[109],"can,":[113],"thus,":[114],"efficiently":[116],"implemented.":[117]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}