|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 4 van 7 gevonden artikelen
| Titel: |
Computations in Boolean Algebra with Approximation |
| Auteur: |
Kostanyan, Armen Khnkoyan, Paruyr |
| Verschenen in: |
Fundamenta informaticae |
| Paginering: | Jaargang 135 (2014) nr. 3 pagina's 229-241 |
| Jaar: |
2014-11-24 |
| Inhoud: |
Computations in Boolean algebra extended by adding an undefined element are investigated in the present paper. These computations (also known as approximative computations) are based on Lukasiewicz three-valued logic and are widely used in those applications where it is necessary to perform logical operations under uncertainty. The approximative computations are carried out as follows: if all instantiations of undefined operands produce the same result then this ascertained result is taken as final; otherwise, the final result is defined to be unknown. The key question in theory of approximative computations is whether a given Boolean formula is closed in the sense that the stepwise approximative computations in compliance with a given formula produce a result as accurate as possible. This question is investigated for the classes of disjunctive and algebraic normal forms. |
| Uitgever: |
IOS Press |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 4 van 7 gevonden artikelen
| << vorige | volgende >> |