1. Ausiello, G., Franciosa, P., Frigioni, D.: Directed hypergraphs: problems, algorithmic results, and a novel decremental approach. In: Proceedings of 14Th Italian Conference on Theoretical Computer Science (ICTCS 2001), pp.312–328. Torino, Italy (2001)
2. Bryant, R.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. 35, 677–691 (1986)
3. Chen, H., Marques-Silva, J.: Tg-pro - a sat-based atpg system.
http://logos.ucd.ie/web/doku.php?id=tg-pro
Accessed on 16 May (2014)
4. clasp:a conflict-driven nogood learning answer set solver.
http://www.cs.uni-potsdam.de/clasp/
. Accessed on 4th August (2015)
5. Coudert, O., Madre, J.C.: Implicit and incremental computation of primes and essential primes of Boolean functions. In: Design Automation Conference, 1992. Proceedings., 29Th ACM/IEEE, pp. 36–39 (1992)