{"id":"https://openalex.org/W2012694101","doi":"https://doi.org/10.1016/0004-3702(93)90170-g","title":"The complexity of constraint satisfaction revisited","display_name":"The complexity of constraint satisfaction revisited","publication_year":1993,"publication_date":"1993-02-01","ids":{"openalex":"https://openalex.org/W2012694101","doi":"https://doi.org/10.1016/0004-3702(93)90170-g","mag":"2012694101"},"language":"en","primary_location":{"id":"doi:10.1016/0004-3702(93)90170-g","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0004-3702(93)90170-g","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/A5079331774","display_name":"Alan K. Mackworth","orcid":"https://orcid.org/0000-0003-0380-105X"},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Alan K. Mackworth","raw_affiliation_strings":["Department of Computer Science, University of British Columbia, Vancouver, BC, Canada V6T 1W5","Department of Computer Science, University of British Columbia, Vancouver, BC, Canada V6T 1W5#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of British Columbia, Vancouver, BC, Canada V6T 1W5","institution_ids":["https://openalex.org/I141945490"]},{"raw_affiliation_string":"Department of Computer Science, University of British Columbia, Vancouver, BC, Canada V6T 1W5#TAB#","institution_ids":["https://openalex.org/I141945490"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042721881","display_name":"Eugene C. Freuder","orcid":"https://orcid.org/0000-0002-1467-5012"},"institutions":[{"id":"https://openalex.org/I161057412","display_name":"University of New Hampshire","ror":"https://ror.org/01rmh9n78","country_code":"US","type":"education","lineage":["https://openalex.org/I161057412"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eugene C. Freuder","raw_affiliation_strings":["Department of Computer Science, University of New Hampshire, Durham, NH 03824, USA","Department of Computer Science, University of New Hampshire, Durham NH 03824, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of New Hampshire, Durham, NH 03824, USA","institution_ids":["https://openalex.org/I161057412"]},{"raw_affiliation_string":"Department of Computer Science, University of New Hampshire, Durham NH 03824, USA","institution_ids":["https://openalex.org/I161057412"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5079331774"],"corresponding_institution_ids":["https://openalex.org/I141945490"],"apc_list":{"value":3670,"currency":"USD","value_usd":3670},"apc_paid":null,"fwci":5.278,"has_fulltext":false,"cited_by_count":56,"citation_normalized_percentile":{"value":0.95231152,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"59","issue":"1-2","first_page":"57","last_page":"62"},"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.9932000041007996,"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.9865000247955322,"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/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.9030596017837524},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.8892701864242554},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.8164017796516418},{"id":"https://openalex.org/keywords/constraint-satisfaction-dual-problem","display_name":"Constraint satisfaction dual problem","score":0.7193832397460938},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.6593083143234253},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6322229504585266},{"id":"https://openalex.org/keywords/complexity-of-constraint-satisfaction","display_name":"Complexity of constraint satisfaction","score":0.5850921273231506},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.5481444597244263},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.5384054183959961},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49793148040771484},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47420814633369446},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4462006092071533},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.42846623063087463},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4221244752407074},{"id":"https://openalex.org/keywords/constraint-learning","display_name":"Constraint learning","score":0.41488218307495117},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38059526681900024},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35391825437545776},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2890084385871887},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2764226496219635}],"concepts":[{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.9030596017837524},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.8892701864242554},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.8164017796516418},{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.7193832397460938},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.6593083143234253},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6322229504585266},{"id":"https://openalex.org/C132180345","wikidata":"https://www.wikidata.org/wiki/Q5156628","display_name":"Complexity of constraint satisfaction","level":5,"score":0.5850921273231506},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.5481444597244263},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.5384054183959961},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49793148040771484},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47420814633369446},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4462006092071533},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.42846623063087463},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4221244752407074},{"id":"https://openalex.org/C29230964","wikidata":"https://www.wikidata.org/wiki/Q5164376","display_name":"Constraint learning","level":5,"score":0.41488218307495117},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38059526681900024},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35391825437545776},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2890084385871887},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2764226496219635},{"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/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"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":4,"locations":[{"id":"doi:10.1016/0004-3702(93)90170-g","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0004-3702(93)90170-g","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.14.1","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.1","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://4c.ucc.ie/web/upload/publications/article/mackworth93complexity.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.17.7964","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.7964","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ubc.ca/spider/mack/links/papers/ccsr/ccsr.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.24.8998","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.8998","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ubc.ca/nest/lci/papers/1993/mac-ccsr.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320309746","display_name":"Compagnia di San Paolo","ror":"https://ror.org/00d1b1c41"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W2751752","https://openalex.org/W53608528","https://openalex.org/W99828349","https://openalex.org/W191924552","https://openalex.org/W232778865","https://openalex.org/W1597474747","https://openalex.org/W1986945006","https://openalex.org/W1988095917","https://openalex.org/W1999038767","https://openalex.org/W2002847164","https://openalex.org/W2018646682","https://openalex.org/W2042119491","https://openalex.org/W2061734130","https://openalex.org/W2067633747","https://openalex.org/W2069683773","https://openalex.org/W2096138715","https://openalex.org/W2098727132","https://openalex.org/W2119456262","https://openalex.org/W2119978394","https://openalex.org/W2128259262","https://openalex.org/W2135432705","https://openalex.org/W2138037655","https://openalex.org/W2151720296","https://openalex.org/W2170102613","https://openalex.org/W2984454117","https://openalex.org/W6602205306","https://openalex.org/W6604062537","https://openalex.org/W6607831490","https://openalex.org/W6609144324","https://openalex.org/W6635490985","https://openalex.org/W6674065141","https://openalex.org/W6674737729","https://openalex.org/W6677957697","https://openalex.org/W6685271480"],"related_works":["https://openalex.org/W2141935412","https://openalex.org/W2091348864","https://openalex.org/W2569549435","https://openalex.org/W2784687883","https://openalex.org/W2737098235","https://openalex.org/W2295056692","https://openalex.org/W2012141606","https://openalex.org/W2289160775","https://openalex.org/W2026125863","https://openalex.org/W2252314269"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}