Anthony Monnet, Roger Villemaire. Scalable formula decomposition for propositional satisfiability. In Bipin C. Desai, Carson Kai-Sang Leung, Sudhir P. Mudur, editors, Canadian Conference on Computer Science & Software Engineering, C3S2E 2010, Montreal, Quebec, Canada, May 19-20, 2010, Proceedings. ACM International Conference Proceeding Series, pages 43-52, ACM, 2010. [doi]
@inproceedings{MonnetV10, title = {Scalable formula decomposition for propositional satisfiability}, author = {Anthony Monnet and Roger Villemaire}, year = {2010}, doi = {10.1145/1822327.1822333}, url = {http://doi.acm.org/10.1145/1822327.1822333}, researchr = {https://researchr.org/publication/MonnetV10}, cites = {0}, citedby = {0}, pages = {43-52}, booktitle = {Canadian Conference on Computer Science & Software Engineering, C3S2E 2010, Montreal, Quebec, Canada, May 19-20, 2010, Proceedings}, editor = {Bipin C. Desai and Carson Kai-Sang Leung and Sudhir P. Mudur}, series = {ACM International Conference Proceeding Series}, publisher = {ACM}, isbn = {978-1-60558-901-5}, }