Advertisement

To guess or to think? Hybrid algorithms for SAT (extended abstract)

  • Irina Rish
  • Rina Dechter
Posters
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1118)

References

  1. 1.
    M. Davis, G. Logemann and D. Loveland, A machine program for theorem proving, Communications of the ACM, 5, 1962, pp. 394–397.Google Scholar
  2. 2.
    M. Davis and H. Putnam, A computing procedure for quantification theory, Journal of the ACM, 7, 1960, pp. 201–215.Google Scholar
  3. 3.
    R. Dechter, Topological parameters for time-space tradeoff, In Proceedings of UAI-96, 1996.Google Scholar
  4. 4.
    R. Dechter and I. Rish, Directional Resolution: The Davis-Putnam Procedure, Revisited. In Proceedings of KR-94, pp. 134–145, 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Irina Rish
    • 1
  • Rina Dechter
    • 1
  1. 1.Information and Computer ScienceUniversity of CaliforniaIrvineUSA

Personalised recommendations