{"id":"https://openalex.org/W3209686037","doi":"https://doi.org/10.1007/978-3-030-89716-1_2","title":"Theorem Proving Using Clausal Resolution: From Past to Present","display_name":"Theorem Proving Using Clausal Resolution: From Past to Present","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3209686037","doi":"https://doi.org/10.1007/978-3-030-89716-1_2","mag":"3209686037"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-89716-1_2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-89716-1_2","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":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/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Clare Dixon","raw_affiliation_strings":["Department of Computer Science, University of Manchester, Manchester, UK"],"raw_orcid":"https://orcid.org/0000-0002-4610-9533","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Manchester, Manchester, UK","institution_ids":["https://openalex.org/I28407311"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5013515770"],"corresponding_institution_ids":["https://openalex.org/I28407311"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.359,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.61550698,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"19","last_page":"27"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998999834060669,"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.9998999834060669,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9994999766349792,"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.9990000128746033,"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/computer-science","display_name":"Computer science","score":0.7812981605529785},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.6438133716583252},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.6210452318191528},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4669559895992279},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.4313170313835144},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3952162265777588}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7812981605529785},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.6438133716583252},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.6210452318191528},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4669559895992279},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.4313170313835144},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3952162265777588},{"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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-030-89716-1_2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-89716-1_2","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:pure.atira.dk:openaire_cris_publications/bfe4613f-b70f-410c-94de-c789cbb93ffa","is_oa":false,"landing_page_url":"https://research.manchester.ac.uk/en/publications/bfe4613f-b70f-410c-94de-c789cbb93ffa","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 2021, Theorem Proving Using Clausal Resolution: From Past to Present. in International Conference on Reachability Problems : RP 2021: Reachability Problems. Lecture Notes in Computer Science, vol. 13035, pp. 19-27. https://doi.org/10.1007/978-3-030-89716-1_2","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:publications/bfe4613f-b70f-410c-94de-c789cbb93ffa","is_oa":false,"landing_page_url":"https://link.springer.com/10.1007/978-3-030-89716-1_2","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":"Dixon, C 2021, Theorem Proving Using Clausal Resolution: From Past to Present. in International Conference on Reachability Problems : RP 2021: Reachability Problems. Lecture Notes in Computer Science, vol. 13035, pp. 19-27. https://doi.org/10.1007/978-3-030-89716-1_2","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.44999998807907104,"id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G6041094040","display_name":null,"funder_award_id":"EP/N007565/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1488387378","https://openalex.org/W1501787710","https://openalex.org/W1506588809","https://openalex.org/W1513576223","https://openalex.org/W1514102160","https://openalex.org/W1523903952","https://openalex.org/W1537740740","https://openalex.org/W1543362735","https://openalex.org/W1608490958","https://openalex.org/W1671579239","https://openalex.org/W1698862083","https://openalex.org/W1765447656","https://openalex.org/W1807555267","https://openalex.org/W1810595877","https://openalex.org/W1968191809","https://openalex.org/W1969550103","https://openalex.org/W2016570675","https://openalex.org/W2024016985","https://openalex.org/W2042977795","https://openalex.org/W2045554431","https://openalex.org/W2048355938","https://openalex.org/W2053231467","https://openalex.org/W2080448334","https://openalex.org/W2093916942","https://openalex.org/W2111581283","https://openalex.org/W2131225255","https://openalex.org/W2143353707","https://openalex.org/W2494487003","https://openalex.org/W2945005331","https://openalex.org/W2968764582","https://openalex.org/W3014002670","https://openalex.org/W3176063663","https://openalex.org/W6676108856"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2317200988","https://openalex.org/W2052122378","https://openalex.org/W2544423928","https://openalex.org/W2053286651","https://openalex.org/W2285156239","https://openalex.org/W1656258","https://openalex.org/W10462600","https://openalex.org/W1755814340"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}