default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHandbook of Satisfiability 2021
- Armin Biere, Marijn Heule, Hans van Maaren, Toby Walsh:
Handbook of Satisfiability - Second Edition. Frontiers in Artificial Intelligence and Applications 336, IOS Press 2021, ISBN 978-1-64368-160-3 - John Franco, John Martin:
A History of Satisfiability. 3-74 - Steven D. Prestwich:
CNF Encodings. 75-100 - Adnan Darwiche, Knot Pipatsrisawat:
Complete Algorithms. 101-132 - João Marques-Silva, Inês Lynce, Sharad Malik
:
Conflict-Driven Clause Learning SAT Solvers. 133-182 - Marijn J. H. Heule, Hans van Maaren:
Look-Ahead Based SAT Solvers. 183-212 - Henry A. Kautz, Ashish Sabharwal, Bart Selman:
Incomplete Algorithms. 213-232 - Sam Buss, Jakob Nordström:
Proof Complexity and SAT Solving. 233-350 - Oliver Kullmann:
Fundaments of Branching Heuristics. 351-390 - Armin Biere, Matti Järvisalo, Benjamin Kiesl:
Preprocessing in SAT Solving. 391-435 - Dimitris Achlioptas:
Random Satisfiabiliy. 437-462 - Carla P. Gomes, Ashish Sabharwal:
Exploiting Runtime Variation in Complete Solvers. 463-480 - Holger H. Hoos, Frank Hutter, Kevin Leyton-Brown:
Automated Configuration and Selection of SAT Solvers. 481-507 - Karem A. Sakallah:
Symmetry and Satisfiability. 509-570 - Hans Kleine Büning, Oliver Kullmann:
Minimal Unsatisfiability and Autarkies. 571-633 - Marijn J. H. Heule:
Proofs of Unsatisfiability. 635-668 - Evgeny Dantsin, Edward A. Hirsch:
Worst-Case Upper Bounds. 669-692 - Marko Samer, Stefan Szeider:
Fixed-Parameter Tractability. 693-736 - Armin Biere:
Bounded Model Checking. 739-764 - Jussi Rintanen:
Planning and SAT. 765-789 - Daniel Kroening:
Software Verification. 791-818 - Hantao Zhang:
Combinatorial Designs by SAT Solvers. 819-858 - Fabrizio Altarelli, Rémi Monasson, Guilhem Semerjian, Francesco Zamponi:
Connections to Statistical Physics. 859-901 - Chu Min Li, Felip Manyà:
MaxSAT, Hard and Soft Constraints. 903-927 - Fahiem Bacchus, Matti Järvisalo, Ruben Martins:
Maximum Satisfiability. 929-991 - Carla P. Gomes, Ashish Sabharwal, Bart Selman:
Model Counting. 993-1014 - Supratik Chakraborty, Kuldeep S. Meel, Moshe Y. Vardi:
Approximate Model Counting. 1015-1045 - Rolf Drechsler, Tommi A. Junttila, Ilkka Niemelä:
Non-Clausal SAT and ATPG. 1047-1086 - Olivier Roussel, Vasco Manquinho:
Pseudo-Boolean and Cardinality Constraints. 1087-1129 - Hans Kleine Büning, Uwe Bubeck:
Theory of Quantified Boolean Formulas. 1131-1156 - Enrico Giunchiglia, Paolo Marin, Massimo Narizzano:
Reasoning with Quantified Boolean Formulas. 1157-1176 - Olaf Beyersdorff, Mikolás Janota, Florian Lonsing, Martina Seidl:
Quantified Boolean Formulas. 1177-1221 - Roberto Sebastiani, Armando Tacchella:
SAT Techniques for Modal and Description Logics. 1223-1266 - Clark W. Barrett, Roberto Sebastiani, Sanjit A. Seshia, Cesare Tinelli:
Satisfiability Modulo Theories. 1267-1329 - Stephen M. Majercik:
Stochastic Boolean Satisfiability. 1331-1369
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-22 19:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
