default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID24th SAT 2021: Barcelona, Spain
- Chu-Min Li
, Felip Manyà:
Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings. Lecture Notes in Computer Science 12831, Springer 2021, ISBN 978-3-030-80222-6 - Carlos Ansótegui, Jesus Ojeda, António Pacheco, Josep Pon, Josep M. Salvia, Eduard Torres:
OptiLog: A Framework for SAT-based Systems. 1-10 - Carlos Ansótegui, Josep Pon, Meinolf Sellmann, Kevin Tierney:
PyDGGA: Distributed GGA for Automatic Configuration. 11-20 - Olaf Beyersdorff, Luca Pulina, Martina Seidl, Ankit Shukla:
QBFFam: A Tool for Generating QBF Families from Proof Complexity. 21-29 - Joshua Blinkhorn, Tomás Peitl, Friedrich Slivovsky:
Davis and Putnam Meet Henkin: Solving DQBF with Resolution. 30-46 - Benjamin Böhm, Olaf Beyersdorff:
Lower Bounds for QCDCL via Formula Gauge. 47-63 - Shaowei Cai, Xindi Zhang:
Deep Cooperation of CDCL and Local Search for SAT. 64-81 - Henrik E. C. Cao:
Hash-Based Preprocessing and Inprocessing Techniques in SAT Solvers. 82-97 - Leroy Chew:
Hardness and Optimality in QBF Proof Systems Modulo NP. 98-115 - Alexis de Colnet, Stefan Mengel:
Characterizing Tseitin-Formulas with Short Regular Resolution Refutations. 116-133 - Paulius Dilkas, Vaishak Belle:
Weighted Model Counting Without Parameter Variables. 134-151 - Jeffrey M. Dudek, Vu H. N. Phan, Moshe Y. Vardi:
ProCount: Weighted Projected Model Counting with Graded Project-Join Trees. 152-170 - Mathias Fleury, Armin Biere:
Efficient All-UIP Learned Clause Minimization. 171-187 - Tobias Friedrich, Frank Neumann, Ralf Rothenberger, Andrew M. Sutton:
Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily. 188-206 - Miki Hermann, Gernot Salzer:
MCP: Capturing Big Data by Satisfiability (Tool Description). 207-215 - Marijn J. H. Heule:
Chinese Remainder Encoding for Hamiltonian Cycles. 216-224 - Pei Huang, Rundong Li, Minghao Liu, Feifei Ma, Jian Zhang:
Efficient SAT-Based Minimal Model Generation Methods for Modal Logic S5. 225-241 - Norbert Hundeshagen, Martin Lange, Georg Siebert:
DiMo - Discrete Modelling Using Propositional Logic. 242-250 - Alexey Ignatiev, João Marques-Silva:
SAT-Based Rigorous Explanations for Decision Lists. 251-269 - Jiwei Jin, Yiqi Lv, Cunjing Ge, Feifei Ma, Jian Zhang:
Investigating the Existence of Costas Latin Squares via Satisfiability Testing. 270-279 - Stepan Kochemazov, Alexey Ignatiev, João Marques-Silva:
Assessing Progress in SAT Solvers Through the Lens of Incremental SAT. 280-298 - Oliver Kullmann, Oleg Zaikin:
Projection Heuristics for Binary Branchings Between Sum and Product. 299-314 - Daniel Le Berre, Romain Wallon:
On Dedicated CDCL Strategies for PB Solvers. 315-331 - Zhendong Lei, Shaowei Cai, Chuan Luo, Holger H. Hoos:
Efficient Local Search for Pseudo Boolean Optimization. 332-348 - Martin Mariusz Lester:
Scheduling Reach Mahjong Tournaments Using Pseudoboolean Constraints. 349-358 - Chunxiao Li, Jonathan Chung, Soham Mukherjee, Marc Vinyals, Noah Fleming, Antonina Kolokolova, Alice Mu, Vijay Ganesh:
On the Hierarchical Community Structure of Practical Boolean Formulas. 359-376 - Makai Mann, Amalee Wilson, Yoni Zohar, Lindsey Stuntz, Ahmed Irfan, Kristopher Brown, Caleb Donovick, Allison Guman, Cesare Tinelli, Clark W. Barrett:
Smt-Switch: A Solver-Agnostic C++ API for SMT Solving. 377-386 - Norbert Manthey:
The MergeSat Solver. 387-398 - Stefan Mengel, Friedrich Slivovsky:
Proof Complexity of Symbolic QBF Reasoning. 399-416 - Wojciech Nawrocki, Zhenjun Liu, Andreas Fröhlich, Marijn J. H. Heule, Armin Biere:
XOR Local Search for Boolean Brent Equations. 417-435 - Junqiang Peng, Mingyu Xiao:
A Fast Algorithm for SAT in Terms of Formula Length. 436-452 - Nikhil Pimpalkhare, Federico Mora, Elizabeth Polgreen, Sanjit A. Seshia:
MedleySolver: Online SMT Algorithm Selection. 453-470 - Nicolas Prevot, Mate Soos, Kuldeep S. Meel:
Leveraging GPUs for Effective Clause Sharing in Parallel SAT Solving. 471-487 - Matthieu Py, Mohamed Sami Cherif, Djamal Habet:
A Proof Builder for Max-SAT. 488-498 - Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider:
Certified DQBF Solving by Definition Extraction. 499-517 - Dominik Schreiber, Peter Sanders:
Scalable SAT Solving in the Cloud. 518-534 - Juraj Síc, Jan Strejcek:
DQBDD: An Efficient BDD-Based DQBF Solver. 535-544 - Monika Trimoska, Gilles Dequen, Sorina Ionica:
Logical Cryptanalysis with WDSat. 545-561
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 2026-08-09 22:55 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
