Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey

Authors:
Andrei Krokhin;Andrei Bulatov;Peter Jeavons
Affiliations:
-;-;-
Venue:
ISMVL '03 Proceedings of the 33rd International Symposium on Multiple-Valued Logic
Year:
2003

Citing 0
Cited 5

Recognizing frozen variables in constraint satisfaction problems

Theoretical Computer Science
A rendezvous of logic, complexity, and algebra

ACM SIGACT News
A rendezvous of logic, complexity, and algebra

ACM Computing Surveys (CSUR)
Constraint satisfaction problems and global cardinality constraints

Communications of the ACM
Complexity of conservative constraint satisfaction problems

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.02

Visualization

Abstract

Many computational problems arising in artificial intelligence,computer science and elsewhere can be representedas constraint satisfaction and optimization problems. In thisshort survey we discuss an approach that is related to thealgebraic component of multiple-valued logic and that hasproved to be very succesful in studying the complexity ofconstraint satisfaction.