Clegg, Matthew; Edmonds, Jeffery; Impagliazzo, Russell Using the Groebner basis algorithm to find proofs of unsatisfiability. (English) Zbl 0938.68825 Proceedings of the 28th annual ACM symposium on the theory of computing (STOC). Philadelphia, PA, USA, May 22-24, 1996. New York, NY: ACM, 174-183 (1996). For the entire collection see [Zbl 0908.00030]. Cited in 5 ReviewsCited in 47 Documents MSC: 68T15 Theorem proving (deduction, resolution, etc.) (MSC2010) 13P10 Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) PDF BibTeX Cite \textit{M. Clegg} et al., in: Proceedings of the 28th annual ACM symposium on the theory of computing, STOC '96. Philadelphia, PA, USA, May 22--24, 1996. New York, NY: ACM. 174--183 (1996; Zbl 0938.68825)