1. Aavani, A., Mitchell, D.G., Ternovska, E.: New encoding for translating pseudo-boolean constraints into SAT. In: Proceedings of the Tenth Symposium on Abstraction, Reformulation, and Approximation, SARA 2013, 11–12 July 2013, Leavenworth, Washington, USA. (2013). http://www.aaai.org/ocs/index.php/SARA/SARA13/paper/view/7212
2. Azizi-Sultan, A.: Pseudo-propositional logic. In: Proceedings of the 3rd International Workshop on Automated Reasoning in Quantified Non-Classical Logics (ARQNL 2018) affiliated with the International Joint Conference on Automated Reasoning (IJCAR 2018), Oxford, UK, July 18, 2018., pp. 26–33 (2018). http://ceur-ws.org/Vol-2095/paper1.pdf
3. Bailleux, O., Boufkhad, Y., Roussel, O.: New encodings of pseudo-boolean constraints into CNF. In: Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30–July 3, 2009. Proceedings, pp. 181–194 (2009). https://doi.org/10.1007/978-3-642-02777-2_19
4. Biere, A., Cimatti, A., Clarke, E.M., Fujita, M., Zhu, Y.: Symbolic model checking using sat procedures instead of bdds. In: Proceedings of the 36th Annual ACM/IEEE Design Automation Conference, DAC ’99, pp. 317–320. ACM, New York, NY, USA (1999). https://doi.org/10.1145/309847.309942
5. Biere, A., Cimatti, A., Clarke, E.M., Zhu, Y.: Symbolic model checking without bdds. In: Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems, TACAS ’99, pp. 193–207. Springer, London, UK, UK (1999). http://dl.acm.org/citation.cfm?id=646483.691738