{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T23:14:38Z","timestamp":1729638878590,"version":"3.28.0"},"reference-count":45,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ismvl.2003.1201427","type":"proceedings-article","created":{"date-parts":[[2004,6,22]],"date-time":"2004-06-22T16:27:43Z","timestamp":1087921663000},"page":"343-351","source":"Crossref","is-referenced-by-count":4,"title":["Functions of multiple-valued logic and the complexity of constraint satisfaction: a short survey"],"prefix":"10.1109","author":[{"given":"A.","family":"Krokhin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Bulatov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Jeavons","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"19","DOI":"10.1006\/jcss.2001.1809"},{"doi-asserted-by":"publisher","key":"35","DOI":"10.1016\/0020-0255(94)00080-U"},{"doi-asserted-by":"publisher","key":"17","DOI":"10.1137\/S0097539794266766"},{"year":"1994","author":"papadimitriou","journal-title":"Computational Complexity","key":"36"},{"year":"1979","author":"garey","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","key":"18"},{"key":"33","volume":"1","author":"mckenzie","year":"1987","journal-title":"Algebras Lattices and Varieties"},{"doi-asserted-by":"publisher","key":"15","DOI":"10.1007\/s10472-005-1810-9"},{"doi-asserted-by":"publisher","key":"34","DOI":"10.1016\/0020-0255(74)90008-5"},{"year":"1998","author":"dunkin","article-title":"Towards high order constraint representations for the frequency assignment problem","key":"16"},{"doi-asserted-by":"publisher","key":"39","DOI":"10.1007\/978-3-0348-5547-1"},{"doi-asserted-by":"publisher","key":"13","DOI":"10.1016\/S0304-3975(01)00146-3"},{"year":"1997","author":"dalmau","article-title":"Some dichotomy theorems on constant-free quantified Boolean formulas","key":"14"},{"year":"1997","author":"pearson","article-title":"A survey of tractable constraint satisfaction problems","key":"37"},{"doi-asserted-by":"publisher","key":"11","DOI":"10.1006\/inco.1996.0016"},{"year":"1997","author":"pippenger","journal-title":"Theories of Computability","key":"38"},{"doi-asserted-by":"publisher","key":"12","DOI":"10.1137\/1.9780898718546"},{"key":"21","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"},{"doi-asserted-by":"publisher","key":"20","DOI":"10.1016\/0004-3702(94)90003-5"},{"year":"1986","author":"szendrei","journal-title":"Clones in Universal Algebra Volume 99 of Seminaires de Mathematiques Superieures","key":"43"},{"doi-asserted-by":"publisher","key":"42","DOI":"10.1145\/800133.804350"},{"key":"41","first-page":"1","article-title":"Completeness, closed classes and relations in multiple-valued logics","author":"rosenberg","year":"1974","journal-title":"Proceedings 4th International Symposium on Multiple-Valued Logic ISMVL '74"},{"year":"1941","author":"post","journal-title":"The Two-Valued Iterative Systems of Mathematical Logic Volume 5 of Annals Mathematical Studies","key":"40"},{"doi-asserted-by":"publisher","key":"45","DOI":"10.1016\/0004-3702(92)90011-L"},{"year":"1993","author":"tsang","journal-title":"Foundations of Constraint Satisfaction","key":"44"},{"key":"22","first-page":"2","article-title":"Constructing constraints","author":"jeavons","year":"1998","journal-title":"Proceedings 4th International Conference on Constraint Programming - CP'98 (Pisa October 1998) Volume 1520 of Lecture Notes in Computer Science"},{"doi-asserted-by":"publisher","key":"23","DOI":"10.1016\/S0304-3975(97)00230-2"},{"doi-asserted-by":"publisher","key":"24","DOI":"10.1145\/263867.263489"},{"key":"25","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1023\/A:1009890709297","article-title":"How to determine the expressive power of constraints","volume":"4","author":"jeavons","year":"1999","journal-title":"Constraints"},{"doi-asserted-by":"publisher","key":"26","DOI":"10.1109\/MIS.2005.25"},{"doi-asserted-by":"publisher","key":"27","DOI":"10.1137\/S0097539795285114"},{"doi-asserted-by":"publisher","key":"28","DOI":"10.1137\/S0097539799349948"},{"key":"29","first-page":"407","article-title":"The complexity of minimal satisfiability problems","author":"kirousis","year":"2001","journal-title":"Proceedings 18th International Symposium on Theoretical Aspects of Computer Science STACS'01 Volume 2010 of Lecture Notes in Computer Science"},{"year":"2002","author":"bo?rner","article-title":"Quantified constraints and surjective polymorphisms","key":"3"},{"doi-asserted-by":"publisher","key":"2","DOI":"10.1007\/3-540-45793-3_28"},{"key":"10","first-page":"272","article-title":"Constraint satisfaction problems and finite algebras","author":"bulatov","year":"2000","journal-title":"Proceedings 27th International Colloquium on Automata Languages and Programming ICALP'00 Volume 1853 of Lecture Notes in Computer Science"},{"year":"1994","author":"allen","journal-title":"Natural Language Understanding","key":"1"},{"doi-asserted-by":"publisher","key":"30","DOI":"10.1006\/jcss.2000.1713"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1109\/SFCS.2003.1238229"},{"year":"2002","author":"bulatov","article-title":"Mal'tsev constraints are tractable","key":"6"},{"key":"32","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5625.001.0001","author":"marriott","year":"1998","journal-title":"Programming with Constraints An Introduction"},{"doi-asserted-by":"publisher","key":"5","DOI":"10.1109\/SFCS.2002.1181990"},{"key":"31","first-page":"285","article-title":"Constraint satisfaction","volume":"1","author":"mackworth","year":"1992","journal-title":"Encyclopedia of Artificial Intelligence"},{"doi-asserted-by":"publisher","key":"4","DOI":"10.1007\/BF00739570"},{"year":"2001","author":"bulatov","article-title":"Algebraic approach to multisorted constraints","key":"9"},{"year":"2000","author":"bulatov","article-title":"Tractable constraints closed under a binary operation","key":"8"}],"event":{"name":"33rd International Symposium on Multiple-Valued Logic, 2003.","location":"Meiji University, Tokyo, Japan"},"container-title":["33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8551\/27046\/01201427.pdf?arnumber=1201427","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,2]],"date-time":"2020-04-02T10:08:45Z","timestamp":1585822125000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1201427\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":45,"URL":"https:\/\/doi.org\/10.1109\/ismvl.2003.1201427","relation":{},"subject":[]}}