Nadia Creignou, Frédéric Olive, Johannes Schmidt. Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight. In Karem A. Sakallah, Laurent Simon, editors, Theory and Applications of Satisfiability Testing - SAT 2011 - 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings. Volume 6695 of Lecture Notes in Computer Science, pages 120-133, Springer, 2011. [doi]
@inproceedings{CreignouOS11,
title = {Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight},
author = {Nadia Creignou and Frédéric Olive and Johannes Schmidt},
year = {2011},
doi = {10.1007/978-3-642-21581-0_11},
url = {http://dx.doi.org/10.1007/978-3-642-21581-0_11},
researchr = {https://researchr.org/publication/CreignouOS11},
cites = {0},
citedby = {0},
pages = {120-133},
booktitle = {Theory and Applications of Satisfiability Testing - SAT 2011 - 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings},
editor = {Karem A. Sakallah and Laurent Simon},
volume = {6695},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-21580-3},
}