DocumentCode :
3478769
Title :
Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey
Author :
Krokhin, Andrei ; Bulatov, Andrei ; Jeavons, Peter
Author_Institution :
Dept. of Comput. Sci., Warwick Univ., Coventry, UK
fYear :
2003
fDate :
16-19 May 2003
Firstpage :
343
Lastpage :
351
Abstract :
Many computational problems arising in artificial intelligence, computer science and elsewhere can be represented as constraint satisfaction and optimization problems. In this short survey we discuss an approach that is related to the algebraic component of multiple-valued logic and that has proved to be very successful in studying the complexity of constraint satisfaction.
Keywords :
computability; computational complexity; constraint theory; multivalued logic; optimisation; computational complexity; constraint language; constraint satisfaction problem; multiple-valued logic function; optimization; Logic;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Multiple-Valued Logic, 2003. Proceedings. 33rd International Symposium on
ISSN :
0195-623X
Print_ISBN :
0-7695-1918-0
Type :
conf
DOI :
10.1109/ISMVL.2003.1201427
Filename :
1201427
Link To Document :
بازگشت