{"id":"https://openalex.org/W2075310168","doi":"https://doi.org/10.1142/s0218001499000082","title":"MODIFIED BACKJUMPING ALGORITHMS FOR SOLVING CONSTRAINT SATISFACTION PROBLEMS","display_name":"MODIFIED BACKJUMPING ALGORITHMS FOR SOLVING CONSTRAINT SATISFACTION PROBLEMS","publication_year":1999,"publication_date":"1999-02-01","ids":{"openalex":"https://openalex.org/W2075310168","doi":"https://doi.org/10.1142/s0218001499000082","mag":"2075310168"},"language":"en","primary_location":{"id":"doi:10.1142/s0218001499000082","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218001499000082","pdf_url":null,"source":{"id":"https://openalex.org/S41486457","display_name":"International Journal of Pattern Recognition and Artificial Intelligence","issn_l":"0218-0014","issn":["0218-0014","1793-6381"],"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 of Pattern Recognition and 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/A5110311173","display_name":"Uttom Chowdhury","orcid":null},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"U. CHOWDHURY","raw_affiliation_strings":["Department of Mathematics, Indian Institute of Technology, Kharagpur \u2013 721 302, India","Department of Mathematics , Indian Institute of Technology , Kharagpur , 721 302 , India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Indian Institute of Technology, Kharagpur \u2013 721 302, India","institution_ids":["https://openalex.org/I145894827"]},{"raw_affiliation_string":"Department of Mathematics , Indian Institute of Technology , Kharagpur , 721 302 , India","institution_ids":["https://openalex.org/I145894827"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101608029","display_name":"D. K. Gupta","orcid":"https://orcid.org/0009-0005-9776-7404"},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"D. K. GUPTA","raw_affiliation_strings":["Department of Mathematics, Indian Institute of Technology, Kharagpur \u2013 721 302, India","Department of Mathematics , Indian Institute of Technology , Kharagpur , 721 302 , India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Indian Institute of Technology, Kharagpur \u2013 721 302, India","institution_ids":["https://openalex.org/I145894827"]},{"raw_affiliation_string":"Department of Mathematics , Indian Institute of Technology , Kharagpur , 721 302 , India","institution_ids":["https://openalex.org/I145894827"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I145894827"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.23093155,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"13","issue":"01","first_page":"133","last_page":"147"},"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.996999979019165,"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/T11106","display_name":"Data Management and Algorithms","score":0.9957000017166138,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.9717497825622559},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.675754964351654},{"id":"https://openalex.org/keywords/constraint-learning","display_name":"Constraint learning","score":0.6252948641777039},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.6185187697410583},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6172035336494446},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6129933595657349},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.45852935314178467},{"id":"https://openalex.org/keywords/beam-stack-search","display_name":"Beam stack search","score":0.457328200340271},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.456962525844574},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.443467915058136},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2713508605957031},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.26799243688583374},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.2644219994544983},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.22853460907936096},{"id":"https://openalex.org/keywords/best-first-search","display_name":"Best-first search","score":0.16273587942123413}],"concepts":[{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.9717497825622559},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.675754964351654},{"id":"https://openalex.org/C29230964","wikidata":"https://www.wikidata.org/wiki/Q5164376","display_name":"Constraint learning","level":5,"score":0.6252948641777039},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.6185187697410583},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6172035336494446},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6129933595657349},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.45852935314178467},{"id":"https://openalex.org/C194036150","wikidata":"https://www.wikidata.org/wiki/Q4876196","display_name":"Beam stack search","level":5,"score":0.457328200340271},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.456962525844574},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.443467915058136},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2713508605957031},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26799243688583374},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.2644219994544983},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.22853460907936096},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.16273587942123413},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218001499000082","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218001499000082","pdf_url":null,"source":{"id":"https://openalex.org/S41486457","display_name":"International Journal of Pattern Recognition and Artificial Intelligence","issn_l":"0218-0014","issn":["0218-0014","1793-6381"],"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 of Pattern Recognition and Artificial Intelligence","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W118247316","https://openalex.org/W159086079","https://openalex.org/W1679685803","https://openalex.org/W1976303542","https://openalex.org/W2038118137","https://openalex.org/W2079310906","https://openalex.org/W2088174216","https://openalex.org/W2135432705","https://openalex.org/W2916165598","https://openalex.org/W4233742012"],"related_works":["https://openalex.org/W2188549339","https://openalex.org/W2017710358","https://openalex.org/W2157740753","https://openalex.org/W2091348864","https://openalex.org/W3122634451","https://openalex.org/W2569549435","https://openalex.org/W2784687883","https://openalex.org/W2997121997","https://openalex.org/W3014398131","https://openalex.org/W2021700650"],"abstract_inverted_index":{"The":[0,126],"backtracking":[1,39,74],"algorithm":[2,40],"is":[3,46,51],"a":[4,68,106,115],"prominent":[5],"search":[6,122],"technique":[7,107],"in":[8,15,65,82,114,124],"AI,":[9],"particularly":[10],"due":[11],"to":[12,58,60,88,108,112],"its":[13],"use":[14],"Constraint":[16],"Satisfaction":[17],"Problems":[18],"(CSPs),":[19],"Truth":[20],"Maintenance":[21],"Systems":[22],"(TMS),":[23],"and":[24,32,48,141],"PROLOG.":[25],"In":[26,90],"the":[27,38,49,61,73,83,86,93,110,121,138,146],"context":[28],"of":[29,37,63,67,85,95,98,128],"CSPs,":[30],"Dechter5":[31],"Gashnig10":[33],"proposed":[34],"two":[35],"variants":[36],"known":[41],"as":[42],"backjumping":[43,53,99],"algorithms.":[44],"One":[45],"graph-based":[47],"other":[50],"failure-based":[52],"algorithm.":[54],"These":[55,103],"algorithms":[56,78,100,104,131,148],"attempt":[57],"backjump":[59,113],"source":[62],"failure":[64],"case":[66],"dead-end":[69],"situation.":[70],"This":[71,118],"improves":[72],"performance.":[75],"However,":[76],"these":[77,129],"are":[79,101,132],"not":[80],"consistent":[81,116],"selection":[84],"variable":[87,111],"backjump.":[89],"this":[91],"paper,":[92],"modifications":[94],"both":[96],"types":[97],"proposed.":[102],"adopt":[105],"select":[109],"manner.":[117],"further":[119],"increases":[120],"efficiency":[123],"them.":[125],"merits":[127],"modified":[130,147],"investigated":[133],"theoretically.":[134],"Experimental":[135],"results":[136,151],"on":[137,152],"zebra":[139],"problem":[140],"random":[142],"problems":[143],"show":[144],"that":[145],"give":[149],"better":[150],"most":[153],"occasions.":[154]},"counts_by_year":[],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}