{"id":"https://openalex.org/W1967190838","doi":"https://doi.org/10.1145/1667053.1667058","title":"The complexity of temporal constraint satisfaction problems","display_name":"The complexity of temporal constraint satisfaction problems","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W1967190838","doi":"https://doi.org/10.1145/1667053.1667058","mag":"1967190838"},"language":"en","primary_location":{"id":"doi:10.1145/1667053.1667058","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1667053.1667058","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","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/A5058729018","display_name":"Manuel Bodirsky","orcid":"https://orcid.org/0000-0001-8228-3611"},"institutions":[{"id":"https://openalex.org/I142476485","display_name":"\u00c9cole Polytechnique","ror":"https://ror.org/05hy3tk52","country_code":"FR","type":"education","lineage":["https://openalex.org/I142476485","https://openalex.org/I4210145102"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Manuel Bodirsky","raw_affiliation_strings":["\u00c9cole Polytechnique, Palaiseau, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\u00c9cole Polytechnique, Palaiseau, France","institution_ids":["https://openalex.org/I142476485"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108070584","display_name":"Jan K\u00e1ra","orcid":null},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Jan K\u00e1ra","raw_affiliation_strings":["Charles University, Prague, Czech Republic","Charles University, Prague (Czech Republic)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Charles University, Prague, Czech Republic","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Charles University, Prague (Czech Republic)","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":12.677,"has_fulltext":false,"cited_by_count":149,"citation_normalized_percentile":{"value":0.98902308,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":100},"biblio":{"volume":"57","issue":"2","first_page":"1","last_page":"41"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9997000098228455,"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.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9968000054359436,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9873999953269958,"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.8688418865203857},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.7508463859558105},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6776375770568848},{"id":"https://openalex.org/keywords/constraint-graph","display_name":"Constraint graph","score":0.5603750348091125},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.5191599130630493},{"id":"https://openalex.org/keywords/complexity-of-constraint-satisfaction","display_name":"Complexity of constraint satisfaction","score":0.5064524412155151},{"id":"https://openalex.org/keywords/constraint-satisfaction-dual-problem","display_name":"Constraint satisfaction dual problem","score":0.5048835873603821},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48840779066085815},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.4819895625114441},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.46578139066696167},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4528539776802063},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4224976599216461},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4190971255302429},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33739838004112244},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32424187660217285},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15741685032844543},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10254591703414917}],"concepts":[{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.8688418865203857},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.7508463859558105},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6776375770568848},{"id":"https://openalex.org/C178481205","wikidata":"https://www.wikidata.org/wiki/Q5164372","display_name":"Constraint graph","level":5,"score":0.5603750348091125},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.5191599130630493},{"id":"https://openalex.org/C132180345","wikidata":"https://www.wikidata.org/wiki/Q5156628","display_name":"Complexity of constraint satisfaction","level":5,"score":0.5064524412155151},{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.5048835873603821},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48840779066085815},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.4819895625114441},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46578139066696167},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4528539776802063},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4224976599216461},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4190971255302429},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33739838004112244},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32424187660217285},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15741685032844543},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10254591703414917},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","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},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1667053.1667058","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1667053.1667058","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.212.2354","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.212.2354","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lix.polytechnique.fr/~bodirsky/publications/tcsp.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.422.896","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.422.896","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lix.polytechnique.fr/~bodirsky/publications/tcsp.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":50,"referenced_works":["https://openalex.org/W133393701","https://openalex.org/W417925666","https://openalex.org/W1499179478","https://openalex.org/W1519739962","https://openalex.org/W1520007244","https://openalex.org/W1534682606","https://openalex.org/W1550635551","https://openalex.org/W1556189547","https://openalex.org/W1570219696","https://openalex.org/W1570319308","https://openalex.org/W1571873445","https://openalex.org/W1574067886","https://openalex.org/W1580368371","https://openalex.org/W1643900689","https://openalex.org/W1989358964","https://openalex.org/W1996011776","https://openalex.org/W1997175672","https://openalex.org/W1997649256","https://openalex.org/W2016639451","https://openalex.org/W2018470381","https://openalex.org/W2025456831","https://openalex.org/W2026753685","https://openalex.org/W2037060941","https://openalex.org/W2042215812","https://openalex.org/W2049197377","https://openalex.org/W2055173775","https://openalex.org/W2055967649","https://openalex.org/W2070051236","https://openalex.org/W2076358787","https://openalex.org/W2077066692","https://openalex.org/W2087215337","https://openalex.org/W2108266191","https://openalex.org/W2116407296","https://openalex.org/W2123815839","https://openalex.org/W2129023820","https://openalex.org/W2134358914","https://openalex.org/W2134850460","https://openalex.org/W2149922426","https://openalex.org/W2150339067","https://openalex.org/W2164680823","https://openalex.org/W2166566648","https://openalex.org/W2171142764","https://openalex.org/W2496901757","https://openalex.org/W2949165194","https://openalex.org/W3104398743","https://openalex.org/W4242729856","https://openalex.org/W4285719527","https://openalex.org/W6614524071","https://openalex.org/W6629647185","https://openalex.org/W6633343697"],"related_works":["https://openalex.org/W2045729033","https://openalex.org/W2091348864","https://openalex.org/W2569549435","https://openalex.org/W2784687883","https://openalex.org/W2737098235","https://openalex.org/W2295056692","https://openalex.org/W2724280655","https://openalex.org/W2012141606","https://openalex.org/W2906226597","https://openalex.org/W4285464797"],"abstract_inverted_index":{"A":[0],"temporal":[1,36,50],"constraint":[2,31,37,41,51,94],"language":[3,42],"is":[4,43,65],"a":[5,11,25],"set":[6],"of":[7,19,29,48,93,101,108],"relations":[8],"that":[9],"has":[10],"first-order":[12],"definition":[13],"in(Q;<),":[14],"the":[15,20,30,40,54,63,80,106],"dense":[16],"linear":[17],"order":[18],"rational":[21],"numbers.":[22],"We":[23],"present":[24],"complete":[26],"complexity":[27,96],"classification":[28],"satisfaction":[32,95],"problem":[33],"(CSP)":[34],"for":[35],"languages:":[38],"if":[39],"contained":[44],"in":[45,59,90,105],"one":[46],"out":[47],"nine":[49],"languages,":[52],"then":[53],"CSP":[55,64],"can":[56],"be":[57],"solved":[58],"polynomial":[60],"time;":[61],"otherwise,":[62],"NP-complete.":[66],"Our":[67],"proof":[68],"combines":[69],"model-theoretic":[70],"concepts":[71],"with":[72],"techniques":[73],"from":[74],"universal":[75],"algebra,":[76],"and":[77],"also":[78],"applies":[79],"so-called":[81],"product":[82],"Ramsey":[83],"theorem,":[84],"which":[85],"we":[86],"believe":[87],"will":[88],"useful":[89],"similar":[91],"contexts":[92],"classification.":[97],"An":[98],"extended":[99],"abstract":[100],"this":[102],"article":[103],"appeared":[104],"proceedings":[107],"STOC'08.":[109]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":16},{"year":2021,"cited_by_count":12},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":13},{"year":2016,"cited_by_count":14},{"year":2015,"cited_by_count":13},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":12}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}