Pueblo: A modern Pseudo-Boolean SAT solver

Proceedings -Design, Automation and Test in Europe, DATE '05

Volumn II, Issue , 2005, Pages 684-685

  Sheini, Hossein M ^a   Sakallah, Karem A ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; FORMAL LOGIC; INTEGER PROGRAMMING;

LITERAL WATCHING STRATEGY; LOGIC-BASED REASONING; PRUNING POWER; PSEUDO-BOOLEAN SAT SOLVER;

PROBLEM SOLVING;

EID: 33646945035     PISSN: 15301591     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DATE.2005.246     Document Type: Conference Paper

References (6)

1. F.A. Aloul, A. Ramani, I.L. Markov, K.A. Sakallah, "Generic ILP versus specialized 0-1 ILP: An Update'", ICCAD'02 pp. 450-457
2. D. Chai, A. Kuehlmann, "A Fast Pseudo-Boolean Constraint Solver". DAC'03 pp. 830-835
3. V. Chvátal, "Edmouds Polytopes and a Hierarchy of Combinatorial Problems'', Discr. Math., vol. 4, pp. 305-307, 1973.
4. N. Eén, and N. Sörensson, "An Extensible SAT-solver," SAT'03 pp 502-508.
5. J.P. Marqucs-Silva and K.A. Sakallab, "GRASP: a search algorithm for prepositional satisfiability'', IEEE Transaction on Computers, vol. 48/5, pp. 506-521, 1999.
6. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang. and S. Malik, ''Chaff: Engineering an Efficient SAT Solver", DAC'01 pp. 530-535