On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint

DOI10.1007/978-3-540-72397-4_21MaRDI QIDQ3612425zbMATH OpenOpenAlexFDO

Authors Jan-Georg Smaus

Publication date 10 March 2009

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72397-4_21

Mathematics Subject Classification ID

Classical propositional logic (03B05) Boolean functions (06E30) Integer programming (90C10)

Recommendations

• A pretty complete combinatorial algorithm for the threshold synthesis problem
• PBLib -- a library for encoding pseudo-Boolean constraints into CNF
• scientific article; zbMATH DE number 1543344
• New Encodings of Pseudo-Boolean Constraints into CNF
• Disjunctive and conjunctive normal forms of pseudo-Boolean functions

Cited in

(6)

• Logic-based 0-1 constraint programming
• Decomposing 1-Sperner hypergraphs
• A pretty complete combinatorial algorithm for the threshold synthesis problem
• BDDs for pseudo-Boolean constraints -- revisited
• scientific article; zbMATH DE number 4076964 (Why is no real title available?)
• From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions

Describes a project that uses

Uses Software

• HySAT
• SATO
• PBS

This page was built for publication: On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint

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