Hasan Amjad. LCF-Style Propositional Simplification with BDDs and SAT Solvers. In Otmane Aït Mohamed, César Muñoz, Sofiène Tahar, editors, Theorem Proving in Higher Order Logics, 21st International Conference, TPHOLs 2008, Montreal, Canada, August 18-21, 2008. Proceedings. Volume 5170 of Lecture Notes in Computer Science, pages 55-70, Springer, 2008. [doi]
@inproceedings{Amjad08,
title = {LCF-Style Propositional Simplification with BDDs and SAT Solvers},
author = {Hasan Amjad},
year = {2008},
doi = {10.1007/978-3-540-71067-7_9},
url = {http://dx.doi.org/10.1007/978-3-540-71067-7_9},
researchr = {https://researchr.org/publication/Amjad08},
cites = {0},
citedby = {0},
pages = {55-70},
booktitle = {Theorem Proving in Higher Order Logics, 21st International Conference, TPHOLs 2008, Montreal, Canada, August 18-21, 2008. Proceedings},
editor = {Otmane Aït Mohamed and César Muñoz and Sofiène Tahar},
volume = {5170},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-71065-3},
}