DocumentCode :
3120729
Title :
Tutorial: Complexity of many-valued logics
Author :
Hähnle, Reiner
Author_Institution :
Dept. of Comput. Sci., Chalmers Univ. of Technol., Goteborg, Sweden
fYear :
2001
fDate :
2001
Firstpage :
137
Lastpage :
146
Abstract :
Like in the case of classical logic and other non-standard logics, a variety of complexity-related questions can be asked in the context of many-valued logic. Some questions, such as the complexity of the sets of satisfiable and valid formulas in various logics, are completely standard; others, such as the maximal size of representations of many-valued connectives, only make sense in a many-valued context. In this overview I concentrate mainly on two kinds of complexity problems related to many-valued logics: I discuss the complexity of the membership problem in various languages, such as the satisfiable, respectively, the valid formulas in some well-known logics. Two basic proof techniques an presented in some detail: a reduction of many-valued logic to mixed integer programming and a reduction to classical logic
Keywords :
computational complexity; integer programming; multivalued logic; complexity; many-valued logics; maximal size; membership problem; mixed integer programming; Concrete; Linear programming; Logic programming; Multivalued logic; Polynomials; Tutorial;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Multiple-Valued Logic, 2001. Proceedings. 31st IEEE International Symposium on
Conference_Location :
Warsaw
ISSN :
0195-623X
Print_ISBN :
0-7695-1083-3
Type :
conf
DOI :
10.1109/ISMVL.2001.924565
Filename :
924565
Link To Document :
بازگشت