Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

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

  • Posters
  • Conference paper
  • First Online:
Principles and Practice of Constraint Programming — CP96 (CP 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1118))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

References

  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. M. Davis and H. Putnam, A computing procedure for quantification theory, Journal of the ACM, 7, 1960, pp. 201–215.

    Google Scholar 

  3. R. Dechter, Topological parameters for time-space tradeoff, In Proceedings of UAI-96, 1996.

    Google Scholar 

  4. R. Dechter and I. Rish, Directional Resolution: The Davis-Putnam Procedure, Revisited. In Proceedings of KR-94, pp. 134–145, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Information and Computer Science, University of California, 92717, Irvine, CA, USA

    Irina Rish & Rina Dechter

Authors
  1. Irina Rish
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rina Dechter
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Eugene C. Freuder

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rish, I., Dechter, R. (1996). To guess or to think? Hybrid algorithms for SAT (extended abstract). In: Freuder, E.C. (eds) Principles and Practice of Constraint Programming — CP96. CP 1996. Lecture Notes in Computer Science, vol 1118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61551-2_113

Download citation

  • DOI: https://doi.org/10.1007/3-540-61551-2_113

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61551-4

  • Online ISBN: 978-3-540-70620-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation