CAMA: A Multi-Valued Satisfiability Solver

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers

Volumn , Issue , 2003, Pages 326-333

  Liu, Cong ^a   Kuehlmann, Andreas ^a,b   Moskewicz, Matthew W ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b CADENCE DESIGN SYSTEMS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BENCHMARKING; BOOLEAN ALGEBRA; COMPUTER AIDED DESIGN; CONSTRAINT THEORY; ENCODING (SYMBOLS); FUNCTIONS; HEURISTIC METHODS; PROBLEM SOLVING;

AUTOMATIC TEST PATTERN GENERATION (ATPG); ONE-HOT-ENCODING (OHE);

SEARCH ENGINES;

EID: 0346148462     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. P. Stephan, R. K. Brayton, and A. Sangiovanni-Vincentelli, "Combinational test generation using satisfiability," IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 15, pp. 1167-1176, 1996.
2. M. Davis and H. Putnam, "A computing procedure for quantification theory," Journal of of the Association of for Computing Machinery, vol. 7, pp. 102-215, 1960.
3. M. Davis, G. Logeman, and D. Loveland, "A machine program for theorem proving," Communications of the ACM, vol. 5, pp. 394-397, July 1962.
4. B. Selman, H. A. Kautz, and B. Cohen, "Noise strategies for improving local search," in Proceedings of the Twelfth National Conference on Artificial Intelligence, (Menlo Park. CA, USA), pp. 337-343, 1994.
5. A. M. Frisch and T. J. Peugniez, "Solving non-boolean satisfiability problems with stochastic local search," in Proceeding of the 17th International Joint Conference on Artificial Intelligence, 2001.
6. J. P. Marques-Silva and K. A. Sakallah, "GRASP: A search algorithm for propositional satisfiability," IEEE Transactions on Computers, vol. 48, no. 5, pp. 506-521, 1999.
7. H. Zhang, "SATO: An efficient propositional prover," in Proceedings of the International Conference on Automated Deduction, July 1997.
8. J. W. Freeman, Improvements to Propositional Satisfiability Search Algorithms. PhD thesis, Department of Computer and Information Science, University of Pennsylvania, May 1995.
9. M. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S.Malik, "Chaff: Engineering an efficient SAT solver," in Proceedings of the 38th ACM/IEEE Design Automation Conference, (Las Vegas, Nevada), pp. 530-535, June 2001.
10. E. Goldberg and Y. Novikov, "BerkMin: A fast and robust SAT-solver," in European Design Automation & Test Conference, (Paris, France), pp. 142-149, March 2002.
11. R. K. Brayton and S. P. Khatri, "Multi-valued logic synthesis, " in Proceedings of the International Conference on VLSI Design, January 1999.
12. J. Hooker, H. Hoos, and T. Sttzle. DIMACS PHOLE benchmarks available at http://www.intellektik.informatik.tu-darmstadt.de/SATLIB/benchm.html, 2000.