{"id":"https://openalex.org/W2040975306","doi":"https://doi.org/10.1080/00207160412331296724","title":"A new approach to partial constraint satisfaction problems","display_name":"A new approach to partial constraint satisfaction problems","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2040975306","doi":"https://doi.org/10.1080/00207160412331296724","mag":"2040975306"},"language":"en","primary_location":{"id":"doi:10.1080/00207160412331296724","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160412331296724","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"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":"International Journal of Computer Mathematics","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/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":true,"raw_author_name":"D. K. Gupta","raw_affiliation_strings":["Department of Mathematics, I.I.T. Kharagpur, Kharagpur, 721302, India","Department of Mathematics , I.I.T. Kharagpur , Kharagpur, 721302, India"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, I.I.T. Kharagpur, Kharagpur, 721302, India","institution_ids":["https://openalex.org/I145894827"]},{"raw_affiliation_string":"Department of Mathematics , I.I.T. Kharagpur , Kharagpur, 721302, India","institution_ids":["https://openalex.org/I145894827"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015532126","display_name":"Nisha Gupta","orcid":"https://orcid.org/0000-0002-5933-3411"},"institutions":[{"id":"https://openalex.org/I115715567","display_name":"Birla Institute of Technology, Mesra","ror":"https://ror.org/028vtqb15","country_code":"IN","type":"education","lineage":["https://openalex.org/I115715567"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"N. Gupta \u2020","raw_affiliation_strings":["Department of Electronics and Communication Engineering, B.I.T. Mesra, Ranchi, Jharkhand, 835215, India","Department of Electronics and Communication Engineering , B.I.T. Mesra , Ranchi, Jharkhand, 835215, India"],"affiliations":[{"raw_affiliation_string":"Department of Electronics and Communication Engineering, B.I.T. Mesra, Ranchi, Jharkhand, 835215, India","institution_ids":["https://openalex.org/I115715567"]},{"raw_affiliation_string":"Department of Electronics and Communication Engineering , B.I.T. Mesra , Ranchi, Jharkhand, 835215, India","institution_ids":["https://openalex.org/I115715567"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101608029"],"corresponding_institution_ids":["https://openalex.org/I145894827"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.15826373,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"81","issue":"12","first_page":"1465","last_page":"1476"},"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.9894000291824341,"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.984499990940094,"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.9409341812133789},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.831770658493042},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7506299018859863},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.7239594459533691},{"id":"https://openalex.org/keywords/constraint-satisfaction-dual-problem","display_name":"Constraint satisfaction dual problem","score":0.6520562171936035},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.5926849842071533},{"id":"https://openalex.org/keywords/binary-constraint","display_name":"Binary constraint","score":0.5276248455047607},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5088930130004883},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.47050970792770386},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4594723582267761},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.45934683084487915},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.45344170928001404},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.44711583852767944},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44391611218452454},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.20467066764831543},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1931968629360199},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06377565860748291}],"concepts":[{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.9409341812133789},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.831770658493042},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7506299018859863},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.7239594459533691},{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.6520562171936035},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.5926849842071533},{"id":"https://openalex.org/C79475747","wikidata":"https://www.wikidata.org/wiki/Q4913885","display_name":"Binary constraint","level":5,"score":0.5276248455047607},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5088930130004883},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.47050970792770386},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4594723582267761},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.45934683084487915},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.45344170928001404},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.44711583852767944},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44391611218452454},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.20467066764831543},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1931968629360199},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06377565860748291},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","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},{"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/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207160412331296724","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160412331296724","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"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":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.47999998927116394}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W177304403","https://openalex.org/W1964878205","https://openalex.org/W2035143052","https://openalex.org/W2049708883","https://openalex.org/W2144931885","https://openalex.org/W2160396090","https://openalex.org/W2569549435"],"related_works":["https://openalex.org/W2141935412","https://openalex.org/W2091348864","https://openalex.org/W2569549435","https://openalex.org/W2784687883","https://openalex.org/W2354343466","https://openalex.org/W1535766026","https://openalex.org/W2017710358","https://openalex.org/W2040975306","https://openalex.org/W2495408185","https://openalex.org/W3122634451"],"abstract_inverted_index":{"AbstractA":[0],"finite":[1,123],"binary":[2,32,124,172],"Constraint":[3,89],"Satisfaction":[4,90],"Problem":[5],"(CSPs)":[6],"is":[7,47,93,166,192,284],"defined":[8],"as":[9,202,287],"consisting":[10],"of":[11,14,20,30,51,62,71,87,96,132,147,152,156,163,205,217,242,245,261,264,277],"a":[12,18,28,39,45,52,94,130,139,193,203,210],"set":[13,29],"n":[15],"problem":[16],"variables,":[17],"domain":[19],"d":[21],"potential":[22],"values":[23],"for":[24,82,143,224],"each":[25,55],"variable":[26,56],"and":[27,75,128,159,174,179,297],"m":[31],"constraints":[33],"involving":[34],"only":[35,122],"two":[36],"variables":[37],"at":[38],"time.":[40],"A":[41],"solution":[42,142,279,283],"to":[43,54,68,103,114,137,184,219,232],"such":[44],"CSP":[46],"specified":[48],"by":[49],"assignment":[50],"value":[53],"that":[57,98,198,239],"does":[58],"not":[59],"violate":[60],"any":[61],"the":[63,69,148,153,160,177,186,233,243,248,275,278,281],"constraints.":[64],"The":[65,85,145,189,226,235],"CSPs":[66,97,125,173],"belong":[67],"class":[70,86],"NP-Complete":[72],"Problems.":[73],"Backtracking":[74],"its":[76],"variants":[77],"have":[78,120],"been":[79],"generally":[80],"used":[81,183,195],"solving":[83],"CSPs.":[84],"Partial":[88],"Problems":[91],"(PCSPs)":[92],"subclass":[95],"are":[99,106,111,269],"either":[100],"too":[101],"difficult":[102],"solve":[104],"or":[105,126],"unsolvable.":[107],"Near":[108],"optimal":[109,141,221,282],"solutions":[110,223],"always":[112],"desired":[113],"these":[115],"problems.In":[116],"this":[117],"article,":[118],"we":[119],"considered":[121],"PCSPs":[127],"developed":[129],"method":[131,149,182,191,228,250],"time":[133],"complexity":[134],"O(n2":[135],"d2)":[136],"obtain":[138,185],"near":[140],"them.":[144],"performance":[146,236],"in":[150,213,240,259],"terms":[151,241,260],"average":[154,161,262],"number":[155,162,244,263],"consistency":[157,246,254],"checks":[158,255],"constraint":[164,265,301],"violations":[165,266],"measured":[167],"on":[168,274],"various":[169],"randomly":[170],"generated":[171],"compared":[175],"with":[176],"Branch":[178,296],"Bound":[180],"(BB)":[181],"same":[187],"solution.":[188,234],"BB":[190,257],"widely":[194],"optimization":[196],"technique":[197],"may":[199],"be":[200],"viewed":[201],"variation":[204],"backtracking.":[206],"Thus,":[207],"it":[208],"was":[209],"natural":[211],"choice":[212],"seeking":[214],"an":[215],"analog":[216],"backtracking":[218],"find":[220],"partial":[222],"PCSPs.":[225],"proposed":[227,249],"moves":[229],"much":[230,252],"faster":[231],"results":[237],"indicate":[238],"checks,":[247],"has":[251],"less":[253],"than":[256],"whereas":[258],"both":[267],"methods":[268],"same.":[270],"An":[271],"upper":[272],"bound":[273],"distance":[276],"from":[280],"obtained":[285],"analytically":[286],"\u230an(n":[288],"\u2212":[289,291,293],"2)(d":[290],"2)/(d":[292],"1)\u230b.E-mail:":[294],"g_nisha@lycos.comKeywords:":[295],"boundConsistency":[298],"checksIndependent":[299],"setsValue":[300],"graphSchedulingConstraint":[302],"relaxationCSPsPCSPs":[303],"NotesE-mail:":[304],"g_nisha@lycos.com":[305]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}