Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey
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...
Main Authors: | Krokhin, A, Bulatov, A, Jeavons, P |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2003
|
Similar Items
-
Functions of multiple−valued logic and the complexity of constraint satisfaction: A short survey
by: Krokhin, A, et al.
Published: (2003) -
The Complexity of Constraint Satisfaction: An Algebraic Approach
by: Krokhin, A, et al.
Published: (2004) -
The complexity of constraint satisfaction games and QCSP
by: Börner, F, et al.
Published: (2009) -
The complexity of constraint satisfaction games and QCSP
by: Boerner, F, et al.
Published: (2009) -
Constraint satisfaction problems and finite algebras
by: Bulatov, A, et al.
Published: (2000)