Journal of the ACM Bibliography

Selected papers that cite this one

• C. A. Brown, L. Finkelstein, and P. W. Purdom Jr. Backtrack Searching in the Presence of Symmetry Nordic Journal of Computing, 3(3):203-219, Fall 1996.

• C. L. Chang. The unit proof and the input proof in theorem proving. Journal of the ACM, 17(4):698-707, October 1970.

• Nadia Creignou and Malika More. Complexity of satisfiability problems with symmetric polynomial clauses. Journal of Logic and Computation, 7(3):353-366, June 1997.

• Rina Dechter and Peter van Beek. Local and global relational consistency. Theoretical Computer Science, 173(1):283-308, 20 February 1997.

• Melvin Fitting. Destructive modal resolution. Journal of Logic and Computation, 1(1):83-97, July 1990.

• Jean-Denis Fouks and Jean-Claude Spehner. Meta-resolution: An algorithmic formalisation. Theoretical Computer Science, 166(1-2):147-172, 20 October 1996.

• Alan Frieze and Stephen Suen. Analysis of two simple heuristics on a random instance of k-SAT. Journal of Algorithms, 20(2):312-355, March 1996.

• Edward A. Hirsch. Two new upper bounds for SAT. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 521-530, San Francisco, California, 25-27 January 1998.

• Richard C. T. Lee. Fuzzy logic and the resolution principle. Journal of the ACM, 19(1):109-119, January 1972.

• Nicola Leone, Pasquale Rullo, and Francesco Scarcello. Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation. Information and Computation, 135(2):69-112, 15 June 1997.

• Yan Alexander Li, John K. Antonio, Howard Jay Siegel, Min Tan, and Daniel W. Watson. Determining the execution time distribution for a data parallel program in a heterogeneous computing environment. Journal of Parallel and Distributed Computing, 44(1):35-52, 10 July 1997.

• D. W. Loveland. A unifying view of some linear Herbrand procedures. Journal of the ACM, 19(2):366-384, April 1972.

• Zohar Manna. Properties of programs and the first-order predicate calculus. Journal of the ACM, 16(2):244-255, April 1969.

• Henri-M. Méjean, Henri Morel, and Gérard Reynaud. A variational method for analysing unit clause search. SIAM Journal on Computing, 24(3):621-649, June 1995.

• Neil V. Murray and Erik Rosenthal. Dissolution: Making paths vanish. Journal of the ACM, 40(3):504-535, July 1993.

• Ross A. Overbeek. A new class of automated theorem-proving algorithms. Journal of the ACM, 21(2):191-200, April 1974.

• Alexander Razborov, Avi Wigderson, and Andrew Yao. Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 739-748, El Paso, Texas, 4-6 May 1997.

• J. A. Robinson. Theorem-proving on the computer. Journal of the ACM, 10(2):163-174, April 1963.

• J. A. Robinson. A machine-oriented logic based on the resolution principle. Journal of the ACM, 12(1):23-41, January 1965.

• Bart Selman and Henry Kautz. Knowledge compilation and theory approximation. Journal of the ACM, 43(2):193-224, March 1996.

• James R. Slagle. Automatic theorem proving with renamable and semantic resolution. Journal of the ACM, 14(4):687-697, October 1967.

• James R. Slagle. Automatic theorem proving with built-in theories including equality, partial ordering, and sets. Journal of the ACM, 19(1):120-135, January 1972.

• Andrew Sohn. Parallel satisfiability test with synchronous simulated annealing on distributed-memory multiprocessor. Journal of Parallel and Distributed Computing, 36(2):195-204, 1 August 1996.

• Alasdair Urquhart. The complexity of propositional proofs. The Bulletin of Symbolic Logic, 1(4):425-467, December 1995.

• Tie-Cheng Wang. Z-module reasoning: An equality-oriented proving method with built-in ring axioms. Journal of the ACM, 40(3):558-606, July 1993.

Shortcuts: