{"id":"https://openalex.org/W3204021812","doi":"https://doi.org/10.1007/978-3-030-99527-0_11","title":"Equivalence Checking for Orthocomplemented Bisemilattices in Log-Linear Time","display_name":"Equivalence Checking for Orthocomplemented Bisemilattices in Log-Linear Time","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W3204021812","doi":"https://doi.org/10.1007/978-3-030-99527-0_11","mag":"3204021812"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-99527-0_11","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-030-99527-0_11","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-030-99527-0_11.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/978-3-030-99527-0_11.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027080925","display_name":"Simon Guilloud","orcid":"https://orcid.org/0000-0001-8179-7549"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Simon Guilloud","raw_affiliation_strings":["EPFL IC LARA, Station 14, CH-1015, Lausanne, Switzerland"],"raw_orcid":"https://orcid.org/0000-0001-8179-7549","affiliations":[{"raw_affiliation_string":"EPFL IC LARA, Station 14, CH-1015, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008699657","display_name":"Viktor Kun\u010dak","orcid":"https://orcid.org/0000-0001-7044-9522"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Viktor Kun\u010dak","raw_affiliation_strings":["EPFL IC LARA, Station 14, CH-1015, Lausanne, Switzerland"],"raw_orcid":"https://orcid.org/0000-0001-7044-9522","affiliations":[{"raw_affiliation_string":"EPFL IC LARA, Station 14, CH-1015, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5027080925"],"corresponding_institution_ids":["https://openalex.org/I5124864"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":0.6822,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.66801561,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"196","last_page":"214"},"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.9998000264167786,"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.9998000264167786,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.996399998664856,"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/rewriting","display_name":"Rewriting","score":0.774215817451477},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6204850673675537},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5893406867980957},{"id":"https://openalex.org/keywords/gas-meter-prover","display_name":"Gas meter prover","score":0.5001771450042725},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4649554491043091},{"id":"https://openalex.org/keywords/scala","display_name":"Scala","score":0.44908401370048523},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.42427200078964233},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4055011570453644},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3795870244503021},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3097858428955078},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2048908770084381}],"concepts":[{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.774215817451477},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6204850673675537},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5893406867980957},{"id":"https://openalex.org/C159718280","wikidata":"https://www.wikidata.org/wiki/Q5526353","display_name":"Gas meter prover","level":3,"score":0.5001771450042725},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4649554491043091},{"id":"https://openalex.org/C109701466","wikidata":"https://www.wikidata.org/wiki/Q460584","display_name":"Scala","level":3,"score":0.44908401370048523},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.42427200078964233},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4055011570453644},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3795870244503021},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3097858428955078},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2048908770084381},{"id":"https://openalex.org/C548217200","wikidata":"https://www.wikidata.org/wiki/Q251","display_name":"Java","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-030-99527-0_11","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-030-99527-0_11","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-030-99527-0_11.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:infoscience.epfl.ch:292563","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/292563","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"conference proceedings"}],"best_oa_location":{"id":"doi:10.1007/978-3-030-99527-0_11","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-030-99527-0_11","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-030-99527-0_11.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[{"display_name":"Quality Education","score":0.44999998807907104,"id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3204021812.pdf","grobid_xml":"https://content.openalex.org/works/W3204021812.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W29617856","https://openalex.org/W344174780","https://openalex.org/W1489527380","https://openalex.org/W1530333737","https://openalex.org/W1571434026","https://openalex.org/W1583295953","https://openalex.org/W1600435877","https://openalex.org/W1656765819","https://openalex.org/W1844644571","https://openalex.org/W1973745704","https://openalex.org/W2032278512","https://openalex.org/W2036265926","https://openalex.org/W2039977878","https://openalex.org/W2044007958","https://openalex.org/W2056016391","https://openalex.org/W2056241458","https://openalex.org/W2057361103","https://openalex.org/W2063123613","https://openalex.org/W2064710033","https://openalex.org/W2098022011","https://openalex.org/W2146110773","https://openalex.org/W2147340301","https://openalex.org/W2147650421","https://openalex.org/W2151773188","https://openalex.org/W2167726638","https://openalex.org/W2908059907","https://openalex.org/W2914354623","https://openalex.org/W2927725532","https://openalex.org/W3123689272","https://openalex.org/W4211095514","https://openalex.org/W4230919050","https://openalex.org/W4241609463","https://openalex.org/W4245267086","https://openalex.org/W4246691913","https://openalex.org/W4249885861"],"related_works":["https://openalex.org/W4248962295","https://openalex.org/W2911968761","https://openalex.org/W2204875185","https://openalex.org/W205696660","https://openalex.org/W2491573813","https://openalex.org/W2135156156","https://openalex.org/W1594413440","https://openalex.org/W2804796737","https://openalex.org/W1565030492","https://openalex.org/W2013155780"],"abstract_inverted_index":{"Abstract":[0],"Motivated":[1],"by":[2,16],"proof":[3],"checking,":[4],"we":[5,42,70,85],"consider":[6],"the":[7,18,34,103],"problem":[8,36],"of":[9,13,48,60,67,90,105],"efficiently":[10],"establishing":[11],"equivalence":[12,89],"propositional":[14],"formulas":[15],"relaxing":[17],"completeness":[19],"requirements":[20],"while":[21],"still":[22],"providing":[23],"certain":[24],"guarantees.":[25],"We":[26,76,92,109,126],"present":[27],"a":[28,38,46,58,81,106,130],"quasilinear":[29],"time":[30],"algorithm":[31,64,79,114],"to":[32,72,87],"decide":[33,88],"word":[35],"on":[37],"natural":[39],"algebraic":[40],"structures":[41],"call":[43],"orthocomplemented":[44],"bisemilattices,":[45],"subtheory":[47],"Boolean":[49],"algebra.":[50],"The":[51],"starting":[52],"point":[53],"for":[54,65],"our":[55,95,113],"procedure":[56],"is":[57,98],"variation":[59],"Aho,":[61],"Hopcroft,":[62],"Ullman":[63],"isomorphism":[66],"trees,":[68],"which":[69],"generalize":[71],"directed":[73],"acyclic":[74],"graphs.":[75],"combine":[77],"this":[78,116],"with":[80],"term":[82],"rewriting":[83,96],"system":[84,97],"introduce":[86],"terms.":[91],"prove":[93],"that":[94,112],"terminating":[99],"and":[100,129],"confluent,":[101],"implying":[102],"existence":[104],"normal":[107,117],"form.":[108],"then":[110],"show":[111],"computes":[115],"form":[118],"in":[119,134],"log":[120],"linear":[121],"(and":[122],"thus":[123],"sub-quadratic)":[124],"time.":[125],"provide":[127],"pseudocode":[128],"minimal":[131],"working":[132],"implementation":[133],"Scala.":[135]},"counts_by_year":[{"year":2023,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}