{"id":"https://openalex.org/W13307687","doi":"https://doi.org/10.1017/s0956796800020050","title":"Domain generating functions for solving constraint satisfaction problems","display_name":"Domain generating functions for solving constraint satisfaction problems","publication_year":1991,"publication_date":"1991-04-01","ids":{"openalex":"https://openalex.org/W13307687","doi":"https://doi.org/10.1017/s0956796800020050","mag":"13307687"},"language":"en","primary_location":{"id":"doi:10.1017/s0956796800020050","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0956796800020050","pdf_url":null,"source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","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/A5081692128","display_name":"Fran\u00e7ois Major","orcid":"https://orcid.org/0000-0003-1743-0480"},"institutions":[{"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"]},{"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"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Fran\u00e7ois Major","raw_affiliation_strings":["D\u00e9partement d'informatique et de Recherche Op\u00e9rationnelle, Universit\u00e9 de Montr\u00e9al, Canada","UNIVERSITE DE MONTREAL"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"D\u00e9partement d'informatique et de Recherche Op\u00e9rationnelle, Universit\u00e9 de Montr\u00e9al, Canada","institution_ids":["https://openalex.org/I4210111842","https://openalex.org/I70931966"]},{"raw_affiliation_string":"UNIVERSITE DE MONTREAL","institution_ids":["https://openalex.org/I70931966"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004268705","display_name":"Guy Lapalme","orcid":null},"institutions":[{"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"]},{"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"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Guy Lapalme","raw_affiliation_strings":["D\u00e9partement d'informatique et de Recherche Op\u00e9rationnelle, Universit\u00e9 de Montr\u00e9al, Canada","UNIVERSITE DE MONTREAL"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"D\u00e9partement d'informatique et de Recherche Op\u00e9rationnelle, Universit\u00e9 de Montr\u00e9al, Canada","institution_ids":["https://openalex.org/I4210111842","https://openalex.org/I70931966"]},{"raw_affiliation_string":"UNIVERSITE DE MONTREAL","institution_ids":["https://openalex.org/I70931966"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071801811","display_name":"Robert Cedergren","orcid":null},"institutions":[{"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"]},{"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"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Robert Cedergren","raw_affiliation_strings":["D\u00e9partement d'informatique et de Recherche Op\u00e9rationnelle, Universit\u00e9 de Montr\u00e9al, Canada","UNIVERSITE DE MONTREAL"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"D\u00e9partement d'informatique et de Recherche Op\u00e9rationnelle, Universit\u00e9 de Montr\u00e9al, Canada","institution_ids":["https://openalex.org/I4210111842","https://openalex.org/I70931966"]},{"raw_affiliation_string":"UNIVERSITE DE MONTREAL","institution_ids":["https://openalex.org/I70931966"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9461,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.75946689,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":"2","first_page":"213","last_page":"227"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9995999932289124,"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.9995999932289124,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9890999794006348,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9848999977111816,"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/computer-science","display_name":"Computer science","score":0.8472545146942139},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.837847113609314},{"id":"https://openalex.org/keywords/haskell","display_name":"Haskell","score":0.7753838300704956},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.6190770864486694},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.602037787437439},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5240545272827148},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.5191220641136169},{"id":"https://openalex.org/keywords/common-lisp","display_name":"Common Lisp","score":0.5097765326499939},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4521038234233856},{"id":"https://openalex.org/keywords/lisp","display_name":"Lisp","score":0.4501297175884247},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4159456491470337},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.396243155002594},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3449555039405823},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17278721928596497},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12803906202316284}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8472545146942139},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.837847113609314},{"id":"https://openalex.org/C2780624054","wikidata":"https://www.wikidata.org/wiki/Q34010","display_name":"Haskell","level":3,"score":0.7753838300704956},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.6190770864486694},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.602037787437439},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5240545272827148},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.5191220641136169},{"id":"https://openalex.org/C2779353305","wikidata":"https://www.wikidata.org/wiki/Q849146","display_name":"Common Lisp","level":3,"score":0.5097765326499939},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4521038234233856},{"id":"https://openalex.org/C190883126","wikidata":"https://www.wikidata.org/wiki/Q132874","display_name":"Lisp","level":2,"score":0.4501297175884247},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4159456491470337},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.396243155002594},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3449555039405823},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17278721928596497},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12803906202316284},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0956796800020050","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0956796800020050","pdf_url":null,"source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1507693023","https://openalex.org/W1988095917","https://openalex.org/W1996173902","https://openalex.org/W2005234139","https://openalex.org/W2030027600","https://openalex.org/W2062950667","https://openalex.org/W2068852367","https://openalex.org/W2084405255","https://openalex.org/W2113547509","https://openalex.org/W2151229712","https://openalex.org/W2178112091","https://openalex.org/W2318815169","https://openalex.org/W4230870880","https://openalex.org/W6682270952"],"related_works":["https://openalex.org/W2106423748","https://openalex.org/W2112263414","https://openalex.org/W1602185604","https://openalex.org/W3004782279","https://openalex.org/W2028779182","https://openalex.org/W4242678340","https://openalex.org/W2140654465","https://openalex.org/W638884614","https://openalex.org/W106843820","https://openalex.org/W215697734"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"paper":[2],"presents":[3],"an":[4,101],"application":[5,102],"of":[6,24,42,62,70],"functional":[7,123],"programming:":[8],"searching":[9],"a":[10,20,48,90,119,126],"domain":[11,43,77],"for":[12,131],"elements":[13],"which":[14,97],"satisfy":[15],"certain":[16],"constraints.":[17],"We":[18,37,66],"give":[19],"very":[21],"general":[22],"formulation":[23],"the":[25,40,52,60,63,68,71,82],"problem":[26,91],"and":[27,30,33,74,87,113,128],"describe":[28],"\u2018generate":[29],"test\u2019,":[31],"\u2018backtracking\u2019":[32],"\u2018forward":[34],"checking\u2019":[35],"algorithms.":[36],"then":[38,88],"introduce":[39],"concept":[41],"generating":[44,78],"functions":[45,79],"to":[46,58,95],"capture":[47],"common":[49],"optimization":[50],"during":[51],"search":[53,64,96,133],"process:":[54],"using":[55,76],"partial":[56],"solutions":[57],"reduce":[59],"size":[61],"space.":[65],"compare":[67],"efficiency":[69],"original":[72],"algorithms":[73,108],"those":[75],"first":[80],"with":[81,89],"\u2018classical\u2019":[83],"n":[84],"-queens":[85],"example,":[86],"having":[92],"larger":[93],"domains":[94],"was":[98],"inspired":[99],"by":[100],"in":[103,110,135],"macromolecular":[104],"structure":[105],"determination.":[106],"Using":[107],"coded":[109],"Miranda,":[111],"Haskell":[112],"Common":[114],"Lisp,":[115],"we":[116],"show":[117],"that":[118],"high":[120],"order":[121],"(lazy)":[122],"language":[124],"is":[125],"useful":[127],"efficient":[129],"tool":[130],"prototyping":[132],"methods":[134],"large":[136],"complex":[137],"domains.":[138]},"counts_by_year":[],"updated_date":"2026-05-27T06:14:07.914337","created_date":"2025-10-10T00:00:00"}