Title :
Minimal resolution proof systems for finitely-valued Lukasiewicz logics
Author :
Harley, E.R. ; Stachniak, Z.
Author_Institution :
Dept. of Comput. Sci., York Univ., North York, Ont., Canada
Abstract :
An effective method for constructing minimal (in the sense described in this study) nonclausal resolution proof systems for Lukasiewicz logics is described. It is shown that every minimal resolution counterpart of the n-valued Lukasiewicz logic, n >2, has 2n verifiers, and a polynomial time algorithm to generate them is provided
Keywords :
many-valued logics; finitely-valued Lukasiewicz logics; minimal resolution proof systems; nonclausal resolution proof systems; polynomial time algorithm; Algebra; Computer science; Logic; Polynomials; Virtual manufacturing;
Conference_Titel :
Multiple-Valued Logic, 1993., Proceedings of The Twenty-Third International Symposium on
Conference_Location :
Sacramento, CA
Print_ISBN :
0-8186-3350-6
DOI :
10.1109/ISMVL.1993.289581
