{"id":"https://openalex.org/W7138440573","doi":"https://doi.org/10.1609/aaai.v40i17.38434","title":"Aperiodic Tiling and Rhythmic Canons: A CP Journey","display_name":"Aperiodic Tiling and Rhythmic Canons: A CP Journey","publication_year":2026,"publication_date":"2026-03-14","ids":{"openalex":"https://openalex.org/W7138440573","doi":"https://doi.org/10.1609/aaai.v40i17.38434"},"language":"en","primary_location":{"id":"doi:10.1609/aaai.v40i17.38434","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i17.38434","pdf_url":null,"source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1609/aaai.v40i17.38434","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5123564524","display_name":"Guillaume Derval","orcid":null},"institutions":[{"id":"https://openalex.org/I157674565","display_name":"University of Li\u00e8ge","ror":"https://ror.org/00afp2z80","country_code":"BE","type":"education","lineage":["https://openalex.org/I157674565"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Guillaume Derval","raw_affiliation_strings":["University of Li\u00e8ge, Montefiore Institute, Smart Grids Lab, Li\u00e8ge, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Li\u00e8ge, Montefiore Institute, Smart Grids Lab, Li\u00e8ge, Belgium","institution_ids":["https://openalex.org/I157674565"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5129682603","display_name":"Christophe Lecoutre","orcid":null},"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/I44563897","display_name":"Universit\u00e9 d'Artois","ror":"https://ror.org/053x9s498","country_code":"FR","type":"education","lineage":["https://openalex.org/I44563897"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Christophe Lecoutre","raw_affiliation_strings":["Univ. Artois & CNRS, CRIL, Lens, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Univ. Artois & CNRS, CRIL, Lens, France","institution_ids":["https://openalex.org/I44563897","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.33673469,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"40","issue":"17","first_page":"14209","last_page":"14216"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.251800000667572,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.251800000667572,"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"}},{"id":"https://openalex.org/T10788","display_name":"Neuroscience and Music Perception","score":0.13009999692440033,"subfield":{"id":"https://openalex.org/subfields/2805","display_name":"Cognitive Neuroscience"},"field":{"id":"https://openalex.org/fields/28","display_name":"Neuroscience"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11887","display_name":"Quasicrystal Structures and Properties","score":0.12999999523162842,"subfield":{"id":"https://openalex.org/subfields/2505","display_name":"Materials Chemistry"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials 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.8913999795913696},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5029000043869019},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.4749999940395355},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4415999948978424},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.43860000371932983},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.3873000144958496},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.35109999775886536}],"concepts":[{"id":"https://openalex.org/C104247578","wikidata":"https://www.wikidata.org/wiki/Q4779368","display_name":"Aperiodic graph","level":2,"score":0.8913999795913696},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6071000099182129},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5029000043869019},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4991999864578247},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.4749999940395355},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4415999948978424},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.43860000371932983},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3955000042915344},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.3873000144958496},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3790999948978424},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3779999911785126},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.35109999775886536},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.33649998903274536},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.30820000171661377},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3073999881744385},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30570000410079956},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.2969000041484833},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.2849000096321106},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.28040000796318054},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.2556999921798706}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1609/aaai.v40i17.38434","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i17.38434","pdf_url":null,"source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},{"id":"pmh:oai:ojs.aaai.org:article/38434","is_oa":false,"landing_page_url":"https://ojs.aaai.org/index.php/AAAI/article/view/38434","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2159-5399","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:orbi.ulg.ac.be:2268/340287","is_oa":true,"landing_page_url":"https://orbi.uliege.be/handle/2268/340287","pdf_url":null,"source":{"id":"https://openalex.org/S4306400651","display_name":"Open Repository and Bibliography (University of Li\u00e8ge)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I157674565","host_organization_name":"University of Li\u00e8ge","host_organization_lineage":["https://openalex.org/I157674565"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence (2026-01)","raw_type":"http://purl.org/coar/resource_type/c_6501"}],"best_oa_location":{"id":"doi:10.1609/aaai.v40i17.38434","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i17.38434","pdf_url":null,"source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,61],"Aperiodic":[1],"Tiling":[2],"Complements":[3],"Problem":[4],"(ATCP)":[5],"involves":[6],"finding":[7],"the":[8,83,97,114,144],"full":[9],"set":[10,130],"of":[11,15,54,79,85,119],"(normalized)":[12],"aperiodic":[13],"complements":[14],"a":[16,22,68,91,120,135],"given":[17],"pattern.":[18],"This":[19],"has":[20],"become":[21],"classic":[23],"problem":[24],"in":[25,134,149],"music":[26],"theory,":[27],"with":[28,57,87,128],"some":[29],"recent":[30],"attempts":[31],"to":[32,74,100,132],"model":[33],"it":[34],"using":[35],"Integer":[36],"Linear":[37],"Programming":[38,59],"(ILP)":[39],"and":[40,50,90,140],"Boolean":[41],"Satisfiability":[42],"(SAT)":[43],"frameworks.":[44],"In":[45],"this":[46],"paper,":[47],"we":[48],"develop":[49],"compare":[51],"different":[52],"models":[53],"ATCP":[55],"encoded":[56],"Constraint":[58],"(CP).":[60],"most":[62],"effective":[63],"approach":[64,111],"admits":[65],"two":[66],"phases:":[67],"first":[69],"one":[70,93],"that":[71,94,109],"allows":[72],"us":[73],"merge":[75],"(join)":[76],"several":[77],"subsets":[78],"linear":[80],"constraints":[81],"under":[82],"form":[84],"tables":[86,99],"large":[88],"arity,":[89],"second":[92],"advantageously":[95],"exploits":[96],"generated":[98],"discard":[101],"periodic":[102],"tiling":[103],"complements.":[104],"Our":[105],"experimental":[106],"results":[107],"show":[108],"our":[110],"significantly":[112],"outperforms":[113],"state-of-the-art,":[115],"solving":[116],"every":[117],"instance":[118,146],"classical":[121],"benchmark":[122],"(standard":[123],"Vuza":[124],"rhythms":[125],"for":[126],"canons":[127],"periods":[129],"up":[131],"900)":[133],"time":[136],"between":[137],"5":[138],"seconds":[139],"2":[141],"minutes":[142],"(except":[143],"largest":[145],"being":[147],"solved":[148],"18":[150],"minutes).":[151]},"counts_by_year":[],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2026-03-18T00:00:00"}