Title :
Note on resolution approximation of many-valued logics
Author_Institution :
Dept. of Comput. Sci., York Univ., North York, Ont., Canada
Abstract :
A discussion is presented of the problem of resolution approximation of many-valued logics, that is, the problem of defining propositional logics in terms of finite sets of resolution proof systems. The resolution proof systems discussed are based on the weak form of transformation rules. It is shown that for many-valued logics (and more generally, for resolution logics) minimal resolution approximations can be effectively constructed
Keywords :
logic design; many-valued logics; many-valued logics; minimal resolution; propositional logics; resolution approximation; resolution proof systems; transformation rules; Application software; Artificial intelligence; Circuit synthesis; Computer science; Logic design; Logic programming; Multivalued logic; Performance analysis; Sequential circuits; Switching circuits;
Conference_Titel :
Multiple-Valued Logic, 1990., Proceedings of the Twentieth International Symposium on
Conference_Location :
Charlotte, NC
Print_ISBN :
0-8186-2046-3
DOI :
10.1109/ISMVL.1990.122622
