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

DOI10.1007/978-3-540-72397-4_21zbMath1214.90091OpenAlexW1712173076MaRDI QIDQ3612425

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

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

Related Items (2)

BDDs for Pseudo-Boolean Constraints – Revisited ⋮ Decomposing 1-Sperner hypergraphs

Uses Software

• HySAT
• SATO
• PBS

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