{"id":"https://openalex.org/W1498785244","doi":"https://doi.org/10.1007/978-3-540-39813-4_15","title":"Handling Equality in Monodic Temporal Resolution","display_name":"Handling Equality in Monodic Temporal Resolution","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W1498785244","doi":"https://doi.org/10.1007/978-3-540-39813-4_15","mag":"1498785244"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-39813-4_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-39813-4_15","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/2da48f4b-d26f-4dd5-89df-e575fcb46f91","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":"Boris Konev","raw_affiliation_strings":["Department of Computer Science, University of Liverpool, L69 7ZF, Liverpool, U.K"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Liverpool, L69 7ZF, Liverpool, U.K","institution_ids":["https://openalex.org/I146655781"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Anatoli Degtyarev","orcid":null},"institutions":[{"id":"https://openalex.org/I164213776","display_name":"King's College - North Carolina","ror":"https://ror.org/022f44628","country_code":"US","type":"education","lineage":["https://openalex.org/I164213776"]},{"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","US"],"is_corresponding":false,"raw_author_name":"Anatoli Degtyarev","raw_affiliation_strings":["Department of Computer Science, King\u2019s College London, WC2R 2LS, Strand, London, U.K","Department of Computer Science, King's College London, WC2R 2LS, Strand, London, U.K"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, King\u2019s College London, WC2R 2LS, Strand, London, U.K","institution_ids":["https://openalex.org/I183935753","https://openalex.org/I164213776"]},{"raw_affiliation_string":"Department of Computer Science, King's College London, WC2R 2LS, Strand, London, U.K","institution_ids":["https://openalex.org/I183935753","https://openalex.org/I4210119896"]}]},{"author_position":"last","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":["Department of Computer Science, University of Liverpool, L69 7ZF, Liverpool, U.K"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Liverpool, L69 7ZF, Liverpool, U.K","institution_ids":["https://openalex.org/I146655781"]}]}],"institutions":[],"countries_distinct_count":2,"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":2.2119,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.87706767,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"214","last_page":"228"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9993000030517578,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9993000030517578,"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.9984999895095825,"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.9983999729156494,"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.7594878673553467},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.7157869338989258},{"id":"https://openalex.org/keywords/notation","display_name":"Notation","score":0.6950513124465942},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6701840758323669},{"id":"https://openalex.org/keywords/recursively-enumerable-language","display_name":"Recursively enumerable language","score":0.6580538749694824},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.6452187895774841},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.6315796375274658},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.5779165029525757},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.5497688055038452},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4867284595966339},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.4711301028728485},{"id":"https://openalex.org/keywords/first-order-logic","display_name":"First-order logic","score":0.4599972665309906},{"id":"https://openalex.org/keywords/interval-temporal-logic","display_name":"Interval temporal logic","score":0.45365607738494873},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39230865240097046},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38213762640953064},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15067610144615173},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.08997765183448792}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7594878673553467},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7157869338989258},{"id":"https://openalex.org/C45357846","wikidata":"https://www.wikidata.org/wiki/Q2001982","display_name":"Notation","level":2,"score":0.6950513124465942},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6701840758323669},{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.6580538749694824},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.6452187895774841},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.6315796375274658},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.5779165029525757},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.5497688055038452},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4867284595966339},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.4711301028728485},{"id":"https://openalex.org/C100481476","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"First-order logic","level":2,"score":0.4599972665309906},{"id":"https://openalex.org/C162670838","wikidata":"https://www.wikidata.org/wiki/Q6057295","display_name":"Interval temporal logic","level":3,"score":0.45365607738494873},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39230865240097046},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38213762640953064},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15067610144615173},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.08997765183448792},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-540-39813-4_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-39813-4_15","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.5.6653","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.6653","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/eqhandl_lpar03.ps","raw_type":"text"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/2da48f4b-d26f-4dd5-89df-e575fcb46f91","is_oa":true,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/2da48f4b-d26f-4dd5-89df-e575fcb46f91","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 , Degtyarev , A & Fisher , M 2003 , Handling Equality in Monodic Temporal Resolution . in M Y Vardi & A Voronkov (eds) , Logic for Programming, Artificial Intelligence, and Reasoning : 10th International Conference, LPAR 2003, Almaty, Kazakhstan, September 22-26, 2003. Proceedings . Lecture Notes in Computer Science , vol. 2850 , pp. 214 - 228 , 10th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2003) , Almaty , Kazakhstan , 1/01/2003 . https://doi.org/10.1007/978-3-540-39813-4_15","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/2da48f4b-d26f-4dd5-89df-e575fcb46f91","is_oa":true,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/2da48f4b-d26f-4dd5-89df-e575fcb46f91","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 , Degtyarev , A & Fisher , M 2003 , Handling Equality in Monodic Temporal Resolution . in M Y Vardi & A Voronkov (eds) , Logic for Programming, Artificial Intelligence, and Reasoning : 10th International Conference, LPAR 2003, Almaty, Kazakhstan, September 22-26, 2003. Proceedings . Lecture Notes in Computer Science , vol. 2850 , pp. 214 - 228 , 10th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2003) , Almaty , Kazakhstan , 1/01/2003 . https://doi.org/10.1007/978-3-540-39813-4_15","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.6499999761581421}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1483892218","https://openalex.org/W1520981400","https://openalex.org/W1566830909","https://openalex.org/W1594660938","https://openalex.org/W1596722521","https://openalex.org/W1991981864","https://openalex.org/W2018216922","https://openalex.org/W2021704447","https://openalex.org/W2045554431","https://openalex.org/W2053231467","https://openalex.org/W2123433341","https://openalex.org/W2123726292","https://openalex.org/W2131024968","https://openalex.org/W2138126349","https://openalex.org/W2482511589","https://openalex.org/W2949672959","https://openalex.org/W4244421355"],"related_works":["https://openalex.org/W55334476","https://openalex.org/W4232446061","https://openalex.org/W2124110813","https://openalex.org/W2092656858","https://openalex.org/W4285022830","https://openalex.org/W4387188591","https://openalex.org/W2996932295","https://openalex.org/W946220898","https://openalex.org/W2352091395","https://openalex.org/W2168791893"],"abstract_inverted_index":{"First-order":[0],"temporal":[1,32,66],"logic":[2,23,67],"is":[3,24],"a":[4],"concise":[5],"and":[6,17,38,64,92,95],"powerful":[7],"notation,":[8],"with":[9,46,62,87],"many":[10],"potential":[11],"applications":[12],"in":[13,82],"both":[14],"Computer":[15],"Science":[16],"Artificial":[18],"Intelligence.":[19],"While":[20],"the":[21,43,53,58,83,88],"full":[22],"highly":[25],"complex,":[26],"recent":[27],"work":[28],"on":[29],"monodic":[30,54,60],"first-order":[31,65],"logics":[33],"has":[34],"identified":[35],"important":[36],"enumerable":[37],"even":[39],"decidable":[40],"fragments":[41],"including":[42],"guarded":[44,59],"fragment":[45,61],"equality.":[47],"In":[48],"this":[49],"paper,":[50],"we":[51],"specialise":[52],"resolution":[55,74,90],"method":[56],"to":[57,80],"equality":[63],"over":[68],"expanding":[69],"domains.":[70],"We":[71],"introduce":[72],"novel":[73],"calculi":[75],"that":[76],"can":[77],"be":[78],"applied":[79],"formulae":[81],"normal":[84],"form":[85],"associated":[86],"clausal":[89],"method,":[91],"state":[93],"correctness":[94],"completeness":[96],"results.":[97]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}