Vivifying propositional clausal formulae

Frontiers in Artificial Intelligence and Applications

Volumn 178, Issue , 2008, Pages 525-529

  Piette, Cédric ^a   Hamadi, Youssef ^b   Saïs, Lakhdar ^a  

^a UNIVERSITÉ D'ARTOIS   (France)

^b MICROSOFT RESEARCH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

'CURRENT; BOOLEAN FORMULAE; CLAUSE LEARNING; CONJUNCTIVE NORMAL FORMS; IMPROVE-A; LEARNING SCHEMES; POWER; PRE-PROCESSING TECHNIQUES; SIZE-REDUCTION; UNIT PROPAGATION;

BOOLEAN ALGEBRA;

EID: 85051927147     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-58603-891-5-525     Document Type: Conference Paper

References (13)

1. F. Bacchus and J. Winter, ‘Effective preprocessing with hyper-resolution and equality reduction’, in SAT’03, pp. 341–355, (2003).
2. Ronen I. Brafman, ‘A simplifier for propositional formulas with many binary clauses’, in IJCAI’01, pp. 515–522, (2001).
3. S.A. Cook and D.G. Mitchell, ‘Finding hard instances of the satisfiability problem: A survey’, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 35, (1997).
4. S. Darras, G. Dequen, L. Devendeville, B. Mazure, R. Os-trowski, and L. Sais, ‘Using boolean constraint propagation for sub-clause deduction’, in CP’05, pp. 757–761, (2005).
5. M. Davis and H. Putnam, ‘A computing procedure for quantification theory’, Journal of the ACM, 7(3), 201–215, (1960).
6. N. Eén and A. Biere, ‘Effective preprocessing in SAT through variable and clause elimination’, in SAT’05, pp. 61–75, (2005).
7. O. Fourdrinoy, E. Grégoire, B. Mazure, and L. Sais, ‘Eliminating redundant clauses in SAT instances’, in CP-AI-OR’07, pp. 71–83, (2007).
8. A. Hertel, P. Hertel, and A. Urquhart, ‘Formalizing dangerous SAT encodings’, in SAT’07, pp. 159–172, (2007).
9. R. G. Jeroslow and J. Wang, ‘Solving propositional satisfiability problems’, Annals of mathematics and artificial intelligence, 1, 167–187, (1990).
10. C. Li and Anbulagan, ‘Look-ahead versus look-back for satisfiability problems.’, in CP’97, pp. 341–355, (1997).
11. Paolo Liberatore, ‘Redundancy in logic I: CNF propositional formulae’, Artif. Intell., 163(2), 203–232, (2005).
12. K. Pipatsrisawat and A. Darwiche, ‘RSAT 2.0: SAT solver description’, Technical Report D–153, Automated Reasoning Group, Computer Science Department, UCLA, (2007).
13. S. Subbarayan and D. Pradhan, ‘NiVER: Non increasing variable elimination resolution for preprocessing SAT instances’, SAT’04, 276–291, (2004).