The state of SAT

Authors:
Henry Kautz;Bart Selman
Affiliations:
Department of Computer Science, University of Washington, Seattle, WA 98195, USA;Department of Computer Science, Cornell University, Ithaca, NY 14853, USA
Venue:
Discrete Applied Mathematics
Year:
2007

Citing 63
Cited 13

Diagnostic reasoning based on structure and behavior

Artificial Intelligence - Special volume on qualitative reasoning about physical systems
Short proofs for tricky formulas

Acta Informatica
Diagnosing multiple faults

Artificial Intelligence
Many hard examples for resolution

Journal of the ACM (JACM)
Symbolic model checking: 1020 states and beyond

Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Optimal speedup of Las Vegas algorithms

Information Processing Letters
Easy problems are sometimes hard

Artificial Intelligence
Phase transitions and the search problem

Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
GRASP—a new search algorithm for satisfiability

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Constraint tightness and looseness versus local and global consistency

Journal of the ACM (JACM)
Learning evaluation functions for global optimization and Boolean satisfiability

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Supermodels and robustness

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Boosting combinatorial search through randomization

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
On the run-time behaviour of stochastic local search algorithms for SAT

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Trap escaping strategies in discrete Lagrangian methods for solving hard satisfiability and maximum satisfiability problems

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
The symmetry rule in propositional logic

Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
A machine program for theorem-proving

Communications of the ACM
Effective use of boolean satisfiability procedures in the formal verification of superscalar and VLIW

Proceedings of the 38th annual Design Automation Conference
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
The scaling window of the 2-SAT transition

Random Structures & Algorithms
A sharp threshold in proof complexity

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Statistical mechanics methods and phase transitions in optimizationproblems

Theoretical Computer Science - Phase transitions in combinatorial problems
Rigorous results for random (2 + p)-SAT

Theoretical Computer Science - Phase transitions in combinatorial problems
Bounded Model Checking Using Satisfiability Solving

Formal Methods in System Design
Symbolic Model Checking

Symbolic Model Checking
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems

SIAM Journal on Computing
Boosting complete techniques thanks to local search methods

Annals of Mathematics and Artificial Intelligence
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems

Journal of Automated Reasoning
A Discrete Lagrangian-Based Global-SearchMethod for Solving Satisfiability Problems

Journal of Global Optimization
Efficient conflict driven learning in a boolean satisfiability solver

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Computational Experience with an Interior Point Algorithm on the Satisfiability Problem

Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference
Using Walk-SAT and Rel-Sat for Cryptographic Key Search

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Unifying SAT-based and Graph-based Planning

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Search in a Small World

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
A Bayesian Approach to Tackling Hard Computational Problems

UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Generating Satisfiable Problem Instances

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Formal Models of Heavy-Tailed Behavior in Combinatorial Search

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Accelerating Random Walks

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
A Hybrid Approach for SAT

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Recovering and Exploiting Structural Knowledge from CNF Formulas

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Restart Policies with Dependence among Runs: A Dynamic Programming Approach

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
SATO: An Efficient Propositional Prover

CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Local Search Characteristics of Incomplete SAT Procedures

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Integrating Equivalency Reasoning into Davis-Putnam Procedure

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Generic ILP versus specialized 0-1 ILP: an update

Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Satisfiability Coding Lemma

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
BerkMin: A Fast and Robust Sat-Solver

Proceedings of the conference on Design, automation and test in Europe
Automatic SAT-compilation of planning problems

IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
When gravity fails: local search topology

Journal of Artificial Intelligence Research
Ten challenges in propositional reasoning and search

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Efficient symmetry breaking for boolean satisfiability

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Backdoors to typical case complexity

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Understanding the power of clause learning

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A backbone-search heuristic for efficient solving of hard 3-SAT formulae

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
A simplifier for propositional formulas with many binary clauses

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Pushing the envelope: planning, propositional logic, and stochastic search

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Using CSP look-back techniques to solve real-world SAT instances

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Problem structure in the presence of perturbations

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Solving linear pseudo-Boolean constraint problems with local search

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
A two-phase algorithm for solving a class of hard satisfiability problemsfn1fn1Supported by the Dutch Organization for Scientific Research (NWO) under grant SION 612-33-001.

Operations Research Letters
Resolution vs. cutting plane solution of inference problems: Some computational experience

Operations Research Letters

Towards an optimal separation of space and length in resolution

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Justification-Based Local Search with Adaptive Noise Strategies

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
On the refutational completeness of signed binary resolution and hyperresolution

Fuzzy Sets and Systems
Justification-Based Non-Clausal Local Search for SAT

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Structure-based satisfiability checking: Analyzing and harnessing the potential

AI Communications
Constraint acquisition for Entity-Relationship models

Data & Knowledge Engineering
Exploiting inference rules to compute lower bounds for MAX-SAT solving

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Efficient SAT Techniques for Relative Encoding of Permutations with Constraints

AI '09 Proceedings of the 22nd Australasian Joint Conference on Advances in Artificial Intelligence
On the structure of industrial SAT instances

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
A modular CNF-based SAT solver

SBCCI '10 Proceedings of the 23rd symposium on Integrated circuits and system design
A study of heuristic guesses for adiabatic quantum computation

Quantum Information Processing
The Quadrupel --A Model for Automating Intermediary Selection in Supply Chain Management

Proceedings of the 2011 conference on Information Modelling and Knowledge Bases XXII
Depth-driven circuit-level stochastic local search for SAT

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One

Quantified Score

Hi-index	0.04

Visualization

Abstract

The papers in this special issue originated at SAT 2001, the Fourth International Symposium on the Theory and Applications of Satisfiability Testing. This foreword reviews the current state of satisfiability testing and places the papers in this issue in context.