List of Papers That Use the SAT Benchmarks

1
L. Baptista, and J.P. Marques-Silva, The Interplay of Randomization and Learning on Real-World Instances of Satisfiability, AAAI Workshop on Leveraging Probability and Uncertainty in Computation (AAAI-LPUC), July 2000.  
2
J.P. Marques-Silva, On Selecting Problem Instances for Evaluating Satisfiability Algorithms, ECAI Workshop on Empirical Methods in Artificial Intelligence (ECAI-EMAI), August 2000.  
3
J.P. Marques-Silva, Algebraic Simplification Techniques for Propositional Satisfiability, 6th International Conference on Principles and Practice of Constraint Programming (CP), September 2000.  
4
L. Baptista, and J.P. Marques-Silva, Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability, 6th International Conference on Principles and Practice of Constraint Programming (CP), September 2000.  
5
I. Lynce, L. Baptista, and J.P. Marques-Silva, Stochastic Systematic Search Algorithms for Satisfiability, LICS Workshop on Theory and Applications of Satisfiability Testing (LICS-SAT), June 2001.  
6
G. Janssen, Design of a Pointerless BDD Package, 10th Int'l. Workshop on Logic & Synthesis (IWLS '01), June 2001.  
7
M.W. Moskewicz, C.F. Madigan, Y. Zhao, L. Zhang, and S. Malik, Chaff: Engineering an Efficient SAT Solver, 38th Design Automation Conference (DAC '01), June 2001, pp. 530-535.  
8
L. Baptista, I. Lynce, and J.P. Marques-Silva, Complete Search Restart Strategies for Satisfiability, IJCAI'01 Workshop on Stochastic Search Algorithms (IJCAI-SSA '01), August 2001.  
9
L. Zhang, C.F. Madigan, M.W. Moskewicz, and S. Malik, Efficient Conflict Driven Learning in a Boolean Satisfiability Solver, International Conference on Computer-Aided Design (ICCAD '01), November 2001, pp. 279-285.  
10
D. Wang, E. Clarke, Y. Zhu, J. Kukula, Using Cutwidth to Improve Symbolic Simulation and Boolean Satisfiability, IEEE International High Level Design Validation and Test Workshop (HLDVT '01), November 2001.  
11
I. Lynce, and J.P. Marques-Silva, The Interaction Between Simplification and Search in Propositional Satisfiability, CP'01 Workshop on Modeling and Problem Formulation (Formul '01), November 2001.  
12
E.A. Hirsch, and A. Kojevnikov, Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination, 7th International Conference on Principles and Practice of Constraint Programming (CP '01), November-December 2001.  
13
I. Lynce, and J.P. Marques-Silva, The Puzzling Role of Simplification in Propositional Satisfiability, EPIA'01 Workshop on Constraint Satisfaction and Operational Research Techniques for Problem Solving (EPIA-CSOR), December 2001.  
14
I. Lynce, L. Baptista, and J.P. Marques-Silva, Towards Provably Complete Stochastic Search Algorithms for Satisfiability, 10th Portuguese Conference on Artificial Intelligence (EPIA), December 2001.  
15
S.D. Prestwich, Randomised Backtracking for Weightless Linear Pseudo-Boolean Constraint Problems, 4th International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (CP-AI-OR '02), March 2002.  
16
E. Goldberg, and Y. Novikov, BerkMin: A Fast and Robust Sat-Solver, Design, Automation, and Test in Europe (DATE '02), March 2002, pp. 142-149.  
17
S. Pilarski, and G. Hu, Speeding up SAT for EDA, Design, Automation, and Test in Europe (DATE '02), March 2002, p. 1081.  
18
F. Bacchus, Exploring the Computational Tradeoff of More Reasoning and Less Searching, International Symposium on the Theory and Applications of Satisfiability Testing (SAT '02), May 2002, pp. 7-16.  
19
E.A. Hirsch, and A. Kojevnikov, UnitWalk: A New SAT Solver That Uses Local Search Guided by Unit Clause Elimination, International Symposium on the Theory and Applications of Satisfiability Testing (SAT '02), May 2002, pp. 35-42.  
20
F.A. Aloul, B.D. Sierawski, and K.A. Sakallah, A Tool for Measuring Progress of Backtrack-Search Solvers, International Symposium on the Theory and Applications of Satisfiability Testing (SAT '02), May 2002, pp. 98-105.  
21
I. Lynce, and J. Marques-Silva Efficient Data Structures for Backtrack Search SAT Solvers, International Symposium on the Theory and Applications of Satisfiability Testing (SAT '02), May 2002, pp. 308-315.  
22
F.A. Aloul, A. Ramani, I.L. Markov, and K.A. Sakallah, Solving Difficult SAT Instances in the Presence of Symmetry, International Symposium on the Theory and Applications of Satisfiability Testing (SAT '02), May 2002, pp. 338-345.  
23
S. Pilarski, and G. Hu, SAT with Partial Clauses and Back Leaps, 39th Design Automation Conference (DAC '02), June 2002.  
24
F. Bacchus, Enhancing Davis Putnam with Extended Binary Clause Reasoning, 18th National Conference on Artificial Intelligence (AAAI '02), July-August 2002.  


This page has been accessed times since May 11, 2001.