BDDs for Pseudo-Boolean Constraints – Revisited

DOI10.1007/978-3-642-21581-0_7zbMath1330.68098OpenAlexW1829927364MaRDI QIDQ3007674

Ignasi Abío, Enric Rodríguez-Carbonell, Albert Oliveras, Robert Nieuwenhuis

Publication date: 17 June 2011

Published in: Theory and Applications of Satisfiability Testing - SAT 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21581-0_7

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

PBLib – A Library for Encoding Pseudo-Boolean Constraints into CNF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint
• New Encodings of Pseudo-Boolean Constraints into CNF
• Graph-Based Algorithms for Boolean Function Manipulation

This page was built for publication: BDDs for Pseudo-Boolean Constraints – Revisited