Advertisement

SATO: An efficient propositional prover

  • Hantao Zhang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1249)

Keywords

Propositional Logic Constraint Satisfaction Problem Empty Clause Conflict Analysis Splitting Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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. 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.MathSciNetCrossRefGoogle Scholar
  4. 4.
    Dubois, O, Andre, P., Boufkhan, Y., Carlier, J., SAT versus UNSAT, see [6].Google Scholar
  5. 5.
    (1995) Freeman, J.W., Improvements to propositional satisfiability search algorithms. Ph.D. Dissertation, Dept. of Computer Science, University of Pennsylvania.Google Scholar
  6. 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. 7.
    (1980) McAllester, D.A., An outlook on truth maintenance, AI Memo 551, MIT AI laboratory.Google Scholar
  8. 8.
    Pretolani, D., Efficiency and stability of hypergraph SAT algorithms, see [6].Google Scholar
  9. 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. 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–196CrossRefGoogle Scholar
  11. 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. 12.
    Zhang, H., SATO: A decision procedure for propositional logic. Association for Automated Reasoning Newsletter, 22, 1–3, March 1993.Google Scholar
  13. 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. 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

Copyright information

© Springer-Verlag Berlin Heidelberg, corrected publication 2019 1997

Authors and Affiliations

  • Hantao Zhang
    • 1
  1. 1.Department of Computer ScienceThe University of IowaIowa CityUSA

Personalised recommendations