Professor Andrei Krokhin andrei.krokhin@durham.ac.uk
Professor
Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey
Krokhin, A.; Bulatov, A.; Jeavons, P.
Authors
A. Bulatov
P. Jeavons
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 succesful in studying the complexity of constraint satisfaction.
Citation
Krokhin, A., Bulatov, A., & Jeavons, P. (2003, May). Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey. Presented at 33rd International Symposium on Multiple-Valued Logic (ISMVL'03)
Presentation Conference Type | Conference Paper (published) |
---|---|
Conference Name | 33rd International Symposium on Multiple-Valued Logic (ISMVL'03). |
Publication Date | May 1, 2003 |
Deposit Date | Mar 29, 2010 |
Publicly Available Date | Apr 6, 2010 |
Pages | 343-351 |
Series ISSN | 0195-623X |
Book Title | 33rd international symposium on multiple-valued logic, ISMVL'03, 16-19 May 2003, Meiji University, Tokyo, Japan ; proceedings. |
ISBN | 9780769519180 |
DOI | https://doi.org/10.1109/ismvl.2003.1201427 |
Public URL | https://durham-repository.worktribe.com/output/1162355 |
Additional Information | Tokyo, Japan May 16 - May 19, 2003 |
Files
Published Conference Proceeding
(114 Kb)
PDF
Copyright Statement
©2003 IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
You might also like
Topology and adjunction in promise constraint satisfaction
(2023)
Journal Article
Algebraic Approach to Promise Constraint Satisfaction
(2021)
Journal Article
Robust algorithms with polynomial loss for near-unanimity CSPs
(2019)
Journal Article
Towards a characterization of constant-factor approximable Finite-Valued CSPs
(2018)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search