Skip to main content
SpringerLink
Log in

SATO: An efficient propositional prover

  • Conference paper
  • First Online:
Automated Deduction—CADE-14 (CADE 1997)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1249))

Included in the following conference series:

Supported in part by NSF under grants CCR-9504205 and CCR-9357851.

The original version of this chapter was revised. A correction to this chapter is available at https://doi.org/DOI 10.1007/3-540-63104-6_45

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barth, P., A Davis-Putnam based enumeration algorithm for linear pseudo-Boolean optimization, Technical Report MPI-I-95-2-003, Max-Plank-Institut fur Informatik, 1995.

    Google Scholar 

  2. Crawford, J., Auton, L., (1993) Experimental results on the cross-over point in satisfiability problems. In Proc. of the 11th National Conference on Artificial Intelligence (AAAI-93), pp. 22–28.

    Google Scholar 

  3. Davis, M., G. Logemann, and D. Loveland. A machine program for theorem-proving. Communications of the Association for Computing Machinery 5, 7 (July 1962), 394–397.

    Article  MathSciNet  Google Scholar 

  4. Dubois, O, Andre, P., Boufkhan, Y., Carlier, J., SAT versus UNSAT, see [6].

    Google Scholar 

  5. (1995) Freeman, J.W., Improvements to propositional satisfiability search algorithms. Ph.D. Dissertation, Dept. of Computer Science, University of Pennsylvania.

    Google Scholar 

  6. Johnson, D.S., Trick, M.A., (eds.) The second DIMACS implementation challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science (see http://dimacs.rutgers.edu/challenges/)

    Google Scholar 

  7. (1980) McAllester, D.A., An outlook on truth maintenance, AI Memo 551, MIT AI laboratory.

    Google Scholar 

  8. Pretolani, D., Efficiency and stability of hypergraph SAT algorithms, see [6].

    Google Scholar 

  9. Silva, J.P.M., Sakallah, K.A., Conflict analysis in search algorithms for propositional satisfiability. Technical Reports, Cadence European Laboraties, ALGOS, INESC, Lisboa, Portugal, May 1996.

    Google Scholar 

  10. Stallman, R.M., Sussman, G.J., (1977) Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis. Artificial Intelligence, vol. 9, 135–196

    Article  Google Scholar 

  11. Stephan, P.R., Brayton, R.K., Sangiovanni-Binventelli, Combinational test generation using satisfiability, Memo no. UCS/ERL M92/112, Dept. of Electrical Engineering and Computer Science, University of California at Berkeley, Oct. 1992.

    Google Scholar 

  12. Zhang, H., SATO: A decision procedure for propositional logic. Association for Automated Reasoning Newsletter, 22, 1–3, March 1993.

    Google Scholar 

  13. Zhang, H., Bonacina, M.P., Hsiang, H.: (1996) PSATO: a distributed propositional prover and its application to quasigroup problems. To appear in Journal of Symbolic Computation.

    Google Scholar 

  14. Zhang, H., Stickel, M. (1994) Implementing the Davis-Putnam algorithm by tries. Technical Report, Dept. of Computer Science, The University of Iowa.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of Iowa, 52242-1419, Iowa City, IA, USA

    Hantao Zhang

Authors
  1. Hantao Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

William McCune

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg, corrected publication 2019

About this paper

Cite this paper

Zhang, H. (1997). SATO: An efficient propositional prover. In: McCune, W. (eds) Automated Deduction—CADE-14. CADE 1997. Lecture Notes in Computer Science, vol 1249. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63104-6_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-63104-6_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63104-0

  • Online ISBN: 978-3-540-69140-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation