Parameterized prime implicant/implicate computations for regular logics
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 fo...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 1997 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2099/3487 |
| Acceso en línea: | https://hdl.handle.net/2099/3487 |
| Access Level: | acceso abierto |
| Palabra clave: | MLV's Multiple-valued logic Regular logics Lògica matemàtica Classificació AMS::03 Mathematical logic and foundations::03B General logic |
| Sumario: | 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$. |
|---|