NiVER: Non-increasing variable elimination resolution for preprocessing SAT instances

Lecture Notes in Computer Science

Volumn 3542, Issue , 2005, Pages 276-291

  Subbarayan, Sathiamoorthy ^a   Pradhan, Dhiraj K ^b  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

^b UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COSTS; NUMBER THEORY;

FORMULA SIZE; LITERAL COUNT; NON-INCREASING VARIABLE ELIMINATION RESOLUTION (NIVER); SAT INSTANCES;

PROBLEM SOLVING;

EID: 26444490012     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11527695_22     Document Type: Conference Paper

References (16)

1. M. Davis, H. Putnam. : A Computing procedure for quantification theory. J. of the ACM, 7 (1960)
2. M. Davis, et.al.,: A machine program for theorem proving. Comm. of ACM, 5(7) (1962)
3. F. Bachhus, J. Winter. : Effective preprocessing with Hyper-Resolut ion and Equality Reduction, SAT 2003 341-355
4. R. I. Brafman : A simplifier for prepositional formulas with many binary clauses, IJCAI 2001, 515-522.
5. E.Goldberg, Y.Novikov.: BerkMin: a Fast and Robust SAT-Solver, Proc. of DATE 2002, 142-149
6. M. Moskewicz, et.al.,: Chaff: Engineering an efficient SAT solver, Proc. of DAC 2001
7. J. Franco. : Elimination of infrequent variables improves average case performance of satisfiability algorithms. SIAM Journal on Computing 20 (1991) 1119-1127.
8. A. Van Gelder.: Combining preorder and postorder resolution in a satisfiability solver, In Kautz, H., and Selman, B., eds., Electronic Notes of SAT 2001, Elsevier.
9. H. Hoos, T. Stützle.: SATLIB: An Online Resource for Research on SAT. In: I.P.Gent, H.v.Maaren, T.Walsh, editors, SAT 2000, 283-292, www.satlib.org
10. IBM Formal Verification Benchmarks Library : http://www.haifa.il.ibm.com/ projects/verification/RB_Homepage/bmcbenchmarks.html
11. UCLID : http://www-2.cs.cmu.edu/~uclid/
12. L. Ryan : Siege SAT Solver : http://www.cs.sfu.ca/~loryan/personal/
13. NiVER SAT Preprocessor : http://www.itu.dk/people/sathi/niver.html
14. E. D. Hirsch. : New Worst-Case Upper Bounds for SAT, J. of Automated Reasoning 24 (2000) 397-420
15. A. Biere: BMC, http://www-2.cs.cmu.edu/~modelcheck/bmc.html
16. M. N. Velev: Microprocessor Benchmarks, http://www.ece.cmu.edu/~mvelev/ sat_benchmarks.html