{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:28Z","timestamp":1760202508566,"version":"3.28.0"},"reference-count":36,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1109\/lics.2004.1319639","type":"proceedings-article","created":{"date-parts":[[2004,11,12]],"date-time":"2004-11-12T19:14:14Z","timestamp":1100286854000},"page":"448-457","source":"Crossref","is-referenced-by-count":29,"title":["A graph of a relational structure and constraint satisfaction problems"],"prefix":"10.1109","author":[{"given":"A.A.","family":"Bulatov","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794266766"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804350"},{"key":"17","first-page":"311","article-title":"Constraint satisfaction, bounded treewidth, and finite variable logics","author":"dalmau","year":"2002","journal-title":"Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming CP'02 Lecture Notes in Computer Science"},{"journal-title":"Minimal clones generated by groupoids","year":"1996","author":"szczepara","key":"36"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(92)90043-W"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-5547-1"},{"key":"15","article-title":"A new tractable class of constraint satisfaction problems","author":"dalmau","year":"2000","journal-title":"Proceedings 6th International Symposium on Artificial Intelligence and Mathematics"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-444-87759-8.50029-8"},{"key":"16","first-page":"414","article-title":"Constraint satisfaction problems in non-deterministic logarithmic space","volume":"2380","author":"dalmau","year":"2002","journal-title":"Proceedings of the 29th International Colloquium on Automata Languages and Programming ICALP'02 Volume 2380 of Lecture Notes in Computer Science"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(89)90080-5"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718546"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380868"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1142\/9789812776884_0011"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44683-4_5"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(00)00078-3"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238228"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(90)90132-J"},{"key":"24","doi-asserted-by":"crossref","DOI":"10.1090\/conm\/076","author":"hobby","year":"1988","journal-title":"The Structure of Finite Algebras Volume 76 of Contemporary Mathematics"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00230-2"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(98)00022-8"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1145\/263867.263489"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1713"},{"key":"29","first-page":"175","article-title":"A game-theoretic approach to constraint satisfaction","author":"kolaitis","year":"2000","journal-title":"Proceedings of the 17th National (US) Conference on Artificial Intellignece AAAI'00"},{"key":"3","article-title":"Mal'tsev constraints are tractable","author":"bulatov","year":"2002","journal-title":"Technical Report PRG-RR-02-05"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181990"},{"key":"10","first-page":"272","article-title":"Constraint satisfaction problems and finite algebras","volume":"1853","author":"bulatov","year":"2000","journal-title":"Proceedings of the 27th International Colloquium on Automata Languages and Programming - ICALP'00 Volume 1853 of LNCS"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgebra.2004.07.044"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(77)90007-8"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238229"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2003.1210072"},{"journal-title":"Theories of Computability","year":"1997","author":"pippenger","key":"32"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2003.1210072"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0255(74)90008-5"},{"key":"4","article-title":"Tractable constraints on a three-element set","author":"bulatov","year":"2002","journal-title":"Technical Report PRG-RR-02-06"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700376676"},{"key":"8","article-title":"Tractable constraints closed under a binary operation","author":"bulatov","year":"2000","journal-title":"Technical Report PRG-TR-12-00"}],"event":{"name":"Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.","start":{"date-parts":[[2004,7,17]]},"location":"Turku, Finland","end":{"date-parts":[[2004,7,17]]}},"container-title":["Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9221\/29239\/01319639.pdf?arnumber=1319639","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T07:53:02Z","timestamp":1497599582000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1319639\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/lics.2004.1319639","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}