{"id":"https://openalex.org/W7122374736","doi":"https://doi.org/10.1007/978-3-032-15700-3_1","title":"Producing Shorter Congruence Closure Proofs in\u00a0a\u00a0State-of-the-Art SMT Solver","display_name":"Producing Shorter Congruence Closure Proofs in\u00a0a\u00a0State-of-the-Art SMT Solver","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7122374736","doi":"https://doi.org/10.1007/978-3-032-15700-3_1"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-032-15700-3_1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-032-15700-3_1","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/A5058608892","display_name":"Bruno Andreotti","orcid":"https://orcid.org/0000-0003-0345-6495"},"institutions":[{"id":"https://openalex.org/I110200422","display_name":"Universidade Federal de Minas Gerais","ror":"https://ror.org/0176yjw32","country_code":"BR","type":"education","lineage":["https://openalex.org/I110200422"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Bruno Andreotti","raw_affiliation_strings":["Universidade Federal de Minas Gerais (UFMG), Belo Horizonte, Brazil"],"raw_orcid":"https://orcid.org/0000-0003-0345-6495","affiliations":[{"raw_affiliation_string":"Universidade Federal de Minas Gerais (UFMG), Belo Horizonte, Brazil","institution_ids":["https://openalex.org/I110200422"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000310752","display_name":"Haniel Barbosa","orcid":"https://orcid.org/0000-0003-0188-2300"},"institutions":[{"id":"https://openalex.org/I110200422","display_name":"Universidade Federal de Minas Gerais","ror":"https://ror.org/0176yjw32","country_code":"BR","type":"education","lineage":["https://openalex.org/I110200422"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Haniel Barbosa","raw_affiliation_strings":["Universidade Federal de Minas Gerais (UFMG), Belo Horizonte, Brazil"],"raw_orcid":"https://orcid.org/0000-0003-0188-2300","affiliations":[{"raw_affiliation_string":"Universidade Federal de Minas Gerais (UFMG), Belo Horizonte, Brazil","institution_ids":["https://openalex.org/I110200422"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5058608892"],"corresponding_institution_ids":["https://openalex.org/I110200422"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.26819923,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"20"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.7121999859809875,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.7121999859809875,"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.09109999984502792,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.0812000036239624,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/mathematical-proof","display_name":"Mathematical proof","score":0.718500018119812},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.6119999885559082},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.5806999802589417},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5480999946594238},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5419999957084656},{"id":"https://openalex.org/keywords/congruence","display_name":"Congruence (geometry)","score":0.5134999752044678},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.4361000061035156},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.39419999718666077}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.798799991607666},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.718500018119812},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.6119999885559082},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.5806999802589417},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5512999892234802},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5480999946594238},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5419999957084656},{"id":"https://openalex.org/C132074034","wikidata":"https://www.wikidata.org/wiki/Q154210","display_name":"Congruence (geometry)","level":2,"score":0.5134999752044678},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.4361000061035156},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.39419999718666077},{"id":"https://openalex.org/C143936061","wikidata":"https://www.wikidata.org/wiki/Q2030088","display_name":"DPLL algorithm","level":4,"score":0.38989999890327454},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34529998898506165},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.32179999351501465},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.32089999318122864},{"id":"https://openalex.org/C168167062","wikidata":"https://www.wikidata.org/wiki/Q1117970","display_name":"Component (thermodynamics)","level":2,"score":0.29409998655319214},{"id":"https://openalex.org/C2779907942","wikidata":"https://www.wikidata.org/wiki/Q7239630","display_name":"Predicate abstraction","level":3,"score":0.2890999913215637},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.27810001373291016},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.2759999930858612},{"id":"https://openalex.org/C149810388","wikidata":"https://www.wikidata.org/wiki/Q5374873","display_name":"Emulation","level":2,"score":0.27160000801086426},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.2671000063419342},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.26600000262260437},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.2653000056743622}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-032-15700-3_1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-032-15700-3_1","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"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41307970881462097,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W92083396","https://openalex.org/W1512564652","https://openalex.org/W1986022261","https://openalex.org/W2000346568","https://openalex.org/W2022846948","https://openalex.org/W2097414162","https://openalex.org/W2153131284","https://openalex.org/W2693644836","https://openalex.org/W2735859735","https://openalex.org/W2969891771","https://openalex.org/W3099525000","https://openalex.org/W3180619128","https://openalex.org/W3212273029","https://openalex.org/W4225922019","https://openalex.org/W4229840182","https://openalex.org/W4246264663","https://openalex.org/W4289104006","https://openalex.org/W4366721634","https://openalex.org/W4366721992","https://openalex.org/W4386947681","https://openalex.org/W6929091620","https://openalex.org/W6965408216","https://openalex.org/W7083048683"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-01-14T00:41:55.809242","created_date":"2026-01-13T00:00:00"}