33rd International Symposium on Multiple-Valued Logic Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey Tokyo, Japan May 16-May 19 ISBN: 0-7695-1918-0
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 succesful in studying the complexity of constraint satisfaction.
Citation:
Andrei Krokhin, Andrei Bulatov, Peter Jeavons, "Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey," ismvl, pp.343, 33rd International Symposium on Multiple-Valued Logic, 2003 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||