{"id":"https://openalex.org/W2151273784","doi":"https://doi.org/10.1142/s0218213008004114","title":"A SPACE-EFFICIENT BACKTRACK-FREE REPRESENTATION FOR CONSTRAINT SATISFACTION PROBLEMS","display_name":"A SPACE-EFFICIENT BACKTRACK-FREE REPRESENTATION FOR CONSTRAINT SATISFACTION PROBLEMS","publication_year":2008,"publication_date":"2008-08-01","ids":{"openalex":"https://openalex.org/W2151273784","doi":"https://doi.org/10.1142/s0218213008004114","mag":"2151273784"},"language":"en","primary_location":{"id":"doi:10.1142/s0218213008004114","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218213008004114","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/A5082373681","display_name":"J. Christopher Beck","orcid":"https://orcid.org/0000-0002-4656-8908"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"J. CHRISTOPHER BECK","raw_affiliation_strings":["Department of Mechanical & Industrial Engineering, University of Toronto, 5 King's College Rd., Toronto, Ontario, M5S 3G8, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical & Industrial Engineering, University of Toronto, 5 King's College Rd., Toronto, Ontario, M5S 3G8, Canada","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027325527","display_name":"Tom Carchrae","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"TOM CARCHRAE","raw_affiliation_strings":["Actenum Corporation, Suite 410 \u2013 The Landing, 375 Water Street, Vancouver, British Columbia, Canada"],"affiliations":[{"raw_affiliation_string":"Actenum Corporation, Suite 410 \u2013 The Landing, 375 Water Street, Vancouver, British Columbia, Canada","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042721881","display_name":"Eugene C. Freuder","orcid":"https://orcid.org/0000-0002-1467-5012"},"institutions":[{"id":"https://openalex.org/I27577105","display_name":"University College Cork","ror":"https://ror.org/03265fv13","country_code":"IE","type":"education","lineage":["https://openalex.org/I27577105"]}],"countries":["IE"],"is_corresponding":false,"raw_author_name":"EUGENE C. FREUDER","raw_affiliation_strings":["Cork Constraint Computation Centre, University College Cork, Cork, Ireland"],"affiliations":[{"raw_affiliation_string":"Cork Constraint Computation Centre, University College Cork, Cork, Ireland","institution_ids":["https://openalex.org/I27577105"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076867246","display_name":"Georg Ringwelski","orcid":null},"institutions":[{"id":"https://openalex.org/I4210148079","display_name":"Zittau/G\u00f6rlitz University of Applied Sciences","ror":"https://ror.org/056tzgr32","country_code":"DE","type":"education","lineage":["https://openalex.org/I4210148079"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"GEORG RINGWELSKI","raw_affiliation_strings":["Computer Science Department, Hochschule Zittau/Goerlitz, University of Applied Sciences, Brueckenstrasse 1, 02826 Goerlitz, Germany"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Hochschule Zittau/Goerlitz, University of Applied Sciences, Brueckenstrasse 1, 02826 Goerlitz, Germany","institution_ids":["https://openalex.org/I4210148079"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5082373681"],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":null,"apc_paid":null,"fwci":0.3812,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.71507459,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"17","issue":"04","first_page":"703","last_page":"730"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":1.0,"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":1.0,"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/T11106","display_name":"Data Management and Algorithms","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9847999811172485,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7961869239807129},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.7210598587989807},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6909210681915283},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.679722011089325},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.6687999963760376},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.6161699295043945},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.5900059342384338},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.5691755414009094},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5220620036125183},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.5031628012657166},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.4937210977077484},{"id":"https://openalex.org/keywords/tuple","display_name":"Tuple","score":0.48986145853996277},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48704269528388977},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.47796890139579773},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45206698775291443},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.4247947931289673},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.28385913372039795},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2827269434928894},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1697503626346588}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7961869239807129},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.7210598587989807},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6909210681915283},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.679722011089325},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.6687999963760376},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.6161699295043945},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.5900059342384338},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.5691755414009094},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5220620036125183},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.5031628012657166},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.4937210977077484},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.48986145853996277},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48704269528388977},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.47796890139579773},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45206698775291443},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.4247947931289673},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.28385913372039795},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2827269434928894},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1697503626346588},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1142/s0218213008004114","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218213008004114","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:CiteSeerX.psu:10.1.1.144.564","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.564","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://4c.ucc.ie/web/upload/publications/article/SECSP.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.158.3712","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.3712","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://4c.ucc.ie/web/upload/publications/jourart/space efficient backtrack free.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.72.9556","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.72.9556","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.inf.hs-zigr.de/~gr/papers/bfr.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W33050995","https://openalex.org/W41953994","https://openalex.org/W99828349","https://openalex.org/W117446995","https://openalex.org/W140090514","https://openalex.org/W207377576","https://openalex.org/W1537549004","https://openalex.org/W1548650523","https://openalex.org/W1644132206","https://openalex.org/W1998893408","https://openalex.org/W2002478775","https://openalex.org/W2061734130","https://openalex.org/W2072755230","https://openalex.org/W2112561710","https://openalex.org/W2127845326","https://openalex.org/W2337098149","https://openalex.org/W2426452510","https://openalex.org/W2984454117"],"related_works":["https://openalex.org/W2569549435","https://openalex.org/W2091348864","https://openalex.org/W2784687883","https://openalex.org/W2141935412","https://openalex.org/W2017710358","https://openalex.org/W1540285992","https://openalex.org/W1524973174","https://openalex.org/W3122634451","https://openalex.org/W2354343466","https://openalex.org/W2495408185"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"present":[4],"a":[5,10,14,40,57,67,125],"radical":[6],"approach":[7,119],"to":[8,22,73],"obtaining":[9],"backtrack-free":[11,91,104,116],"representation":[12],"for":[13,88,102,121],"constraint":[15],"satisfaction":[16],"problem:":[17],"remove":[18],"values":[19],"that":[20,66,85,139],"lead":[21],"dead-ends.":[23],"This":[24],"technique":[25],"does":[26],"not":[27],"require":[28],"additional":[29],"space":[30,129],"but":[31],"has":[32],"the":[33,45,49,71,74,122,144],"drawback":[34],"of":[35,42,51,59,70],"removing":[36,107],"solutions.":[37],"We":[38],"investigate":[39],"number":[41],"variations":[43],"on":[44],"basic":[46],"algorithm":[47,84],"including":[48],"use":[50],"seed":[52],"solutions,":[53],"consistency":[54],"techniques,":[55],"and":[56,112,133,136,149],"variety":[58],"pruning":[60],"heuristics.":[61],"Our":[62,118],"experimental":[63],"results":[64],"indicate":[65],"significant":[68],"proportion":[69],"solutions":[72],"original":[75],"problem":[76],"can":[77,140],"be":[78],"retained":[79],"especially":[80],"when":[81],"an":[82],"optimization":[83],"specifically":[86],"searches":[87],"such":[89],"\u201cgood\u201d":[90],"representations":[92],"is":[93],"employed.":[94],"Further":[95],"extensions":[96],"increase":[97],"solution":[98,134,150],"retention":[99],"by":[100,106,113],"searching":[101],"high-coverage":[103],"representations,":[105],"tuples":[108],"rather":[109],"than":[110],"values,":[111],"combining":[114],"multiple":[115],"representations.":[117],"elucidates,":[120],"first":[123],"time,":[124],"three-way":[126],"trade-off":[127,145],"between":[128,146],"complexity,":[130],"potential":[131],"backtracks,":[132,148],"loss":[135],"enables":[137],"algorithms":[138],"actively":[141],"reason":[142],"about":[143],"space,":[147],"loss.":[151]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}