Keyword

SAT solving

Description: A computational method for determining whether a Boolean formula can be satisfied by assigning truth values to its variables.

Primary topic: Constraint Satisfaction and Optimization (45%)

Wikidata ID: wiki/Q124734256

OpenAlex ID: keywords/sat-solving

SATO: An efficient propositional prover

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

Handbook of Satisfiability

2021 · Armin Biere, Marijn J. H. Heule, et al. · 486

Constraint Integer Programming

2007 · Achterberg, Tobias · 440

Efficient Solving of Large Non-linear Arithmetic Constraint Systems with Complex Boolean Structure1

2007 · Martin Fränzle, Christian Herde, et al. · Journal on Satisfiability Boolean Modeling and Computation · 307

PDF

sharpSAT – Counting Models with Advanced Component Caching and Implicit BCP

2006 · Marc Thurley · Lecture notes in computer science · 248

Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications

2009 · Armin Biere, Marijn J. H. Heule, et al. · 240

Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer

2016 · Marijn J. H. Heule, Oliver Kullmann, et al. · Lecture notes in computer science · 203

PDF

Cube and Conquer: Guiding CDCL SAT Solvers by Lookaheads

2012 · Marijn J. H. Heule, Oliver Kullmann, et al. · Lecture notes in computer science · 188

Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection

2010 · Lin Xu, Holger Hoos, et al. · Proceedings of the AAAI Conference on Artificial Intelligence · 188

Constraint Integer Programming: A New Approach to Integrate CP and MIP

2008 · Tobias Achterberg, Timo Berthold, et al. · Springer eBooks · 177

Learning a SAT Solver from Single-Bit Supervision

2018 · Selsam, Daniel, Lamm, Matthew, et al. · arXiv (Cornell University) · 176

PDF

An adaptive noise mechanism for walkSAT

2002 · Holger H. Hoos · 175

Theory and Applications of Satisfiability Testing - SAT 2006

2006 · Lecture notes in computer science · 169

Debugging the data plane with anteater

2011 · Haohui Mai, Ahmed Khurshid, et al. · ACM SIGCOMM Computer Communication Review · 167

Inprocessing Rules

2012 · Matti Järvisalo, Marijn J. H. Heule, et al. · Lecture notes in computer science · 159

Circuit-based Boolean Reasoning

2001 · Andreas Kuehlmann, Malay K. Ganai, et al. · Proceedings - ACM IEEE Design Automation Conference · 154

Theory and Applications of Satisfiability Testing – SAT 2007

2007 · Marques-Silva, Joao, Sakallah, Karem A · Lecture notes in computer science · 147

Planning as satisfiability: Heuristics

2012 · Jussi Rintanen · Artificial Intelligence · 140

PDF

Branching rules for satisfiability

1995 · J. N. Hooker, V. Vinay · Journal of Automated Reasoning · 134

MiniMaxSAT: An Efficient Weighted Max-SAT solver

2008 · F. Heras, J. Larrosa, et al. · Journal of Artificial Intelligence Research · 128

PDF

On the Glucose SAT Solver

2018 · Gilles Audemard, Laurent Simon · International Journal of Artificial Intelligence Tools · 126

Effective Preprocessing with Hyper-Resolution and Equality Reduction

2004 · Fahiem Bacchus, Jonathan Winter · Lecture notes in computer science · 125

Some (in)translatability results for normal logic programs and propositional theories

2006 · Tomi Janhunen · Journal of Applied Non-Classical Logics · 112

AutoFolio: An Automatically Configured Algorithm Selector

2015 · Marius Lindauer, Holger H. Hoos, et al. · Journal of Artificial Intelligence Research · 111

PDF

Minimal Assignments for Bounded Model Checking

2004 · Kavita Ravi, Fabio Somenzi · Lecture notes in computer science · 111

Works count: 1,613

Citation count: 15,020