{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:52:47Z","timestamp":1750308767272,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,5,17]],"date-time":"2008-05-17T00:00:00Z","timestamp":1210982400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,5,17]]},"DOI":"10.1145\/1374376.1374382","type":"proceedings-article","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T16:50:20Z","timestamp":1211993420000},"page":"29-38","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["The complexity of temporal constraint satisfaction problems"],"prefix":"10.1145","author":[{"given":"Manuel","family":"Bodirsky","sequence":"first","affiliation":[{"name":"Ecole polytechnique, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Kara","sequence":"additional","affiliation":[{"name":"Faculty of Mathematics and Physics, Charles University, Prague, Czech Rep"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,5,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-3(1:2)2007"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11672142_53"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-007-9083-9"},{"key":"e_1_3_2_1_4_1","unstructured":"M. Bodirsky and J. Kara: A fast algorithm and lower bound for temporal reasoning. Preprint.  M. Bodirsky and J. Kara: A fast algorithm and lower bound for temporal reasoning. Preprint."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exi083"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01070906"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652168"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1018438.1021881"},{"key":"e_1_3_2_1_9_1","first-page":"181","article-title":"The complexity of constraint satisfaction: An algebraic approach (a survey paper). In: Structural Theory of Automata, Semigroups and Universal Algebra (Montreal, 2003), NATO Science Series II: Mathematics, Physics","volume":"207","author":"Bulatov A.","year":"2005","unstructured":"A. Bulatov , P. Jeavons , and A. Krokhin : The complexity of constraint satisfaction: An algebraic approach (a survey paper). In: Structural Theory of Automata, Semigroups and Universal Algebra (Montreal, 2003), NATO Science Series II: Mathematics, Physics , Chemistry , 207 : 181 -- 213 , 2005 . A. Bulatov, P. Jeavons, and A. Krokhin: The complexity of constraint satisfaction: An algebraic approach (a survey paper). In: Structural Theory of Automata, Semigroups and Universal Algebra (Montreal, 2003), NATO Science Series II: Mathematics, Physics, Chemistry, 207:181--213, 2005.","journal-title":"Chemistry"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700376676"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01214702"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/355483.355485"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/377810"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/647486.726506"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794266766"},{"key":"e_1_3_2_1_16_1","volume-title":"A guide to NP-completeness","author":"Garey M.","year":"1978","unstructured":"M. Garey and D. Johnson : A guide to NP-completeness . CSLI Press , 1978 . M. Garey and D. Johnson: A guide to NP-completeness. CSLI Press, 1978."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1968.27.95"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/262326"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2007.50"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/263867.263489"},{"key":"e_1_3_2_1_21_1","first-page":"373","volume-title":"Constraint propagation algorithms: A revised report. Qualitative Reasoning about Physical Systems","author":"Kautz H.","year":"1990","unstructured":"H. Kautz , P. van Beek , and M. Vilain : Constraint propagation algorithms: A revised report. Qualitative Reasoning about Physical Systems , pages 373 -- 381 , 1990 . H. Kautz, P. van Beek, and M. Vilain: Constraint propagation algorithms: A revised report. Qualitative Reasoning about Physical Systems, pages 373--381, 1990."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/200836.200848"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(95)00107-7"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/85271"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804350"},{"key":"e_1_3_2_1_26_1","volume-title":"Les Presses de L'Universite de Montreal","author":"Szendrei A.","year":"1986","unstructured":"A. Szendrei : Clones in universal Algebra. Seminaire de mathematiques superieures . Les Presses de L'Universite de Montreal , 1986 . A. Szendrei: Clones in universal Algebra. Seminaire de mathematiques superieures. Les Presses de L'Universite de Montreal, 1986."}],"event":{"name":"STOC '08: Symposium on Theory of Computing","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Victoria British Columbia Canada","acronym":"STOC '08"},"container-title":["Proceedings of the fortieth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1374376.1374382","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1374376.1374382","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:32Z","timestamp":1750278152000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1374376.1374382"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,17]]},"references-count":26,"alternative-id":["10.1145\/1374376.1374382","10.1145\/1374376"],"URL":"https:\/\/doi.org\/10.1145\/1374376.1374382","relation":{},"subject":[],"published":{"date-parts":[[2008,5,17]]},"assertion":[{"value":"2008-05-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}