On renamable Horn and generalized Horn functions
✍ Scribed by Vijaya Chandru; Collette R. Coullard; Peter L. Hammer; Miguel Montañez; Xiaorong Sun
- Publisher
- Springer Netherlands
- Year
- 1990
- Tongue
- English
- Weight
- 758 KB
- Volume
- 1
- Category
- Article
- ISSN
- 1012-2443
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
After providing a simple characterization of Horn functions (i.e., those Boolean functions that have a Horn DNF), we study in detail the special class of submodular functions. Every prime implicant of such a function involves at most one complemented and at most one uncomplemented variable, and base
We consider the problem of dualizing a Boolean function f given by CNF, i.e., computing a CNF for its dual f d . While this problem is not solvable in quasi-polynomial total time in general (unless SAT is solvable in quasi-polynomial time), it is so in case the input belongs to special classes, e.g.