Name
Abstract | ||
|---|---|---|
After showing that every pseudo-Boolean function (i.e. real-valued function with binary variables) can be represented by a disjunctive normal form (essentially the maximum of several weighted monomials), the concepts of implicants and of prime implicants are analyzed in the pseudo-Boolean context, and a consensus-type method is presented for finding all the prime implicants of a pseudo-Boolean function. In a similar way the concepts of conjunctive normal form, implicates and prime implicates, as well as the resolution method are examined in the case of pseudo-Boolean functions. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1016/S0166-218X(00)00276-6 | Discrete Applied Mathematics |
Keywords | Field | DocType |
pseudo-boolean function,conjunctive normal form,disjunctive normal form,value function | Prime (order theory),Boolean function,Monotonic function,Canonical normal form,Discrete mathematics,Combinatorics,Negation normal form,Disjunctive normal form,Conjunctive normal form,Implicant,Mathematics | Journal |
Volume | Issue | ISSN |
107 | 1-3 | Discrete Applied Mathematics |
Citations | PageRank | References |
8 | 0.96 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stephan Foldes | 1 | 175 | 19.36 |
| Peter L. Hammer | 2 | 1996 | 288.93 |