Approximating Propositional Calculi by Finite-valued Logics

In 24th International Symposium on Multiple-valued Logic, 1994. Proceedings. Los Alamitos: IEEE Press. pp. 257–263 (1994)
Download Edit this record How to cite View on PhilPapers
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.
PhilPapers/Archive ID
BAAAPC
Revision history
Archival date: 2017-10-10
View upload history
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Added to PP index
2017-10-10

Total views
43 ( #32,769 of 39,984 )

Recent downloads (6 months)
32 ( #16,446 of 39,984 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks to external links.