Título original |
Parametrized prime implicant/implicate computations for regular logics. |
Título inglés |
Parametrized prime implicant-implicate computations for regular logics. |
Título español |
Cálculos parametrizados de primo implicante-implicado para lógicas regulares. |
Autor/es |
Ramesh, Anavai ; Murray, Neil V. |
Organización |
Intel Corp., Chandler (Arizona), Estados Unidos;Dep. Comput. Sci. Sci. Univ. New York (SUNY), Albany (Nueva York), Estados Unidos |
Revista |
1134-5632 |
Publicación |
1997, 4 (2): 155-179, 19 Ref. |
Tipo de documento |
articulo |
Idioma |
Inglés |
Resumen inglés |
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 ∆ = {0,1, ... ,n-1} of the MVL. The computational requirements are then reduced via parameterization with respect to the elements and the cardinality of ∆. |
Clasificación UNESCO |
110214 |
Palabras clave español |
Lógica multivaluada ; Algoritmos ; Signatura ; Formulación ; Parametrización |
Código MathReviews |
MR1621914 |
Código Z-Math |
Zbl 0880.03010 |
Acceso al artículo completo |