多值逻辑的功能与约束满足的复杂性:综述

33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings. Pub Date : 2003-05-16 DOI:10.1109/ISMVL.2003.1201427

A. Krokhin, A. Bulatov, P. Jeavons

{"title":"多值逻辑的功能与约束满足的复杂性:综述","authors":"A. Krokhin, A. Bulatov, P. Jeavons","doi":"10.1109/ISMVL.2003.1201427","DOIUrl":null,"url":null,"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.","PeriodicalId":434515,"journal":{"name":"33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.","volume":"99 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey\",\"authors\":\"A. Krokhin, A. Bulatov, P. Jeavons\",\"doi\":\"10.1109/ISMVL.2003.1201427\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":434515,\"journal\":{\"name\":\"33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.\",\"volume\":\"99 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-05-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISMVL.2003.1201427\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMVL.2003.1201427","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 13

摘要

在人工智能、计算机科学和其他领域出现的许多计算问题都可以表示为约束满足和优化问题。在这篇简短的综述中，我们讨论了一种与多值逻辑的代数成分有关的方法，该方法在研究约束满足的复杂性方面已被证明是非常成功的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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 to be very successful in studying the complexity of constraint satisfaction.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings.

自引率

0.00%

发文量