{"id":"https://openalex.org/W1985668982","doi":"https://doi.org/10.1137/050634840","title":"Constraint Satisfaction, Logic and Forbidden Patterns","display_name":"Constraint Satisfaction, Logic and Forbidden Patterns","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W1985668982","doi":"https://doi.org/10.1137/050634840","mag":"1985668982"},"language":"en","primary_location":{"id":"doi:10.1137/050634840","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050634840","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://durham-repository.worktribe.com/output/1576119","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044720498","display_name":"Florent Madelaine","orcid":"https://orcid.org/0000-0002-8528-7105"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Florent Madelaine","raw_affiliation_strings":["Durham University"],"affiliations":[{"raw_affiliation_string":"Durham University","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061350983","display_name":"Iain A. Stewart","orcid":"https://orcid.org/0000-0002-0752-1971"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Iain A. Stewart","raw_affiliation_strings":["Durham University"],"affiliations":[{"raw_affiliation_string":"Durham University","institution_ids":["https://openalex.org/I190082696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5044720498"],"corresponding_institution_ids":["https://openalex.org/I190082696"],"apc_list":null,"apc_paid":null,"fwci":1.123,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.77282761,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"37","issue":"1","first_page":"132","last_page":"163"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.996399998664856,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.7945869565010071},{"id":"https://openalex.org/keywords/subclass","display_name":"Subclass","score":0.6329060792922974},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.6085488200187683},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.6016685366630554},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5686766505241394},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.531202495098114},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.5099648237228394},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5033101439476013},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48461779952049255},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.45413926243782043},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.41342905163764954},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33846157789230347},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08298850059509277}],"concepts":[{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.7945869565010071},{"id":"https://openalex.org/C2776194381","wikidata":"https://www.wikidata.org/wiki/Q3965271","display_name":"Subclass","level":3,"score":0.6329060792922974},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.6085488200187683},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.6016685366630554},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5686766505241394},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.531202495098114},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.5099648237228394},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5033101439476013},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48461779952049255},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45413926243782043},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.41342905163764954},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33846157789230347},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08298850059509277},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C203014093","wikidata":"https://www.wikidata.org/wiki/Q101929","display_name":"Immunology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C159654299","wikidata":"https://www.wikidata.org/wiki/Q79460","display_name":"Antibody","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/050634840","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050634840","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:dro.dur.ac.uk.OAI2:3987","is_oa":false,"landing_page_url":"http://dro.dur.ac.uk/3987/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196258","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"SIAM journal of computing, 2007, Vol.37(1), pp.132-163 [Peer Reviewed Journal]","raw_type":"Article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.108.3870","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.3870","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dur.ac.uk/i.a.stewart/Papers/FPPvsCSP.pdf","raw_type":"text"},{"id":"pmh:oai:durham-repository.worktribe.com:1576119","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1576119","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"}],"best_oa_location":{"id":"pmh:oai:durham-repository.worktribe.com:1576119","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1576119","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[{"score":0.5,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W201534694","https://openalex.org/W655258421","https://openalex.org/W1515534319","https://openalex.org/W1552369856","https://openalex.org/W1572041907","https://openalex.org/W1811185933","https://openalex.org/W1969223164","https://openalex.org/W1972363616","https://openalex.org/W1979514837","https://openalex.org/W1986537785","https://openalex.org/W2018547288","https://openalex.org/W2022623224","https://openalex.org/W2026745535","https://openalex.org/W2033470072","https://openalex.org/W2040145343","https://openalex.org/W2052936500","https://openalex.org/W2076108709","https://openalex.org/W2077575555","https://openalex.org/W2116407296","https://openalex.org/W2129023820","https://openalex.org/W2131358503","https://openalex.org/W2131857386","https://openalex.org/W2134850460","https://openalex.org/W2150339067","https://openalex.org/W2165528704","https://openalex.org/W2166566648","https://openalex.org/W2531245455","https://openalex.org/W2949165194","https://openalex.org/W3127113455","https://openalex.org/W4247305611","https://openalex.org/W4254380579"],"related_works":["https://openalex.org/W2252314269","https://openalex.org/W2161128834","https://openalex.org/W2091348864","https://openalex.org/W2569549435","https://openalex.org/W2012141606","https://openalex.org/W1550482496","https://openalex.org/W2784687883","https://openalex.org/W2102858635","https://openalex.org/W2012694101","https://openalex.org/W2470231588"],"abstract_inverted_index":{"In":[0],"the":[1,24,46,73,85,106,117,153,166,186],"1990s,":[2],"Feder":[3,68],"and":[4,69,92,113],"Vardi":[5,70],"attempted":[6],"to":[7,54,72,128,150],"find":[8],"a":[9,16,37,58,65,100,143,175,193],"large":[10],"subclass":[11,25],"of":[12,40,75,87,103,108,120,188],"NP":[13],"which":[14],"exhibits":[15,57],"dichotomy,":[17,59],"that":[18,133],"is,":[19],"where":[20],"every":[21],"problem":[22,144,154,167],"in":[23,29,36,45,135,139,145,156,169],"is":[26,155,163,168,198],"either":[27],"solvable":[28],"polynomial\u2010time":[30],"or":[31,158],"NP\u2010complete.":[32],"Their":[33],"studies":[34],"resulted":[35],"candidate":[38,184],"class":[39,86,102,107],"problems,":[41,90,105],"namely,":[42],"those":[43,131],"definable":[44],"logic":[47],"MMSNP.":[48],"While":[49],"it":[50,63],"remains":[51,64],"open":[52],"as":[53,116],"whether":[55,152],"MMSNP":[56,76,81,91,115,136],"for":[60,177,181,185],"various":[61],"reasons":[62],"strong":[66],"candidate.":[67],"added":[71],"significance":[74],"by":[77],"proving":[78],"that,":[79],"although":[80],"strictly":[82],"contains":[83],"CSP,":[84,170],"constraint":[88],"satisfaction":[89],"CSP":[93,157],"are":[94,134,148],"computationally":[95],"equivalent.":[96],"We":[97,124],"introduce":[98],"here":[99],"new":[101],"combinatorial":[104],"forbidden":[109],"patterns":[110],"problems":[111,121,132],"FPP,":[112],"characterize":[114],"finite":[118],"unions":[119],"from":[122],"FPP.":[123],"use":[125],"our":[126],"characterization":[127],"detail":[129],"exactly":[130],"but":[137],"not":[138,159],"CSP.":[140],"Furthermore,":[141],"given":[142,183],"MMSNP,":[146],"we":[147,172,190],"able":[149],"decide":[151],"(this":[160],"whole":[161],"process":[162,197],"effective).":[164,199],"If":[165],"then":[171],"can":[173,191],"construct":[174],"template":[176],"this":[178,196],"problem;":[179],"otherwise,":[180],"any":[182],"role":[187],"template,":[189],"build":[192],"counterexample":[194],"(again,":[195]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}