Disjunctive and conjunctive normal forms of pseudo-Boolean functions

Discrete Applied Mathematics

Volumn 107, Issue 1-3, 2000, Pages 1-26

  Foldes, Stephan ^a   Hammer, Peter L ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347933134     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00276-6     Document Type: Article

References (24)

1. G. Alexe, S. Alexe, S. Foldes, P.L. Hammer, B. Simeone, Consensus algorithms for the generation of all maximal bicliques, Rutgers University, RUTCOR Research Reports, RRR 23-2000. http: // rutcor.rutgers.edu /.
2. Baccelli F., Cohen G., Olsder G.J., Quadrat J.P. Synchronization and Linearity. 1992;Wiley, New York.
3. Bioch J.C. Dualization, decision lists and identification of monotone discrete functions. Ann. Math. Art. Intell. 24:1998;69-91.
4. Bioch J.C., Ibaraki T. Decompositions of positive self-dual Boolean functions. Discrete Math. 140:1995;23-46.
5. Blake A. Canonical expressions in Boolean algebra, Dissertation, University of Chicago, 1937. 1938;University of Chicago Press, Chicago.
6. Boros E., Hammer P.L., Minoux M., Rader D. Optimal cell flipping to minimize channel density in VLSI design and pseudo-Boolean optimization. Discrete Appl. Math. 90:1999;69-88.
7. Brown F.M. Boolean Reasoning - The Logic of Boolean Equations. 1990;Kluwer, Dordrecht.
8. Cuninghame-Green R. Minimax Algebra, Lecture Notes in Economics and Mathematical Systems 166. 1979;Springer, Berlin.
9. Davio M., Deschamps J.-P., Thayse A. Discrete and Switching Functions. 1978;McGraw-Hill, New York.
10. Ekin O., Foldes S., Hammer P.L., Hellerstein L. Equational characterizations of Boolean function classes. Discrete Math. 211:2000;27-51.
11. S. Foldes, P.L. Hammer, Monotone, Horn and quadratic pseudo-Boolean functions. J. Universal Comput. Sci. 6(1) (2000) 97-104, http: // www.iicm.edu / jucs.
12. S. Foldes, P.L. Hammer, Disjunctive analogues of submodular and supermodular pseudo-Boolean functions, Rutgers University, RUTCOR Research Reports, forthcoming, http: // rutcor.rutgers.edu / .
13. S. Foldes, P.L. Hammer, Disjunctive and conjunctive representations in finite lattices and convexity spaces, Rutgers University, RUTCOR Research Reports, RRR 12-2000, http: // rutcor.rutgers.edu / .
14. Fraenkel A.S., Hammer P.L. Pseudo-Boolean functions and their graphs. Ann. Discrete Math. 20:1984;137-146.
15. Gottschalk W.H. The theory of quaternality. J. Symbolic Logic. 18:1953;193-196.
16. Halmos P.R. Lectures on Boolean Algebras. 1963;Van Nostrand, Princeton, NJ.
17. Hammer P.L., Rosenberg I.G., Rudeanu S. On the minimization of pseudo-Boolean functions. Stud. Cerc. Mat. 14:1963;359-364.
18. Hammer P.L., Rudeanu S. Boolean Methods in Operations Research and Related Areas. 1968;Springer, Berlin.
19. Horn A. On sentences which are true of direct unions of algebras. J. Symbolic Logic. 16:1951;14-21.
20. Marichal J.-L. On Sugeno integral as an aggregation function. Fuzzy Sets and Systems. 114(3):2000;347-365.
21. J.-L. Marichal, P. Mathonet, On comparison meaningfulness of aggregation functions, GEMME Working Paper 9820, November 1998, University of Liege, Belgium, J. Math. Psychology, to appear. http: // www.sig.egss.ulg.ac.be / gemme /.
22. Quine W.V. A way to simplify truth functions. Amer. Math. Monthly. 62:1955;627-631.
23. B. Simeone, A generalized consensus approach to non-linear 0-1 optimization, Research Report, 79-38, University of Waterloo, Department of Combinatorics and Optimization, 1979.
24. Störmer H. Binary Functions and their Applications, Lecture Notes in Economics and Mathematics Systems 348. 1990;Springer, Berlin.