UNSPECIFIED (2003) Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey. In: 33rd International Symposium on Multiple-Valued Logic (ISMVL 2003), MAY 16-19, 2003, MEIJI UNIV, TOKYO, JAPAN.

Full text not available from this repository.

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.

Item Type:	Conference Item (UNSPECIFIED)
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software T Technology > TK Electrical engineering. Electronics Nuclear engineering
Series Name:	INTERNATIONAL SYMP ON MULTIPLE-VALUED LOGIC - PROCEEDINGS
Journal or Publication Title:	33RD INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC, PROCEEDINGS
Publisher:	IEEE COMPUTER SOC
ISBN:	0-7695-1918-0
ISSN:	0195-623X
Editor:	Martin, DC
Date:	2003
Number of Pages:	9
Page Range:	pp. 343-351
Publication Status:	Published
Title of Event:	33rd International Symposium on Multiple-Valued Logic (ISMVL 2003)
Location of Event:	MEIJI UNIV, TOKYO, JAPAN
Date(s) of Event:	MAY 16-19, 2003
URI:	http://wrap.warwick.ac.uk/id/eprint/9010

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item