{"id":"https://openalex.org/W3197560449","doi":"https://doi.org/10.1007/978-3-030-86205-3_2","title":"Non-disjoint Combined Unification and Closure by Equational Paramodulation","display_name":"Non-disjoint Combined Unification and Closure by Equational Paramodulation","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3197560449","doi":"https://doi.org/10.1007/978-3-030-86205-3_2","mag":"3197560449"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-86205-3_2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-86205-3_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":"conference-paper","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/A5022777411","display_name":"Serdar Erbatur","orcid":"https://orcid.org/0000-0002-7574-195X"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Serdar Erbatur","raw_affiliation_strings":["University of Texas at Dallas, Richardson, USA","University of Texas at Dallas [Richardson]"],"raw_orcid":"https://orcid.org/0000-0002-7574-195X","affiliations":[{"raw_affiliation_string":"University of Texas at Dallas, Richardson, USA","institution_ids":["https://openalex.org/I162577319"]},{"raw_affiliation_string":"University of Texas at Dallas [Richardson]","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049710569","display_name":"Andrew M. Marshall","orcid":"https://orcid.org/0000-0002-0522-8384"},"institutions":[{"id":"https://openalex.org/I191484440","display_name":"University of Mary Washington","ror":"https://ror.org/03b48gv34","country_code":"US","type":"education","lineage":["https://openalex.org/I191484440"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew M. Marshall","raw_affiliation_strings":["University of Mary Washington, Fredericksburg, USA","University of Mary Washington"],"raw_orcid":"https://orcid.org/0000-0002-0522-8384","affiliations":[{"raw_affiliation_string":"University of Mary Washington, Fredericksburg, USA","institution_ids":["https://openalex.org/I191484440"]},{"raw_affiliation_string":"University of Mary Washington","institution_ids":["https://openalex.org/I191484440"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076284994","display_name":"Christophe Ringeissen","orcid":"https://orcid.org/0000-0002-5937-6059"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Christophe Ringeissen","raw_affiliation_strings":["Universit\u00e9 de Lorraine, CNRS, Inria, LORIA, Nancy, France","Proof techniques for security protocols"],"raw_orcid":"https://orcid.org/0000-0002-5937-6059","affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Lorraine, CNRS, Inria, LORIA, Nancy, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210121838","https://openalex.org/I90183372"]},{"raw_affiliation_string":"Proof techniques for security protocols","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5076284994"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210121838","https://openalex.org/I90183372"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.1466,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.39173507,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"25","last_page":"42"},"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.9954000115394592,"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.9954000115394592,"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.9922999739646912,"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.9872000217437744,"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/unification","display_name":"Unification","score":0.9164960980415344},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.7974483966827393},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.7251244783401489},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6568730473518372},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5617748498916626},{"id":"https://openalex.org/keywords/normalization-property","display_name":"Normalization property","score":0.534242570400238},{"id":"https://openalex.org/keywords/modularity","display_name":"Modularity (biology)","score":0.4330100119113922},{"id":"https://openalex.org/keywords/rule-of-inference","display_name":"Rule of inference","score":0.4292398691177368},{"id":"https://openalex.org/keywords/disjoint-union","display_name":"Disjoint union (topology)","score":0.4232349991798401},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40213048458099365},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3982197046279907},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3845692276954651},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3699190616607666},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3436221480369568},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.25959205627441406},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.19297119975090027}],"concepts":[{"id":"https://openalex.org/C96146094","wikidata":"https://www.wikidata.org/wiki/Q609057","display_name":"Unification","level":2,"score":0.9164960980415344},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.7974483966827393},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.7251244783401489},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6568730473518372},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5617748498916626},{"id":"https://openalex.org/C159333733","wikidata":"https://www.wikidata.org/wiki/Q7051809","display_name":"Normalization property","level":2,"score":0.534242570400238},{"id":"https://openalex.org/C2779478453","wikidata":"https://www.wikidata.org/wiki/Q6889748","display_name":"Modularity (biology)","level":2,"score":0.4330100119113922},{"id":"https://openalex.org/C3746660","wikidata":"https://www.wikidata.org/wiki/Q1068763","display_name":"Rule of inference","level":2,"score":0.4292398691177368},{"id":"https://openalex.org/C7655956","wikidata":"https://www.wikidata.org/wiki/Q5282259","display_name":"Disjoint union (topology)","level":2,"score":0.4232349991798401},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40213048458099365},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3982197046279907},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3845692276954651},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3699190616607666},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3436221480369568},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.25959205627441406},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.19297119975090027},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-030-86205-3_2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-86205-3_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:HAL:hal-03346531v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-03346531","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"FroCos 2021 - 13th International Symposium on Frontiers of Combining Systems, Sep 2021, Birmingham, United Kingdom. pp.25-42, ⟨10.1007/978-3-030-86205-3_2⟩","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1483364966","https://openalex.org/W1526479036","https://openalex.org/W1536234924","https://openalex.org/W1566539263","https://openalex.org/W1570621944","https://openalex.org/W1583295953","https://openalex.org/W1802126264","https://openalex.org/W2005822708","https://openalex.org/W2015373596","https://openalex.org/W2042924775","https://openalex.org/W2082354652","https://openalex.org/W2087379083","https://openalex.org/W2112044534","https://openalex.org/W2124110088","https://openalex.org/W2138196723","https://openalex.org/W2149257851","https://openalex.org/W2316113835","https://openalex.org/W2400212107","https://openalex.org/W2735210188","https://openalex.org/W2741014554","https://openalex.org/W2771728256","https://openalex.org/W2911700234","https://openalex.org/W2911838076","https://openalex.org/W2913596757","https://openalex.org/W2969778797","https://openalex.org/W3022449549","https://openalex.org/W3130743698","https://openalex.org/W3196386255","https://openalex.org/W3197560449","https://openalex.org/W4230919050"],"related_works":["https://openalex.org/W2117548279","https://openalex.org/W1559627622","https://openalex.org/W2097470475","https://openalex.org/W2070252991","https://openalex.org/W2807449856","https://openalex.org/W2941201715","https://openalex.org/W2025727968","https://openalex.org/W3179244314","https://openalex.org/W2058702770","https://openalex.org/W1550166288"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}