Abstract
A theoretical result [10] that relates tautological consequence in many-valued logics to the ideal membership problem in algebra is revisited. The intended use of the approach in this article and its implementation is the verification of consistency and the automated extraction of knowledge in rule-based knowledge systems. Programs are written in the CoCoA language. Four RBS are studied to illustrate the implementation.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Laita, L., Roanes-Lozano, E., de Ledesma, L. et al. A computer algebra approach to verification and deduction in many-valued knowledge systems. Soft Computing 3, 7–19 (1999). https://doi.org/10.1007/s005000050086
Issue Date:
DOI: https://doi.org/10.1007/s005000050086