Log in

A computer algebra approach to verification and deduction in many-valued knowledge systems

  • Original paper
  • Published:
Soft Computing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Germany)

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s005000050086

Navigation