BDDs for Pseudo-Boolean Constraints – Revisited-Reference-Cited by-同舟云学术

BDDs for Pseudo-Boolean Constraints – Revisited

Published:2011 Issue: Volume: Page:61-75
ISSN:0302-9743
Container-title:Theory and Applications of Satisfiability Testing - SAT 2011
language:
Short-container-title:

Author:

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

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-21581-0_7

Reference9 articles.

1. Bailleux, O., Boufkhad, Y., Roussel, O.: A Translation of Pseudo Boolean Constraints to SAT. JSAT 2(1-4), 191–200 (2006)

2. Lecture Notes in Computer Science;O. Bailleux,2009

3. Lecture Notes in Computer Science;C. Bartzis,2003

4. Biere, A., Heule, M.J.H., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. IOS Press, Amsterdam (2009)

5. Bessiere, C., Katsirelos, G., Narodytska, N., Walsh, T.: Circuit Complexity and Decompositions of Global Constraints. In: IJCAI 2009, pp. 412–418 (2009)

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Horn Maximum Satisfiability: Reductions, Algorithms and Applications;Progress in Artificial Intelligence;2017

2. On Tackling the Limits of Resolution in SAT Solving;Theory and Applications of Satisfiability Testing – SAT 2017;2017

3. PBLib – A Library for Encoding Pseudo-Boolean Constraints into CNF;Lecture Notes in Computer Science;2015

4. Explaining Propagators for Edge-Valued Decision Diagrams;Lecture Notes in Computer Science;2013

5. A Compact Encoding of Pseudo-Boolean Constraints into SAT;Lecture Notes in Computer Science;2012