Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Karem A. Sakallah  Home/Search
Context Related
| umich.edu/techrepor...CSETR46302.pdf umich.edu/~imarkov...CSETR46302.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: umich.edu/~faloul/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Research in algorithms for Boolean satisfiability (SAT) and their implementations [45, 41, 10] has recently outpaced benchmarking efforts. Most of the classic DIMACS benchmarks [21] can now be solved in seconds on commodity PCs. More recent benchmarks [54] take longer to solve due of their large size, but are still solved in minutes. Yet, small and difficult SAT instances must exist if P##NP. To this end, our work articulates SAT instances that are unusually difficult for their size, including... (Update)
Cited by: More
On Sub-optimality and Scalability of Logic Synthesis Tools - Markov, Roy (2003) (Correct)
Resolution Cannot Polynomially Simulate Compressed-BFS - Motter, Roy, Markov (2003) (Correct)
Similar documents (at the sentence level):
51.6%: Solving Difficult Instances of Boolean Satisfiability .. - Aloul, Ramani.. (2003) (Correct)
8.7%: Solving Difficult SAT Instances in the Presence of Symmetry - Aloul, Ramani, Markov.. (2002) (Correct)
Active bibliography (related documents): More All
0.4: Five Ways to Use Induction and Symmetry in the Verification.. - Calder, Miller (2002) (Correct)
0.3: Symmetry-Breaking Predicates for Search Problems - Crawford, Ginsberg, Luks, Roy (1996) (Correct)
0.2: The SAT2002 Competition - Simon, Le Berre, Hirsch (2002) (Correct)
Similar documents based on text: More All
0.5: Breaking Instance-Independent Symmetries in Exact Graph.. - Ramani, Aloul, Markov.. (2004) (Correct)
0.5: Satometer: How Much Have We Searched? - Aloul, Sierawski, Sakallah (2002) (Correct)
0.5: Symmetry-Breaking for Pseudo-Boolean Formulas - Aloul, Ramani, Markov, Sakallah (2003) (Correct)
BibTeX entry: (Update)
F. Aloul, A. Ramani, I. Markov, and K. Sakallah, "Solving Difficult Instances of Boolean Satisfiability in the Presence of Symmetry," IEEE Trans. on CAD, vol. 22(9), pp. 1117--1137, Sept 2003. http://citeseer.ist.psu.edu/article/aloul02solving.html More
@misc{ aloul03solving,
author = "F. Aloul and A. Ramani and I. Markov and K. Sakallah",
title = "Solving Difficult Instances of Boolean Satisfiability in the Presence of
Symmetry",
text = "F. Aloul, A. Ramani, I. Markov, and K. Sakallah, Solving Difficult Instances
of Boolean Satisfiability in the Presence of Symmetry, IEEE Trans. on CAD,
vol. 22(9), pp. 1117--1137, Sept 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/article/aloul02solving.html" }
Citations (may not include all citations):459 A Computing Procedure For Quantification Theory (context) - Davis, Putnam - 1960
390 A Machine Program for Theorem Proving (context) - Davis, Logemann et al. - 1962
197 Noise Strategies for Improving Local Search - Selman, Kautz et al.
130 Chaff: Engineering an Efficient SAT Solver - Moskewicz, Madigan et al. - 2001
121 Hard Examples for Resolution (context) - Urquhart - 1987
101 Better verification through symmetry - Ip, Dill - 1996
82 The Theory of Groups (context) - Jr - 1959
77 GRASP: A New Search Algorithm for Satisfiability - Silva, Sakallah - 1999
72 Many hard examples for resolution (context) - Chvatal, Szemeredi - 1988
64 BerkMin: A Fast and Robust SAT Solver - Goldberg, Novikov - 2002
61 Generating Hard Satisfiability Problems - Selman, Mitchell et al. - 1996
56 Practical Graph Isomorphism (context) - McKay - 1981
54 Symmetry-breaking predicates for search problems - Crawford, Ginsberg et al.
49 Isomorphism of Graphs of Bounded Valence Can Be Tested in Po.. (context) - Luks - 1980
39 Finding Hard Instances of the Satisfiability Problem: A Surv.. - Cook, Mitchell - 1997
34 Excluding Symmetries in Constraint-Based Search - Backofen, Will - 1999
27 Effective Use of Boolean Satisfiability Procedures in the Fo.. - Velev, Bryant - 2001
27 Backtrack searching in the presence of symmetry (context) - Brown, Finkelstein et al. - 1988
26 Canonical Labeling of Graphs (context) - Babai, Luks
24 Generating Satisfiable Problem Instances - Achlioptas, Gomes et al. - 2000
22 GRAPE: A System For Computing With Graphs and Groups (context) - Soicher
22 Graduate Texts in Mathematics (context) - Hungerford - 1973
21 Short Proofs For Tricky Formulas (context) - Krishnamurthy - 1985
19 A theoretical analysis of reasoning by symmetry in first-ord.. - Crawford
18 Symmetry Reductions in Model Checking (context) - Clarke, by et al.
17 A Comparative Study of Two Boolean Formulations of FPGA Deta.. (context) - Nam, Aloul et al. - 2001
16 Nauty user's guide (context) - McKay - 1990
12 Tractability through symmetries in propositional calculus (context) - Benhamou, Sais - 1994
11 From Asymmetry to Full Symmetry: New Techniques for Symmetry.. - Emerson, Trefler - 1999
10 Graph Isomorphism Is Low For PP (context) - Kobler, Schoning et al. - 1992
9 Why is ATPG easy (context) - Prasad, Chong et al.
9 Partial Symmetry Breaking - McDonald, Smith - 2002
8 The Symmetry Rule in Propositional Logic (context) - Urquhart - 1996
8 A Heuristic for Symmetry Reductions with Scalarsets - Bosnacki, Dams et al. - 2001
8 Automorphism Groups, Isomorphism, Reconstruction (context) - Babai - 1995
7 The Complexity of McKay's Canonical Labeling Algorithm - Miyazaki - 1996
7 Constructive Library-Aware Synthesis Using Symmetries (context) - Kravets, Sakallah - 2001
6 Structural symmetry and model checking - Manku, Hojati et al.
6 Generalized Symmetries of Boolean Functions (context) - Kravets, Sakallah - 2000
5 Improving backtrack search for SAT by means of redundancy - Brisoux, Gregoire et al. - 1999
5 An introduction to computational group theory - Seress - 1997
5 Symmetry and Complexity (context) - Babai, Beals et al.
4 Integrating Symmetry Breaking Into A DLL Procedure - Li, Jurkowiak et al. - 2002
4 Review of Mathematical Software, GAP (context) - Spitznagel - 1994
4 Identification and Exploration of Symmetries in DSP Algorith.. (context) - van Eijk, Jacobs et al. - 1999
3 Faster SAT and Smaller BDDs via Common Structure (context) - Aloul, Markov et al. - 2001
2 the complexity of moving vertices in a graph - Lozano, Raghavan - 1998
2 Models and Symmetry breaking for `Peaceable Armies of Queens - Smith, Petrie et al. - 2002
2 Symmetry Breaking in Constraint Satisfaction - Luks, Roy - 2002
2 Fast Three-Level Logic Minimization Based on Autosymmetry - Bernasconi, Ciriani et al. - 2002
2 Hypergraph isomorphism and structural equivalence of boolean.. (context) - Luks
2 Using Problem Symmetry In Search Based Satisfiabiliy Problem.. - Prasad, Goldberg et al. - 2002
http://www.cs.washington.edu/homes/beame/papers/resj.ps
ftp://dimacs.rutgers.edu/pub/challenge/sat/benchmarks/cnf
Documents on the same site (http://www.eecs.umich.edu/~faloul/): More
MINCE: A Static Global Variable-Ordering for SAT and BDD - Aloul, Markov, Sakallah (2001) (Correct)
Efficient Verification of the PCI Local Bus using Boolean.. - Aloul, Sakallah (2000) (Correct)
Faster SAT and Smaller BDDs via Common Function Structure - Aloul, Markov, Sakallah (2001) (Correct)
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