Parametrized prime implicant/implicate computations for regular logics

• Autores: Anavai Ramesh, Neil V. Murray
• Localización: Mathware & soft computing: The Magazine of the European Society for Fuzzy Logic and Technology, ISSN-e 1134-5632, Vol. 4, Nº. 2, 1997, págs. 155-179
• Idioma: inglés
• Títulos paralelos:
  • Parametrized prime implicant-implicate computations for regular logics
• Enlaces
  • Texto completo (pdf)
• Resumen

  • Prime implicant-implicate generating algorithms for multiple-valued logics (MVL's) are introduced. Techniques from classical logic not requiring large normal forms or truth tables are adapted to certain regular'' multiple-valued logics. This is accomplished by means of signed formulas, a meta-logic for multiple valued logics; the formulas are normalized in a way analogous to negation normal form. The logic of signed formulas is classical in nature. The presented method is based on path dissolution, a strongly complete inference rule. The generalization of dissolution that accommodates signed formulas is described. The method is first characterized as a procedure iterated over the truth value domain d = {0,1, ... ,n-1} of the MVL. The computational requirements are then reduced via parameterization with respect to the elements and the cardinality of d.