{"id":"https://openalex.org/W4400245938","doi":"https://doi.org/10.1504/ijipt.2023.139285","title":"Smart approach to constraint programming: intelligent backtracking using artificial intelligence","display_name":"Smart approach to constraint programming: intelligent backtracking using artificial intelligence","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W4400245938","doi":"https://doi.org/10.1504/ijipt.2023.139285"},"language":"en","primary_location":{"id":"doi:10.1504/ijipt.2023.139285","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijipt.2023.139285","pdf_url":null,"source":{"id":"https://openalex.org/S97755082","display_name":"International Journal of Internet Protocol Technology","issn_l":"1743-8209","issn":["1743-8209","1743-8217"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310317825","host_organization_name":"Inderscience Publishers","host_organization_lineage":["https://openalex.org/P4310317825"],"host_organization_lineage_names":["Inderscience Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Internet Protocol Technology","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/A5101699053","display_name":"Heng Du","orcid":"https://orcid.org/0000-0002-3099-9578"},"institutions":[{"id":"https://openalex.org/I4210166499","display_name":"Henan Polytechnic University","ror":"https://ror.org/05vr1c885","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210166499"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Heng Du","raw_affiliation_strings":["Henan Polytechnic Institute, Nanynag, Henan 473000, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Henan Polytechnic Institute, Nanynag, Henan 473000, China","institution_ids":["https://openalex.org/I4210166499"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101699053"],"corresponding_institution_ids":["https://openalex.org/I4210166499"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.27766076,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"16","issue":"4","first_page":"185","last_page":"195"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9857000112533569,"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.9857000112533569,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9779000282287598,"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/backtracking","display_name":"Backtracking","score":0.8154218792915344},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7290950417518616},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.5206198692321777},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4783570170402527},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.46387019753456116},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.45464903116226196},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.23697343468666077},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.19390898942947388},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.12524262070655823},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.11095964908599854},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09630879759788513}],"concepts":[{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.8154218792915344},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7290950417518616},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5206198692321777},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4783570170402527},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.46387019753456116},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.45464903116226196},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.23697343468666077},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.19390898942947388},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.12524262070655823},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.11095964908599854},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09630879759788513},{"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/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1504/ijipt.2023.139285","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijipt.2023.139285","pdf_url":null,"source":{"id":"https://openalex.org/S97755082","display_name":"International Journal of Internet Protocol Technology","issn_l":"1743-8209","issn":["1743-8209","1743-8217"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310317825","host_organization_name":"Inderscience Publishers","host_organization_lineage":["https://openalex.org/P4310317825"],"host_organization_lineage_names":["Inderscience Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Internet Protocol Technology","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":0,"referenced_works":[],"related_works":["https://openalex.org/W2091348864","https://openalex.org/W2784687883","https://openalex.org/W2569549435","https://openalex.org/W2097415053","https://openalex.org/W1514298554","https://openalex.org/W2096689540","https://openalex.org/W6366331","https://openalex.org/W1805650364","https://openalex.org/W2495408185","https://openalex.org/W4313469555"],"abstract_inverted_index":{"Constrained":[0],"programming":[1],"is":[2,85],"the":[3,27,40,46,104,123,135],"concept":[4],"used":[5,60],"to":[6,64,92],"select":[7],"possible":[8,67],"alternatives":[9],"from":[10,54],"an":[11,20],"incredibly":[12],"diverse":[13],"range":[14],"of":[15,72,88],"candidates.":[16],"This":[17],"paper":[18],"proposes":[19],"AI-assisted":[21],"Backtracking":[22],"Scheme":[23],"(AI-BS)":[24],"by":[25],"integrating":[26],"generic":[28],"backtracking":[29,113,144],"algorithm":[30],"with":[31,45],"Artificial":[32],"Intelligence":[33],"(AI).":[34],"The":[35,118],"detailed":[36],"study":[37,105],"observes":[38],"that":[39,95,122],"extreme":[41],"dual":[42],"ray":[43],"associated":[44],"infeasible":[47],"linear":[48],"program":[49],"can":[50],"be":[51],"automatically":[52],"extracted":[53],"minimum":[55],"unfeasible":[56],"sets.":[57],"Constraints":[58],"are":[59],"in":[61,74],"artificial":[62],"intelligence":[63],"list":[65],"all":[66,99],"values":[68,97],"for":[69,111],"a":[70,75,83,86,90,107],"group":[71],"variables":[73],"given":[76],"universe.":[77],"To":[78],"put":[79],"it":[80],"another":[81],"way,":[82],"solution":[84],"way":[87],"assigning":[89],"value":[91],"each":[93],"variable":[94],"these":[96],"satisfy":[98],"constraints.":[100],"Furthermore,":[101],"this":[102],"helps":[103],"reach":[106],"decreased":[108],"search":[109],"area":[110],"smart":[112,126],"without":[114],"paying":[115],"high":[116],"costs.":[117],"evaluation":[119],"results":[120],"exhibit":[121],"IB-BC":[124],"algorithm-based":[125],"electricity":[127,132],"schedule":[128],"controller":[129],"performs":[130],"better":[131],"bill":[133],"during":[134],"scheduled":[136],"periods":[137],"than":[138],"comparison":[139],"approaches":[140],"such":[141],"as":[142],"binary":[143,146],"and":[145],"particle":[147],"swarm":[148],"optimiser.":[149]},"counts_by_year":[],"updated_date":"2026-02-06T02:01:19.302388","created_date":"2025-10-10T00:00:00"}