Eliminating redundant clauses in SAT instances

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4510 LNCS, Issue , 2007, Pages 71-83

  Fourdrinoy, Olivier ^a   Grégoire, Éric ^a   Mazure, Bertrand ^a   Saïs, Lakhdar ^a  

^a UNIVERSITÉ D'ARTOIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; CONSTRAINT THEORY; LINEAR PROGRAMMING; POLYNOMIAL APPROXIMATION;

SATISFIABILITY CHECKING PROCEDURE; SATISFIABILITY PROBLEMS; SATISFIABILITY PROVERS;

PROBLEM SOLVING;

EID: 37149035994     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72397-4_6     Document Type: Conference Paper

References (30)

1. Selman, B., Levesque, H.J., Mitchell, D.G.: A new method for solving hard satisfiability problems. In: Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI'92). (1992) 440-446
2. Davis, M., Logemann, G., Loveland, D.W.: A machine program for theorem-proving. Communications of the ACM 5(7) (1962) 394-397
3. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proceedings of the 38th Design Automation Conference (DAC'01). (2001) 530-535
4. Eén, N., Sörensson, N.: An extensible SAT-solver. In: Proceedings of the 6th International Conference on Theory and Applications of Satisfiability Testing (SAT'03). (2003) 502-518
5. Dubois, O., Dequen, G.: A backbone-search heuristic for efficient solving of hard 3-SAT formulae. In: Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAT01). (2001) 248-253
6. Williams, R., Gomes, C.P., Selman, B.: Backdoors to typical case complexity. In: Proceedings of the 18th International Joint Conference on Artificial Intelligence (UCAI'03). (2003) 1173-1178
7. Liberatore, P.: The complexity of checking redundancy of CNF propositional formulae. In: Proceedings of the 15th European Conference on Artificial Intelligence (ECAI'02). (2002) 262-266
8. Grégoire, É., Ostrowski, R., Mazure, B., Saïs, L.: Automatic extraction of functional dependencies. In: Proceedings of the 7th International Conference on Theory and Applications of Satisfiability Testing (SAT'04). (2004) 122-132
9. Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, New York (USA), Association for Computing Machinery (1971)151-158
10. Tarjan, R.E.: Depth first search and linear graph algorithms. SIAM J. Comput. 1 (1972) 146-160
11. Even, S., Itai, A., Shamir, A.: On the complexity of timetable and multicommodity flow problems. SIAM J. Comput. 5 (1976) 691-703
12. Dowling, W.H., Gallier, J.H.: Linear-time algorithms for testing satisfiability of propositional horn formulae. Journal of Logic Programming 1(3) (1984) 267-284
13. Wei, W., Selman, B.: Accelerating random walks. In: Proceedings of 8th International Conference on the Principles and Practices of Constraint Programming (CP'2002). (2002) 216-232
14. Kautz, H.A., Ruan, Y., Achlioptas, D., Gomes, C.P., Selman, B., Stickel, M.E.: Balance and filtering in structured satisfiable problems. In: Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI'01). (2001) 351-358
15. Dubois, O., André, P., Boufkhad, Y., Carlier, Y.: SAT vs. UNSAT. In: Second DIMACS implementation challenge: cliques, coloring and satisfiability. Volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society (1996)415-436
16. Li, C.M., Anbulagan: Heuristics based on unit propagation for satisfiability problems. In: Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI'97). (1997) 366-371
17. Eén, N., Biere, A.: Effective preprocessing in SAT through variable and clause elimination. In: Proceedings of the 8th International Conference on Theory and Applications of Satisfiability Testing (SAT'05). (2005) 61-75
18. Subbarayan, S., Pradhan, D.K.: NiVER: Non-increasing variable elimination resolution for preprocessing SAT instances. In: Proceedings of the 7th International Conference on Theory and Applications of Satisfiability Testing (SAT'04). (2004) 276-291
19. Crawford, J.: A polynomial-time preprocessor ("compact") (1996) http://www.cirl.uoregon.edu/crawford/.
20. Zhang, W.: Configuration landscape analysis and backbone guided local search: Part i: Satisfiability and maximum satisfiability. Artificial Intelligence 158(1) (2004) 1-26
21. Le Berre, D.: Exploiting the real power of unit propagation lookahead. In: Proceedings of the Workshop on Theory and Applications of Satisfiability Testing (SAT'01), Boston University, Massachusetts, USA (2001)
22. Ostrowski, R., Mazure, B., Sais, L., Grégoire, É.: Eliminating redundancies in SAT search trees. In: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'2003), Sacramento (2003) 100-104
23. Darras, S., Dequen, G., Devendeville, L., Mazure, B., Ostrowski, R., Saïs, L.: Using Boolean constraint propagation for sub-clauses deduction. In: Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming (CP'05). (2005) 757-761
24. Boufkhad, Y., Roussel, O.: Redundancy in random SAT formulas. In: Proceedings of the 17th National Conference on Artificial Intelligence (AAAT00). (2000) 273-278
25. Liberatore, P.: Redundancy in logic i: CNF propositional formulae. Artificial Intelligence 163(2) (2005) 203-232
26. Selman, B., Kautz, H.A.: Knowledge compilation using horn approximations. In: Proceedings of the 9th National Conference on Artificial Intelligence (AAAI'91). (1991) 904-909
27. del Val, A.: Tractable databases: How to make propositional unit resolution complete through compilation. In: Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning (KR'94). (1994) 551-561
28. Marquis, P.: Knowledge compilation using theory prime implicates. In: Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI'95), Montréal, Canada (1995) 837-843
29. Mazure, B., Marquis, P.: Theory reasoning within implicant cover compilations. In: Proceedings of the ECAI'96 Workshop on Advances in Propositional Deduction, Budapest, Hungary (1996) 65-69
30. Grégoire, É., Mazure, B., Piette, C.: Extracting MUSes. In: Proceedings of the 17th European Conference on Artificial Intelligence (ECAT06), Trento, Italy (2006) 387-391