C. M. Li, B. Jurkowiak, and P. W. Purdom, "Integrating symmetry breaking into a DLL procedure," in Intl. Symp. on Boolean Satisfiability (SAT), Cincinnatti, OH, 2002, pp. 149--155. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Evolutionary Computing for the Satisfiability Problem - Hao, Lardeux, Saubion (2003) (Correct)
....Instances and Evaluation Criterions Two classes of instances are used : Structured and Random instances. Structured instances: aim 100 1 6 yes1 4, aim 100 2 0 yes1 3(random instances with only one solution) mat25.shuffled, mat26.shuffled (multiplication of two n n matrices using m products [19]) color 15 4, color 22 5 (chessboard coloring instances) g125.18, g250.29 (graph coloring instances) and dp10u09.suffled, dp11u10.suffled (instances generated from bounded model checking from the well known dining philosophers example) Random instances: glassy v399 s1069116088, ....
Chu Min Li, Bernard Jurkowiak, and Paul W. Purdom. Integrating symmetry breaking into a dll procedure. In Fifth International Symposium on the Theory and Applications of Satis ability Testing (SAT2002), pages 149155, 2002.
The SAT2002 Competition - Simon, Le Berre, Hirsch (2002) (Correct)
....polynomial from Chu Min Li (with Bernard Jurkowiak and Paul W. Purdom) Those instances encode respectively the multiplication of two nn matrices using m products, and the multiplication of two polynomials of degree bound n using m products. Both problems should involve a lot of symmetries (see [CMLP02] urquhart from Chu Min Li (with Sebastien Cantarell and Bernard Jurkowiak) Li00] and independently from Laurent Simon [CS00] All instances are unsatisfiable and proved very hard for all DLL and DP approaches (hard for all resolution based procedures, in general [Urq87] Chu Min Li ....
B. Jurkowiak C.-M. Li and P. W. Purdom. Integrating symmetry breaking into a dll procedure. In SAT2002 [SAT02], pages 149--155.
Solving Difficult Instances of Boolean Satisfiability .. - Aloul, Ramani.. (2002) (Correct)
.... main directions were explored: a) preprocessing the original CNF formula by adding symmetrybreaking clauses that do not affect satisfiability but speed up search [18] and (b) extending SAT solvers, particularly those based on backtracking, to dynamically use symmetries during the search process [13, 6, 31, 44]. In this paper we pursue the pre processing approach due to its simplicity, but will outline how our techniques can be applied within a backtracking solver for increased efficiency. 1.3 Empirical efficiency challenges Most prior works on symmetries in SAT predate recent breakthroughs in SAT ....
....or do not show convincing empirical results at all. For example, Crawford et al. suggest in [18] that symmetrybased techniques allow the pigeon hole instances to be solved in polynomial time, but their empirical data [18, Figure 3] do not support this suggestion. In the course of more recent work [31, 49], specific families of CNF formulae with extremely high numbers of symmetries were successfully attacked. Yet, it remains unclear whether the performance of leading edge SAT solvers can be improved, via the use of symmetries, on large CNF families of practical significance. In principle, the ....
[Article contains additional citation context not shown here]
C. M. Li, B. Jurkowiak and P. W. Purdom, "Integrating Symmetry Breaking Into A DLL Procedure", Intl. Symp. on Boolean Satisfiability (SAT), Cincinnatti, 2002, pp. 149-155.
Solving Difficult Instances of Boolean Satisfiability .. - Aloul, Ramani.. (2003) (Correct)
No context found.
C. M. Li, B. Jurkowiak, and P. W. Purdom, "Integrating symmetry breaking into a DLL procedure," in Intl. Symp. on Boolean Satisfiability (SAT), Cincinnatti, OH, 2002, pp. 149--155.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC