{"id":"https://openalex.org/W2047151748","doi":"https://doi.org/10.2168/lmcs-8(3:16)2012","title":"Canonized Rewriting and Ground AC Completion Modulo Shostak Theories : Design and Implementation","display_name":"Canonized Rewriting and Ground AC Completion Modulo Shostak Theories : Design and Implementation","publication_year":2012,"publication_date":"2012-09-14","ids":{"openalex":"https://openalex.org/W2047151748","doi":"https://doi.org/10.2168/lmcs-8(3:16)2012","mag":"2047151748"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-8(3:16)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(3:16)2012","pdf_url":"https://lmcs.episciences.org/1034/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/1034/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Sylvain Conchon","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Sylvain Conchon","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Evelyne Contejean","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Evelyne Contejean","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Mohamed Iguernelala","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mohamed Iguernelala","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8914,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.79690608,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"Volume 8, Issue 3","issue":null,"first_page":null,"last_page":null},"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.8845999836921692,"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.8845999836921692,"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.027300000190734863,"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/T11567","display_name":"semigroups and automata theory","score":0.018699999898672104,"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/rewriting","display_name":"Rewriting","score":0.8914999961853027},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.8737999796867371},{"id":"https://openalex.org/keywords/associative-property","display_name":"Associative property","score":0.6456999778747559},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6444000005722046},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.6026999950408936},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.5938000082969666},{"id":"https://openalex.org/keywords/commutative-property","display_name":"Commutative property","score":0.5078999996185303},{"id":"https://openalex.org/keywords/signature","display_name":"Signature (topology)","score":0.421999990940094}],"concepts":[{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.8914999961853027},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.8737999796867371},{"id":"https://openalex.org/C159423971","wikidata":"https://www.wikidata.org/wiki/Q177251","display_name":"Associative property","level":2,"score":0.6456999778747559},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6444000005722046},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.6026999950408936},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5971999764442444},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.5938000082969666},{"id":"https://openalex.org/C183778304","wikidata":"https://www.wikidata.org/wiki/Q165474","display_name":"Commutative property","level":2,"score":0.5078999996185303},{"id":"https://openalex.org/C2779696439","wikidata":"https://www.wikidata.org/wiki/Q7512811","display_name":"Signature (topology)","level":2,"score":0.421999990940094},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.41519999504089355},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4023999869823456},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.40119999647140503},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3749000132083893},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3312000036239624},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.313400000333786},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3010999858379364},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.289900004863739},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2865999937057495},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.27399998903274536},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.2700999975204468},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.2696000039577484},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.26669999957084656},{"id":"https://openalex.org/C90988201","wikidata":"https://www.wikidata.org/wiki/Q255912","display_name":"Word problem (mathematics education)","level":2,"score":0.2535000145435333},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.25270000100135803},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25209999084472656}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.2168/lmcs-8(3:16)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(3:16)2012","pdf_url":"https://lmcs.episciences.org/1034/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1207.3262","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1207.3262","pdf_url":"https://arxiv.org/pdf/1207.3262","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:HAL:hal-00798082v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-00798082","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":"http://www.lmcs-online.org/ojs/viewarticle.php?id=1037&layout=abstract&iid=40","raw_type":"Journal articles"},{"id":"pmh:oai:doaj.org/article:69f8f21072da4aa1a8cb6a9e617ed92d","is_oa":true,"landing_page_url":"https://doaj.org/article/69f8f21072da4aa1a8cb6a9e617ed92d","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 8, Issue 3 (2012)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-8(3:16)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(3:16)2012","pdf_url":"https://lmcs.episciences.org/1034/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2047151748.pdf","grobid_xml":"https://content.openalex.org/works/W2047151748.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"AC-completion":[0,37,76],"efficiently":[1],"handles":[2],"equality":[3,48],"modulo":[4],"associative":[5],"and":[6,18,55,80,111,113],"commutative":[7],"function":[8],"symbols.":[9],"When":[10],"the":[11,15,24,42,45,78,84,118,121],"input":[12],"is":[13,67,107,114],"ground,":[14],"procedure":[16],"terminates":[17],"provides":[19],"a":[20,32,72,93],"decision":[21],"algorithm":[22],"for":[23,38,83],"word":[25],"problem.":[26],"In":[27],"this":[28],"paper,":[29],"we":[30],"present":[31,82],"modular":[33,73],"extension":[34],"of":[35,44,47,120],"ground":[36,75],"deciding":[39],"formulas":[40],"in":[41,71,103],"combination":[43],"theory":[46,61,85],"with":[49,77],"user-defined":[50],"AC":[51],"symbols,":[52],"uninterpreted":[53],"symbols":[54],"an":[56],"arbitrary":[57],"signature":[58],"disjoint":[59],"Shostak":[60],"X.":[62,86],"Our":[63],"algorithm,":[64],"called":[65],"AC(X),":[66],"obtained":[68],"by":[69],"augmenting":[70],"way":[74],"canonizer":[79],"solver":[81],"This":[87],"integration":[88],"rests":[89],"on":[90],"canonized":[91],"rewriting,":[92,99],"new":[94],"relation":[95],"reminiscent":[96],"to":[97,116],"normalized":[98],"which":[100],"integrates":[101],"canonizers":[102],"rewriting":[104],"steps.":[105],"AC(X)":[106],"proved":[108],"sound,":[109],"complete":[110],"terminating,":[112],"implemented":[115],"extend":[117],"core":[119],"Alt-Ergo":[122],"theorem":[123],"prover.":[124]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2016-06-24T00:00:00"}