Carregant...
Carregant...

Vés al contingut (premeu Retorn)

BDDs for Pseudo-Boolean Constraints

Autor
Abío, I.; Nieuwenhuis, R.; Oliveras, A.; Rodriguez, E.
Tipus d'activitat
Presentació treball a congrés
Nom de l'edició
SAT 2001. 14th International Conference Theory and Applications of Satisfiability Testing
Any de l'edició
2011
Data de presentació
2011-06-21
Llibre d'actes
SAT 2011 - Theory and Applications of Satisfiability Testing
Pàgina inicial
61
Pàgina final
75
Editor
Springer Verlag
DOI
https://doi.org/10.1007/978-3-642-21581-0_7 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/14739 Obrir en finestra nova
URL
http://www.springerlink.com/content/l76mt89727133500/ Obrir en finestra nova
Resum
Pseudo-Boolean constraints are omnipresent in practical applications, and therefore a significant effort has been devoted to the development of good SAT encoding techniques for these constraints. Several of these encodings are based on building Binary Decision Diagrams (BDDs) and translating these into CNF. Indeed, BDD-based encodings have important advantages, such as sharing the same BDD for representing many constraints. Here we first prove that, unless NP = Co-NP, there are Pseudo- Boolean c...
Citació
Abío, I. [et al.]. BDDs for Pseudo-Boolean Constraints. A: International Conference on Theory and Applications of Satisfiability Testing. "SAT 2011 - Theory and Applications of Satisfiability Testing". Ann Arbor, MI, USA: Springer Verlag, 2011, p. 61-75.
Grup de recerca
LOGPROG - Lògica i Programació

Participants