The state of SAT
From MaRDI portal
Publication:2643296
DOI10.1016/j.dam.2006.10.004zbMath1121.68108OpenAlexW2081692349MaRDI QIDQ2643296
Publication date: 23 August 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2006.10.004
Related Items (8)
Unnamed Item ⋮ Accelerating a continuous-time analog SAT solver using GPUs ⋮ A study of heuristic guesses for adiabatic quantum computation ⋮ A taxonomy of exact methods for partial Max-SAT ⋮ Popularity-similarity random SAT formulas ⋮ Solving SAT in a distributed cloud: a portfolio approach ⋮ Voting by eliminating quantifiers ⋮ On the refutational completeness of signed binary resolution and hyperresolution
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Near optimal seperation of tree-like and general resolution
- Optimal speedup of Las Vegas algorithms
- Computational experience with an interior point algorithm on the satisfiability problem
- Short proofs for tricky formulas
- Dynamic symmetry-breaking for Boolean satisfiability
- The intractability of resolution
- Resolution vs. cutting plane solution of inference problems: Some computational experience
- Diagnosing multiple faults
- Symbolic model checking: \(10^{20}\) states and beyond
- Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
- Boosting complete techniques thanks to local search methods
- A two-phase algorithm for solving a class of hard satisfiability problems
- Easy problems are sometimes hard
- A discrete Lagrangian-based global-search method for solving satisfiability problems
- On the limit of branching rules for hard random unsatisfiable 3-SAT
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
- UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
- The symmetry rule in propositional logic
- Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
- BerkMin: A fast and robust SAT-solver
- Phase transitions and the search problem
- On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems
- The scaling window of the 2-SAT transition
- Formula Caching in DPLL
- Many hard examples for resolution
- The relative efficiency of propositional proof systems
- Sharp thresholds of graph properties, and the $k$-sat problem
- Constraint tightness and looseness versus local and global consistency
- A sharp threshold in proof complexity
- SATO: An efficient propositional prover
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Determining computational complexity from characteristic ‘phase transitions’
- Interpolants and Symbolic Model Checking
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- Bounded model checking using satisfiability solving
- Local search characteristics of incomplete SAT procedures
- Statistical mechanics methods and phase transitions in optimization problems
- Rigorous results for random (\(2+p)\)-SAT
This page was built for publication: The state of SAT
