Disjunctive and conjunctive normal forms of pseudo-Boolean functions

DOI10.1016/S0166-218X(00)00276-6MaRDI QIDQ1841879zbMATH OpenFDO

Authors Stephan Foldes, Peter L. Hammer

Publication date 26 July 2001

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

resolution methodpseudo-Boolean functiondisjunctive normal formprime implicatesconjunctive normal formprime implicants

Mathematics Subject Classification ID

Boolean functions (06E30)

Recommendations

• scientific article; zbMATH DE number 1543344
• Pseudo-Boolean optimization with a disjunctive constraint
• scientific article; zbMATH DE number 3910310
• A pseudo-Boolean consensus approach to nonlinear 0-1 optimization
• Disjunctive analogues of submodular and supermodular pseudo-Boolean functions

Cites work

• scientific article; zbMATH DE number 3889431 (Why is no real title available?)
• scientific article; zbMATH DE number 49082 (Why is no real title available?)
• scientific article; zbMATH DE number 3599956 (Why is no real title available?)
• scientific article; zbMATH DE number 627763 (Why is no real title available?)
• scientific article; zbMATH DE number 1543344 (Why is no real title available?)
• scientific article; zbMATH DE number 3212646 (Why is no real title available?)
• scientific article; zbMATH DE number 3249560 (Why is no real title available?)
• scientific article; zbMATH DE number 3185026 (Why is no real title available?)
• A Way to Simplify Truth Functions
• Binary functions and their applications
• Consensus algorithms for the generation of all maximal bicliques
• Decompositions of positive self-dual Boolean functions
• Disjunctive analogues of submodular and supermodular pseudo-Boolean functions
• Disjunctive and conjunctive representations in finite lattices and convexity spaces
• Dualization, decision lists and identification of monotone discrete functions
• Equational characterizations of Boolean function classes
• Minimax algebra
• On Sugeno integral as an aggregation function
• On sentences which are true of direct unions of algebras
• Optimal cell flipping to minimize channel density in VLSI design and pseudo-Boolean optimization
• The theory of quaternialty

Cited in

(22)

• scientific article; zbMATH DE number 2033418 (Why is no real title available?)
• Consensus algorithms for the generation of all maximal bicliques
• A pseudo-Boolean consensus approach to nonlinear 0-1 optimization
• scientific article; zbMATH DE number 3889431 (Why is no real title available?)
• scientific article; zbMATH DE number 3939259 (Why is no real title available?)
• Exclusive and essential sets of implicates of Boolean functions
• Spanned patterns for the logical analysis of data
• Disjunctive analogues of submodular and supermodular pseudo-Boolean functions
• Rotation-invariant t-norm solutions of a system of functional equations
• On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint
• scientific article; zbMATH DE number 1543344 (Why is no real title available?)
• scientific article; zbMATH DE number 3672216 (Why is no real title available?)
• scientific article; zbMATH DE number 3910310 (Why is no real title available?)
• Representations of normalized formulas
• Disjunctive and conjunctive representations in finite lattices and convexity spaces
• Structure of continuously valued logical functions
• Normal Boolean functions
• Disjunctive normal forms of Boolean functions with a small number of zeros
• Join-irreducible Boolean functions
• Locally monotone Boolean and pseudo-Boolean functions
• Pseudo-Boolean conditional optimization models for a class of multiple traveling salesmen problems
• Fast 1-flip neighborhood evaluations for large-scale pseudo-Boolean optimization using posiform representation

This page was built for publication: Disjunctive and conjunctive normal forms of pseudo-Boolean functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1841879)