Keyword

SAT solvers

Description: Computer programs that determine whether a Boolean formula can be satisfied, used in automated reasoning, verification, and constraint solving.

Primary topic: Constraint Satisfaction and Optimization (42%)

Wikidata ID: wiki/Q21055608

OpenAlex ID: keywords/sat-solvers

Chaff

2001 · Matthew W. Moskewicz, Conor F. Madigan, et al. · Proceedings - ACM IEEE Design Automation Conference · 2,941

An Extensible SAT-solver

2004 · Niklas Eén, Niklas Sörensson · Lecture notes in computer science · 2,629

Handbook of Satisfiability

2021 · Frontiers in artificial intelligence and applications · 1,039

Bounded Model Checking

2003 · Armin Biere, Alessandro Cimatti, et al. · Advances in computers · 951

ParamILS: An Automatic Algorithm Configuration Framework

2009 · F. Hutter, H. H. Hoos, et al. · Journal of Artificial Intelligence Research · 883

PDF

SATzilla: Portfolio-based Algorithm Selection for SAT

2008 · L. Xu, F. Hutter, et al. · Journal of Artificial Intelligence Research · 857

PDF

GRASP - A New Search Algorithm for Satisfiability

1996 · Joso L Marques Silva · 850

Submodular Function Maximization

2014 · Andreas Krause, Daniel Golovin · Cambridge University Press eBooks · 751

Checking Safety Properties Using Induction and a SAT-Solver

2000 · Mary Sheeran, Satnam Singh, et al. · Lecture notes in computer science · 721

Efficient Conflict Driven Learning in a Boolean Satisfiability Solver

2001 · Lintao Zhang, Conor F. Madigan, et al. · 658

Logic in Computer Science

2004 · Michael Huth, Mark Ryan · Cambridge University Press eBooks · 634

Translating Pseudo-Boolean Constraints into SAT

2006 · Niklas Eén, Niklas Sörensson · Journal on Satisfiability Boolean Modeling and Computation · 587

PDF

SATO: An efficient propositional prover

1997 · Hantao Zhang · Lecture notes in computer science · 516

Local search strategies for satisfiability testing

1996 · Bart Selman, Henry Kautz, et al. · DIMACS series in discrete mathematics and theoretical computer science · 516

Extending SAT Solvers to Cryptographic Problems

2009 · Mate Soos, Karsten Nohl, et al. · Lecture notes in computer science · 484

Predicting learnt clauses quality in modern SAT solvers

2009 · Gilles Audemard, Laurent Simon · 480

The Sat4j library, release 2.2

2010 · Daniel Le Berre, Anne Parrain · Journal on Satisfiability Boolean Modeling and Computation · 455

PDF

GRASP-A new search algorithm for satisfiability

2002 · J.P. Marques Silva, K.A. Sakallah · International Conference on Computer Aided Design · 400

BerkMin: A fast and robust SAT-solver

2003 · E. Goldberg, Y. Novikov · Design, Automation, and Test in Europe · 334

Conflict-Driven Clause Learning SAT Solvers

2009 · Marques-Silva Joao, Lynce Ines, et al. · Frontiers in artificial intelligence and applications · 324

What is answer set programming

2008 · Vladimir Lifschitz · National Conference on Artificial Intelligence · 320

S.P.L.O.T.

2009 · Marcilio Mendonca, Moises Branco, et al. · 308

SATLIB: An Online Resource for Research on SAT

2000 · Holger H. Hoos, Thomas Stützle, et al. · 305

A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms

2009 · Carlos Ansótegui, Meinolf Sellmann, et al. · Lecture notes in computer science · 304

Towards Understanding and Harnessing the Potential of Clause Learning

2004 · P. Beame, H. Kautz, et al. · Journal of Artificial Intelligence Research · 285

PDF

Works count: 3,142

Citation count: 50,210