Journal of the ACM Bibliography
Harry
R. Lewis. Renaming a set of clauses as a Horn set. Journal of
the ACM, 25(1):134-135, January 1978.
[BibTeX entry]
Selected papers that cite this one
- E. Boros, Y. Crama, P. L. Hammer, and M. Saks. A complexity index
for satisfiability problems. SIAM Journal on Computing,
23(1):45-49, February 1994.
- Thomas Eiter, Toshihide Ibaraki, and Kazuhisa Makino. On
disguised double Horn functions and extensions. In 15th Annual
Symposium on Theoretical Aspects of Computer Science, volume 1373
of Lecture Notes in Computer Science, pages 50-60, Paris
France, 25-27 February 1998. Springer.
- Jean-Jacques Hébrard. Unique Horn renaming and
Unique 2-Satisfiability. Information Processing
Letters, 54(4):235-239, 26 May 1995.
- Bart Selman and Henry Kautz. Knowledge compilation and theory
approximation. Journal of the ACM, 43(2):193-224, March
1996.
Shortcuts: