DocumentCode
1938118
Title
Approximating propositional calculi by finite-valued logics
Author
Baaz, Matthias ; Zach, Richard
Author_Institution
Inst. fur Algebra und Diskrete Math., Tech. Univ. Wien, Austria
fYear
1994
fDate
25-27 May 1994
Firstpage
257
Lastpage
263
Abstract
The problem of approximating a propositional calculus is to find many-valued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few tautologies as possible. This has potential applications for representing (computationally complex) logics used in AI by (computationally easy) many-valued logics. It is investigated how far this method can be carried using (1) one or (2) an infinite sequence of many-valued logics. It is shown that the optimal candidate matrices for (1) can be computed from the calculus
Keywords
many-valued logics; finite-valued logics; many-valued logics; optimal candidate matrices; propositional calculi approximation; tautologies; Algebra; Application software; Artificial intelligence; Calculus; Computer applications; Computer science; 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.302193
Filename
302193
Link To Document