{"id":"https://openalex.org/W2017710358","doi":"https://doi.org/10.1080/09528139650042547","title":"Backtracking along with constraint processing and their time complexities","display_name":"Backtracking along with constraint processing and their time complexities","publication_year":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W2017710358","doi":"https://doi.org/10.1080/09528139650042547","mag":"2017710358"},"language":"en","primary_location":{"id":"doi:10.1080/09528139650042547","is_oa":false,"landing_page_url":"https://doi.org/10.1080/09528139650042547","pdf_url":null,"source":{"id":"https://openalex.org/S153467142","display_name":"Journal of Experimental & Theoretical Artificial Intelligence","issn_l":"0952-813X","issn":["0952-813X","1362-3079"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Experimental & Theoretical Artificial Intelligence","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/A5072591799","display_name":"MARTIN ZAHN","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"MARTIN ZAHN","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5090855411","display_name":"Walter Hower","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"WALTER HOWER","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5072591799"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.2525,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.93747872,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"8","issue":"1","first_page":"63","last_page":"74"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998999834060669,"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.9998999834060669,"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.9916999936103821,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9710999727249146,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.9863762855529785},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.8546028137207031},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.8129697442054749},{"id":"https://openalex.org/keywords/constraint-learning","display_name":"Constraint learning","score":0.8087137937545776},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.7321344017982483},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7116701006889343},{"id":"https://openalex.org/keywords/binary-constraint","display_name":"Binary constraint","score":0.675724446773529},{"id":"https://openalex.org/keywords/constraint-satisfaction-dual-problem","display_name":"Constraint satisfaction dual problem","score":0.6458555459976196},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.5993791222572327},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5903401374816895},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.575476884841919},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5025849342346191},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4908076226711273},{"id":"https://openalex.org/keywords/look-ahead","display_name":"Look-ahead","score":0.4413049817085266},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39914727210998535},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39192038774490356},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23323923349380493},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13769251108169556}],"concepts":[{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.9863762855529785},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.8546028137207031},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.8129697442054749},{"id":"https://openalex.org/C29230964","wikidata":"https://www.wikidata.org/wiki/Q5164376","display_name":"Constraint learning","level":5,"score":0.8087137937545776},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.7321344017982483},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7116701006889343},{"id":"https://openalex.org/C79475747","wikidata":"https://www.wikidata.org/wiki/Q4913885","display_name":"Binary constraint","level":5,"score":0.675724446773529},{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.6458555459976196},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.5993791222572327},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5903401374816895},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.575476884841919},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5025849342346191},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4908076226711273},{"id":"https://openalex.org/C147297375","wikidata":"https://www.wikidata.org/wiki/Q6674930","display_name":"Look-ahead","level":2,"score":0.4413049817085266},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39914727210998535},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39192038774490356},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23323923349380493},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13769251108169556},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/09528139650042547","is_oa":false,"landing_page_url":"https://doi.org/10.1080/09528139650042547","pdf_url":null,"source":{"id":"https://openalex.org/S153467142","display_name":"Journal of Experimental & Theoretical Artificial Intelligence","issn_l":"0952-813X","issn":["0952-813X","1362-3079"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Experimental & Theoretical Artificial Intelligence","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":12,"referenced_works":["https://openalex.org/W1490489754","https://openalex.org/W1541583926","https://openalex.org/W1597966850","https://openalex.org/W1620410031","https://openalex.org/W2002478775","https://openalex.org/W2053738200","https://openalex.org/W2057872609","https://openalex.org/W2068852367","https://openalex.org/W2069683773","https://openalex.org/W2072755230","https://openalex.org/W2135432705","https://openalex.org/W2138037655"],"related_works":["https://openalex.org/W2141935412","https://openalex.org/W2737098235","https://openalex.org/W2091348864","https://openalex.org/W2017710358","https://openalex.org/W3035232911","https://openalex.org/W2569549435","https://openalex.org/W2355238902","https://openalex.org/W2784687883","https://openalex.org/W2495408185","https://openalex.org/W2021700650"],"abstract_inverted_index":{"In":[0],"this":[1],"review":[2],"paper":[3],"we":[4,36,53,104],"embed":[5],"several":[6],"constraint":[7,18,45,50,71],"propagation":[8],"algorithms":[9,35,52,84],"inside":[10],"a":[11,28,41,106],"backtracking":[12],"algorithm":[13,97,108],"in":[14,90],"order":[15],"to":[16,64],"solve":[17],"satisfaction":[19,46,51,72],"problems":[20,73],"and":[21,88],"analyse":[22],"the":[23,33,70,76,91],"time":[24,60,80],"complexities.":[25],"To":[26],"get":[27],"common":[29],"frame":[30],"for":[31,40],"presenting":[32],"diverse":[34],"provide":[37],"formal":[38],"definitions":[39],"uniform":[42],"treatment":[43],"of":[44,66,82],"problems.":[47],"For":[48],"some":[49],"prove":[54],"that":[55,65,93,109],"their":[56],"asymptotic":[57,77],"total":[58,78],"worst-case":[59,79],"complexities":[61,81],"are":[62,74,85],"equal":[63],"ordinary":[67],"backtracking.":[68],"If":[69],"binary,":[75],"these":[83,100],"even":[86],"better":[87],"optimal":[89],"sense":[92],"there":[94],"is":[95],"no":[96],"which":[98],"improves":[99],"complexity":[101],"bounds.":[102],"Furthermore,":[103],"present":[105],"new":[107],"establishes":[110],"global":[111],"consistency.":[112]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}