{"id":"https://openalex.org/W4309694237","doi":"https://doi.org/10.1142/s0218213022600041","title":"Correlating the Community Structure of Constraint Satisfaction Problems with Search Time","display_name":"Correlating the Community Structure of Constraint Satisfaction Problems with Search Time","publication_year":2022,"publication_date":"2022-11-01","ids":{"openalex":"https://openalex.org/W4309694237","doi":"https://doi.org/10.1142/s0218213022600041"},"language":"en","primary_location":{"id":"doi:10.1142/s0218213022600041","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218213022600041","pdf_url":null,"source":{"id":"https://openalex.org/S178780388","display_name":"International Journal of Artificial Intelligence Tools","issn_l":"0218-2130","issn":["0218-2130","1793-6349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal on Artificial Intelligence Tools","raw_type":"journal-article"},"type":"article","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/A5002664981","display_name":"Michel Medema","orcid":"https://orcid.org/0000-0003-2243-6529"},"institutions":[{"id":"https://openalex.org/I169381384","display_name":"University of Groningen","ror":"https://ror.org/012p63287","country_code":"NL","type":"education","lineage":["https://openalex.org/I169381384"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Michel Medema","raw_affiliation_strings":["Bernoulli Institute, University of Groningen, Groningen, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0003-2243-6529","affiliations":[{"raw_affiliation_string":"Bernoulli Institute, University of Groningen, Groningen, The Netherlands","institution_ids":["https://openalex.org/I169381384"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000217379","display_name":"Alexander Lazovik","orcid":"https://orcid.org/0000-0002-6337-1840"},"institutions":[{"id":"https://openalex.org/I169381384","display_name":"University of Groningen","ror":"https://ror.org/012p63287","country_code":"NL","type":"education","lineage":["https://openalex.org/I169381384"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Alexander Lazovik","raw_affiliation_strings":["Bernoulli Institute, University of Groningen, Groningen, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bernoulli Institute, University of Groningen, Groningen, The Netherlands","institution_ids":["https://openalex.org/I169381384"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I169381384"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.15669905,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"31","issue":"07","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9933000206947327,"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.9933000206947327,"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/modularity","display_name":"Modularity (biology)","score":0.7970391511917114},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6707352995872498},{"id":"https://openalex.org/keywords/community-structure","display_name":"Community structure","score":0.5918647050857544},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5908328890800476},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5528669357299805},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.5202140212059021},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.5184288024902344},{"id":"https://openalex.org/keywords/decomposition-method","display_name":"Decomposition method (queueing theory)","score":0.4933110773563385},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4756429195404053},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4745534062385559},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.45848509669303894},{"id":"https://openalex.org/keywords/similitude","display_name":"Similitude","score":0.4246174693107605},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3999556005001068},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.31330445408821106},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3095766603946686},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19214925169944763},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.10475358366966248},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.09437668323516846},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.07584545016288757}],"concepts":[{"id":"https://openalex.org/C2779478453","wikidata":"https://www.wikidata.org/wiki/Q6889748","display_name":"Modularity (biology)","level":2,"score":0.7970391511917114},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6707352995872498},{"id":"https://openalex.org/C133079900","wikidata":"https://www.wikidata.org/wiki/Q5155065","display_name":"Community structure","level":2,"score":0.5918647050857544},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5908328890800476},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5528669357299805},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.5202140212059021},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.5184288024902344},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.4933110773563385},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4756429195404053},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4745534062385559},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.45848509669303894},{"id":"https://openalex.org/C143271835","wikidata":"https://www.wikidata.org/wiki/Q254515","display_name":"Similitude","level":2,"score":0.4246174693107605},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3999556005001068},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.31330445408821106},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3095766603946686},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19214925169944763},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.10475358366966248},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.09437668323516846},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07584545016288757},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0218213022600041","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218213022600041","pdf_url":null,"source":{"id":"https://openalex.org/S178780388","display_name":"International Journal of Artificial Intelligence Tools","issn_l":"0218-2130","issn":["0218-2130","1793-6349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal on Artificial Intelligence Tools","raw_type":"journal-article"},{"id":"pmh:oai:pure.rug.nl:openaire_cris_publications/a45434e6-a842-4830-a2e9-1b116f5e3dfb","is_oa":false,"landing_page_url":"https://research.rug.nl/en/publications/a45434e6-a842-4830-a2e9-1b116f5e3dfb","pdf_url":null,"source":{"id":"https://openalex.org/S4306400420","display_name":"University of Groningen research database (University of Groningen / Centre for Information Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169381384","host_organization_name":"University of Groningen","host_organization_lineage":["https://openalex.org/I169381384"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Medema, M & Lazovik, A 2022, 'Correlating the Community Structure of Constraint Satisfaction Problems with Search Time', International Journal on Artificial Intelligence Tools, vol. 31, no. 7. https://doi.org/10.1142/S0218213022600041","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2380722038","https://openalex.org/W1593899949","https://openalex.org/W46911244","https://openalex.org/W2011875321","https://openalex.org/W1603456671","https://openalex.org/W2180856585","https://openalex.org/W2121267470","https://openalex.org/W3114247777","https://openalex.org/W2137743780","https://openalex.org/W4309694237"],"abstract_inverted_index":{"A":[0,147],"constraint":[1,34,103],"satisfaction":[2],"problem":[3],"(CSP)":[4],"is,":[5],"in":[6,166],"its":[7],"most":[8],"general":[9,88,132],"form,":[10],"an":[11],"NP-complete":[12],"problem.":[13],"One":[14],"of":[15,19,32,44,50,68,72,86,108,159,173],"the":[16,26,33,61,65,83,123,131,137,141,153,156,160,174,180,185,188],"several":[17,87],"classes":[18],"tractable":[20,51],"problems":[21,27,53,73],"that":[22,94,163],"exist":[23],"contains":[24],"all":[25,111],"with":[28,54,74,179],"a":[29,41,48,69,115,194],"restricted":[30,45],"structure":[31,46,67,139],"scopes.":[35],"This":[36],"paper":[37],"studies":[38],"community":[39,66,117,138,175],"structure,":[40,118],"particular":[42],"type":[43,107],"underpinning":[47],"class":[49,125],"SAT":[52],"potentially":[55],"similar":[56],"relevance":[57],"to":[58,100,122,170],"CSPs.":[59],"Using":[60],"modularity,":[62],"it":[63,164,190],"explores":[64],"wide":[70],"variety":[71],"both":[75],"academic":[76],"and":[77,119,140,155,187],"industrial":[78],"relevance.":[79],"Its":[80],"impact":[81],"on":[82],"search":[84,142,157],"times":[85,143,158],"solvers,":[89,133],"as":[90,92],"well":[91],"one":[93],"uses":[95],"tree-decomposition,":[96,161],"is":[97],"also":[98,192],"analysed":[99],"determine":[101],"whether":[102],"solvers":[104],"exploit":[105],"this":[106],"structure.":[109,176],"Nearly":[110],"CSP":[112],"instances":[113],"have":[114,126],"strong":[116,134,182],"those":[120],"belonging":[121],"same":[124],"comparable":[127],"modularity":[128,154,186],"values.":[129],"For":[130],"correlations":[135],"between":[136,152,184,196],"are":[144],"not":[145],"apparent.":[146],"more":[148],"definite":[149],"correlation":[150,183],"exists":[151],"suggesting":[162],"might,":[165],"part,":[167],"be":[168],"able":[169],"take":[171],"advantage":[172],"However,":[177],"combined":[178],"relatively":[181],"tree-width,":[189],"could":[191],"indicate":[193],"similarity":[195],"these":[197],"two":[198],"measures.":[199]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}