{"id":"https://openalex.org/W2068852367","doi":"https://doi.org/10.1016/0004-3702(80)90051-x","title":"Increasing tree search efficiency for constraint satisfaction problems","display_name":"Increasing tree search efficiency for constraint satisfaction problems","publication_year":1980,"publication_date":"1980-10-01","ids":{"openalex":"https://openalex.org/W2068852367","doi":"https://doi.org/10.1016/0004-3702(80)90051-x","mag":"2068852367"},"language":"en","primary_location":{"id":"doi:10.1016/0004-3702(80)90051-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0004-3702(80)90051-x","pdf_url":null,"source":{"id":"https://openalex.org/S196139623","display_name":"Artificial Intelligence","issn_l":"0004-3702","issn":["0004-3702","1872-7921"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"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/A5102727883","display_name":"Robert M. Haralick","orcid":"https://orcid.org/0000-0002-2021-4327"},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert M. Haralick","raw_affiliation_strings":["Department of Electrical Engineering and Department of Computer Science, Virginia Polytechnic Institute and State University, Blacksburg, VI 24061, U.S.A"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Department of Computer Science, Virginia Polytechnic Institute and State University, Blacksburg, VI 24061, U.S.A","institution_ids":["https://openalex.org/I859038795"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004636974","display_name":"Gordon L. Elliott","orcid":null},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gordon L. Elliott","raw_affiliation_strings":["Department of Electrical Engineering and Department of Computer Science, Virginia Polytechnic Institute and State University, Blacksburg, VI 24061, U.S.A"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Department of Computer Science, Virginia Polytechnic Institute and State University, Blacksburg, VI 24061, U.S.A","institution_ids":["https://openalex.org/I859038795"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I859038795"],"apc_list":{"value":3670,"currency":"USD","value_usd":3670},"apc_paid":null,"fwci":9.1034,"has_fulltext":false,"cited_by_count":1115,"citation_normalized_percentile":{"value":0.97534884,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":"14","issue":"3","first_page":"263","last_page":"313"},"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.9962000250816345,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9901000261306763,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.9587512016296387},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.7268497347831726},{"id":"https://openalex.org/keywords/mistake","display_name":"Mistake","score":0.6024357676506042},{"id":"https://openalex.org/keywords/constraint-learning","display_name":"Constraint learning","score":0.5621218085289001},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5555357933044434},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5512205958366394},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5455408096313477},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.5229083895683289},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.5138242840766907},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.46178796887397766},{"id":"https://openalex.org/keywords/look-ahead","display_name":"Look-ahead","score":0.45733314752578735},{"id":"https://openalex.org/keywords/binary-search-algorithm","display_name":"Binary search algorithm","score":0.42029380798339844},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.40840625762939453},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40079036355018616},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36466288566589355},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3527102470397949},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.3359645903110504},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3124158978462219},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.07911095023155212}],"concepts":[{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.9587512016296387},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.7268497347831726},{"id":"https://openalex.org/C2777179996","wikidata":"https://www.wikidata.org/wiki/Q911222","display_name":"Mistake","level":2,"score":0.6024357676506042},{"id":"https://openalex.org/C29230964","wikidata":"https://www.wikidata.org/wiki/Q5164376","display_name":"Constraint learning","level":5,"score":0.5621218085289001},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5555357933044434},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5512205958366394},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5455408096313477},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.5229083895683289},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.5138242840766907},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.46178796887397766},{"id":"https://openalex.org/C147297375","wikidata":"https://www.wikidata.org/wiki/Q6674930","display_name":"Look-ahead","level":2,"score":0.45733314752578735},{"id":"https://openalex.org/C121610932","wikidata":"https://www.wikidata.org/wiki/Q243754","display_name":"Binary search algorithm","level":3,"score":0.42029380798339844},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.40840625762939453},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40079036355018616},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36466288566589355},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3527102470397949},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3359645903110504},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3124158978462219},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.07911095023155212},{"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/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","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/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.1016/0004-3702(80)90051-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0004-3702(80)90051-x","pdf_url":null,"source":{"id":"https://openalex.org/S196139623","display_name":"Artificial Intelligence","issn_l":"0004-3702","issn":["0004-3702","1872-7921"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"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":18,"referenced_works":["https://openalex.org/W1559427309","https://openalex.org/W1970045008","https://openalex.org/W1979622972","https://openalex.org/W2005234139","https://openalex.org/W2048257758","https://openalex.org/W2096138715","https://openalex.org/W2099266627","https://openalex.org/W2105038716","https://openalex.org/W2112507689","https://openalex.org/W2119456262","https://openalex.org/W2135432705","https://openalex.org/W2553054816","https://openalex.org/W2799004609","https://openalex.org/W4230218702","https://openalex.org/W4230870880","https://openalex.org/W6633486477","https://openalex.org/W6674065141","https://openalex.org/W6674911929"],"related_works":["https://openalex.org/W2017710358","https://openalex.org/W2352397245","https://openalex.org/W2737098235","https://openalex.org/W1575452963","https://openalex.org/W3195880842","https://openalex.org/W1492025412","https://openalex.org/W2021700650","https://openalex.org/W2151734154","https://openalex.org/W799101778","https://openalex.org/W2097523953"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":11},{"year":2021,"cited_by_count":12},{"year":2020,"cited_by_count":17},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":19},{"year":2017,"cited_by_count":13},{"year":2016,"cited_by_count":18},{"year":2015,"cited_by_count":21},{"year":2014,"cited_by_count":23},{"year":2013,"cited_by_count":31},{"year":2012,"cited_by_count":25}],"updated_date":"2026-06-28T08:01:55.173337","created_date":"2025-10-10T00:00:00"}