DocumentCode
1938076
Title
An algebraic method to decide the deduction problem in many-valued propositional calculus
Author
Wu, Jin-zhao ; Tan, Hong-yan
Author_Institution
Inst. of Syst. Sci., Acad. Sinica, Beijing, China
fYear
1994
fDate
25-27 May 1994
Firstpage
270
Lastpage
273
Abstract
We show that there is a polynomial over the rational number field Q corresponding to a given propositional formula in a given many-valued logic. Then, to decide whether a propositional formula can be deduced from a finite set of such formulas (deduction problem), we only need to decide whether the polynomial vanishes on an algebraic variety which is related to this formula set. By decomposing this algebraic variety, an algorithm to decide this problem is given
Keywords
inference mechanisms; many-valued logics; theorem proving; algebraic method; deduction problem; many-valued logic; many-valued propositional calculus; polynomial; rational number field; Algebra; Artificial intelligence; Calculus; Computer science; Cost accounting; Logic circuits; Logic functions; Multivalued logic; Polynomials;
fLanguage
English
Publisher
ieee
Conference_Titel
Multiple-Valued Logic, 1994. Proceedings., Twenty-Fourth International Symposium on
Conference_Location
Boston, MA
Print_ISBN
0-8186-5650-6
Type
conf
DOI
10.1109/ISMVL.1994.302191
Filename
302191
Link To Document