Parameterized prime implicant/implicate computations for regular logics
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2099/3487
Tipus de documentArticle
Data publicació1997
EditorUniversitat Politècnica de Catalunya. Secció de Matemàtiques i Informàtica
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
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 $\Delta\,=\,\{0,1, \dots ,n-1\}$ of the MVL. The computational requirements are then reduced via parameterization with respect to the elements and the cardinality of $\Delta$.
ISSN1134-5632
Col·leccions
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
Ramesh.pdf | 352,0Kb | Visualitza/Obre |