{"id":"https://openalex.org/W1505276020","doi":"https://doi.org/10.1007/3-540-44612-5_13","title":"Equation Satisfiability and Program Satisfiability for Finite Monoids","display_name":"Equation Satisfiability and Program Satisfiability for Finite Monoids","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W1505276020","doi":"https://doi.org/10.1007/3-540-44612-5_13","mag":"1505276020"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-44612-5_13","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44612-5_13","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/A5086624973","display_name":"David Mix Barrington","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"David Mix Barrington","raw_affiliation_strings":["Dept. of Computer Science, University of Massachussets, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, University of Massachussets, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039352699","display_name":"Pierre McKenzie","orcid":"https://orcid.org/0000-0002-2483-8305"},"institutions":[{"id":"https://openalex.org/I70931966","display_name":"Universit\u00e9 de Montr\u00e9al","ror":"https://ror.org/0161xgx34","country_code":"CA","type":"education","lineage":["https://openalex.org/I70931966"]},{"id":"https://openalex.org/I4210161954","display_name":"D\u00e9partement d'Informatique","ror":"https://ror.org/05y6rqs46","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I2746051580","https://openalex.org/I29607241","https://openalex.org/I4210159245","https://openalex.org/I4210161954"]},{"id":"https://openalex.org/I4210111842","display_name":"Computer Research Institute of Montr\u00e9al","ror":"https://ror.org/0279d5115","country_code":"CA","type":"nonprofit","lineage":["https://openalex.org/I4210111842"]}],"countries":["CA","FR"],"is_corresponding":false,"raw_author_name":"Pierre McKenzie","raw_affiliation_strings":["Dept. d\u2019Informatique et de Recherche Op\u00e9rationnelle, Universit\u00e9 de Montr\u00e9al, Montr\u00e9al, Canada","Dept. d'Informatique et de Recherche Op\u00e9rationnelle, Universit\u00e9 de Montr\u00e9al, Montr\u00e9al, Canada"],"affiliations":[{"raw_affiliation_string":"Dept. d\u2019Informatique et de Recherche Op\u00e9rationnelle, Universit\u00e9 de Montr\u00e9al, Montr\u00e9al, Canada","institution_ids":["https://openalex.org/I4210111842","https://openalex.org/I4210161954","https://openalex.org/I70931966"]},{"raw_affiliation_string":"Dept. d'Informatique et de Recherche Op\u00e9rationnelle, Universit\u00e9 de Montr\u00e9al, Montr\u00e9al, Canada","institution_ids":["https://openalex.org/I70931966"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103366945","display_name":"Cris Moore","orcid":null},"institutions":[{"id":"https://openalex.org/I169521973","display_name":"University of New Mexico","ror":"https://ror.org/05fs6jp91","country_code":"US","type":"education","lineage":["https://openalex.org/I169521973"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Cris Moore","raw_affiliation_strings":["Dept. of Computer Science, University of New Mexico, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, University of New Mexico, USA","institution_ids":["https://openalex.org/I169521973"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044226857","display_name":"Pascal Tesson","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pascal Tesson","raw_affiliation_strings":["School of Computer Science, McGill University, USA"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, McGill University, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000703561","display_name":"Denis Th\u00e9rien","orcid":"https://orcid.org/0000-0002-7545-909X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Denis Th\u00e9rien","raw_affiliation_strings":["School of Computer Science, McGill University, USA"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, McGill University, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5086624973"],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.7959,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.83752039,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"172","last_page":"181"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998999834060669,"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/T11567","display_name":"semigroups and automata theory","score":0.9998999834060669,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9986000061035156,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980999827384949,"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/aperiodic-graph","display_name":"Aperiodic graph","score":0.6843900680541992},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6387851238250732},{"id":"https://openalex.org/keywords/monoid","display_name":"Monoid","score":0.5749365091323853},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.526598334312439},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.510314404964447},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49779582023620605},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46052345633506775},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.45249199867248535},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.43176716566085815},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.4264554977416992},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39816394448280334},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.34110331535339355},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.15274250507354736}],"concepts":[{"id":"https://openalex.org/C104247578","wikidata":"https://www.wikidata.org/wiki/Q4779368","display_name":"Aperiodic graph","level":2,"score":0.6843900680541992},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6387851238250732},{"id":"https://openalex.org/C206901836","wikidata":"https://www.wikidata.org/wiki/Q208237","display_name":"Monoid","level":2,"score":0.5749365091323853},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.526598334312439},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.510314404964447},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49779582023620605},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46052345633506775},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.45249199867248535},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.43176716566085815},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.4264554977416992},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39816394448280334},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.34110331535339355},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.15274250507354736},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-44612-5_13","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44612-5_13","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1500453128","https://openalex.org/W1928998953","https://openalex.org/W1976025900","https://openalex.org/W2045171534","https://openalex.org/W2104952158","https://openalex.org/W2167954650","https://openalex.org/W4240781210"],"related_works":["https://openalex.org/W2123455940","https://openalex.org/W2962720765","https://openalex.org/W2984322096","https://openalex.org/W2524361808","https://openalex.org/W4292002971","https://openalex.org/W3176904788","https://openalex.org/W21597398","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W2268872489"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}