| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Jacobo Torán, Florian Wörz |
Cutting Planes Width and the Complexity of Graph Isomorphism Refutations.  |
SAT  |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Front Matter, Table of Contents, Preface, Conference Organization. |
SAT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Neng-Fa Zhou, Ruiwei Wang, Roland H. C. Yap |
A Comparison of SAT Encodings for Acyclicity of Directed Graphs. |
SAT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Kirchweger, Manfred Scheucher, Stefan Szeider |
SAT-Based Generation of Planar Graphs. |
SAT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Haberlandt, Harrison Green, Marijn J. H. Heule |
Effective Auxiliary Variables via Structured Reencoding. |
SAT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | George Katsirelos |
An Analysis of Core-Guided Maximum Satisfiability Solvers Using Linear Programming. |
SAT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Dror Fried, Alexander Nadel, Yogev Shalmon |
AllSAT for Combinational Circuits. |
SAT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Albert Oliveras, Chunxiao Li 0002, Darryl Wu, Jonathan Chung 0003, Vijay Ganesh |
Learning Shorter Redundant Clauses in SDCL Using MaxSAT. |
SAT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Böhm 0001, Olaf Beyersdorff |
QCDCL vs QBF Resolution: Further Insights. |
SAT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Pedro Orvalho, Vasco M. Manquinho, Ruben Martins |
UpMax: User Partitioning for MaxSAT. |
SAT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Irfansha Shaik, Maximilian Heisinger, Martina Seidl, Jaco van de Pol |
Validation of QBF Encodings with Winning Strategies. |
SAT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Florian Pollitt, Mathias Fleury, Armin Biere |
Faster LRAT Checking Than Solving with CaDiCaL. |
SAT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Randal E. Bryant, Wojciech Nawrocki, Jeremy Avigad, Marijn J. H. Heule |
Certified Knowledge Compilation with Application to Verified Model Counting. |
SAT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Long-Hin Fung, Tony Tan |
On the Complexity of k-DQBF. |
SAT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilario Bonacina, Maria Luisa Bonet, Jordi Levy |
Polynomial Calculus for MaxSAT. |
SAT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Nadel |
Solving Huge Instances with Intel(R) SAT Solver. |
SAT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Tereza Schwarzová, Jan Strejcek, Juraj Major |
Reducing Acceptance Marks in Emerson-Lei Automata by QBF Solving. |
SAT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Katalin Fazekas, Aina Niemetz, Mathias Preiner, Markus Kirchweger, Stefan Szeider, Armin Biere |
IPASIR-UP: User Propagators for CDCL. |
SAT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Junping Zhou, Jiaxin Liang, Minghao Yin, Bo He |
LS-DTKMS: A Local Search Algorithm for Diversified Top-k MaxSAT Problem. |
SAT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Meena Mahajan, Friedrich Slivovsky (eds.) |
26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy |
SAT |
2023 |
DBLP BibTeX RDF |
|
| 1 | Jiong Yang 0002, Arijit Shaw, Teodora Baluta, Mate Soos, Kuldeep S. Meel |
Explaining SAT Solving Using Causal Reasoning. |
SAT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Gabriele Masina, Giuseppe Spallitta, Roberto Sebastiani |
On CNF Conversion for Disjoint SAT Enumeration. |
SAT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Armin Biere, Nils Froleyks, Wenxi Wang |
CadiBack: Extracting Backbones with CaDiCaL. |
SAT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Vinyals, Chunxiao Li 0002, Noah Fleming, Antonina Kolokolova, Vijay Ganesh |
Limits of CDCL Learning via Merge Resolution. |
SAT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Adrián Rebola-Pardo |
Even Shorter Proofs Without New Variables. |
SAT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Plank, Martina Seidl |
QMusExt: A Minimal (Un)satisfiable Core Extractor for Quantified Boolean Formulas. |
SAT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Mengel |
Bounds on BDD-Based Bucket Elimination. |
SAT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Anshujit Sharma, Matthew Burns, Michael C. Huang 0001 |
Combining Cubic Dynamical Solvers with Make/Break Heuristics to Solve SAT. |
SAT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Kirchweger, Tomás Peitl, Stefan Szeider |
A SAT Solver's Opinion on the Erdős-Faber-Lovász Conjecture. |
SAT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Anders, Pascal Schweitzer, Mate Soos |
Algorithms Transcending the SAT-Symmetry Interface. |
SAT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Olaf Beyersdorff, Tim Hoffmann, Luc Nicolas Spachmann |
Proof Complexity of Propositional Model Counting. |
SAT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexis de Colnet |
Separating Incremental and Non-Incremental Bottom-Up Compilation. |
SAT |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Nadel |
Introducing Intel(R) SAT Solver. |
SAT |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Dmitry Itsykson, Artur Riazanov, Petr Smirnov |
Tight Bounds for Tseitin Formulas. |
SAT |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Christoph Jung, Valentin Mayer-Eichberger, Abdallah Saffidine |
QBF Programming with the Modeling Language Bule. |
SAT |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Friedrich Slivovsky |
Quantified CDCL with Universal Resolution. |
SAT |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Meena Mahajan, Gaurav Sood 0001 |
QBF Merge Resolution Is Powerful but Unnatural. |
SAT |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jakob Bach, Markus Iser, Klemens Böhm |
A Comprehensive Study of k-Portfolios of Recent SAT Solvers. |
SAT |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Iván Garzón, Pablo Mesejo, Jesús Giráldez-Cru |
On the Performance of Deep Generative Models of Realistic SAT Instances. |
SAT |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernardo Subercaseaux, Marijn J. H. Heule |
The Packing Chromatic Number of the Infinite Square Grid Is at Least 14. |
SAT |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Gilles Audemard, Jean-Marie Lagniez, Marie Miceli |
A New Exact Solver for (Weighted) Max#SAT. |
SAT |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Böhm 0001, Tomás Peitl, Olaf Beyersdorff |
Should Decisions in QCDCL Follow Prefix Order? |
SAT |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Mengel |
Changing Partitions in Rectangle Decision Lists. |
SAT |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Agnes Schleitzer, Olaf Beyersdorff |
Classes of Hard Formulas for QBF Resolution. |
SAT |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Smirnov 0003, Jeremias Berg, Matti Järvisalo |
Improvements to the Implicit Hitting Set Approach to Pseudo-Boolean Optimization. |
SAT |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Nina Narodytska, Nikolaj S. Bjørner |
Analysis of Core-Guided MaxSat Using Cores and Correction Sets. |
SAT |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Anders |
SAT Preprocessors and Symmetry. |
SAT |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Franz-Xaver Reichl, Friedrich Slivovsky |
Pedant: A Certifying DQBF Solver. |
SAT |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Leroy Chew, Marijn J. H. Heule |
Relating Existing Powerful Proof Systems for QBF. |
SAT |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Miguel Cabral, Mikolás Janota, Vasco M. Manquinho |
SAT-Based Leximax Optimisation Algorithms. |
SAT |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Klaus Fichte, Markus Hecher, Valentin Roland |
Proofs for Propositional Model Counting. |
SAT |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Jabs, Jeremias Berg, Andreas Niskanen, Matti Järvisalo |
MaxSAT-Based Bi-Objective Boolean Optimization. |
SAT |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Hao-Ren Wang, Kuan-Hua Tu, Jie-Hong Roland Jiang, Christoph Scholl 0001 |
Quantifier Elimination in Stochastic Boolean Satisfiability. |
SAT |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, Filip Pokrývka, André Schidler, Kirill Simonov, Stefan Szeider |
Weighted Model Counting with Twin-Width. |
SAT |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Kuldeep S. Meel, Ofer Strichman (eds.) |
25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel. |
SAT |
2022 |
DBLP BibTeX RDF |
|
| 1 | Josep Alos, Carlos Ansótegui, Josep M. Salvia, Eduard Torres |
OptiLog V2: Model, Solve, Tune and Run. |
SAT |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephan Gocht, Ruben Martins, Jakob Nordström, Andy Oertel |
Certified CNF Translations for Pseudo-Boolean Solving. |
SAT |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Milan Mossé, Harry Sha, Li-Yang Tan |
A Generalization of the Satisfiability Coding Lemma and Its Applications. |
SAT |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Niskanen, Jeremias Berg, Matti Järvisalo |
Incremental Maximum Satisfiability. |
SAT |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Front Matter, Table of Contents, Preface, Conference Organization. |
SAT |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Max Bannach, Malte Skambath, Till Tantau |
On the Parallel Parameterized Complexity of MaxSAT Variants. |
SAT |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolás Janota, Jelle Piepenbrock, Bartosz Piotrowski |
Towards Learning Quantifier Instantiation in SMT. |
SAT |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Kirchweger, Manfred Scheucher, Stefan Szeider |
A SAT Attack on Rota's Basis Conjecture. |
SAT |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Lucas Berent, Lukas Burgholzer, Robert Wille |
Towards a SAT Encoding for Quantum Circuits: A Journey From Classical Circuits to Clifford Circuits and Beyond. |
SAT |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Armin Biere, Md. Solimul Chowdhury, Marijn J. H. Heule, Benjamin Kiesl, Michael W. Whalen |
Migrating Solver State. |
SAT |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Miki Hermann, Gernot Salzer |
MCP: Capturing Big Data by Satisfiability (Tool Description). |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Friedrich 0001, Frank Neumann 0001, Ralf Rothenberger, Andrew M. Sutton |
Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Mariusz Lester |
Scheduling Reach Mahjong Tournaments Using Pseudoboolean Constraints. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Pei Huang 0002, Rundong Li, Minghao Liu 0001, Feifei Ma, Jian Zhang 0001 |
Efficient SAT-Based Minimal Model Generation Methods for Modal Logic S5. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Prevot, Mate Soos, Kuldeep S. Meel |
Leveraging GPUs for Effective Clause Sharing in Parallel SAT Solving. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Böhm 0001, Olaf Beyersdorff |
Lower Bounds for QCDCL via Formula Gauge. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhendong Lei, Shaowei Cai 0001, Chuan Luo 0002, Holger H. Hoos |
Efficient Local Search for Pseudo Boolean Optimization. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Henrik E. C. Cao |
Hash-Based Preprocessing and Inprocessing Techniques in SAT Solvers. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Junqiang Peng 0001, Mingyu Xiao 0001 |
A Fast Algorithm for SAT in Terms of Formula Length. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Marijn J. H. Heule |
Chinese Remainder Encoding for Hamiltonian Cycles. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Le Berre, Romain Wallon |
On Dedicated CDCL Strategies for PB Solvers. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthieu Py, Mohamed Sami Cherif, Djamal Habet |
A Proof Builder for Max-SAT. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Mengel, Friedrich Slivovsky |
Proof Complexity of Symbolic QBF Reasoning. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominik Schreiber, Peter Sanders 0001 |
Scalable SAT Solving in the Cloud. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Mathias Fleury, Armin Biere |
Efficient All-UIP Learned Clause Minimization. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Carlos Ansótegui, Josep Pon, Meinolf Sellmann, Kevin Tierney |
PyDGGA: Distributed GGA for Automatic Configuration. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Stepan Kochemazov, Alexey Ignatiev, João Marques-Silva 0001 |
Assessing Progress in SAT Solvers Through the Lens of Incremental SAT. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Paulius Dilkas, Vaishak Belle |
Weighted Model Counting Without Parameter Variables. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Oliver Kullmann, Oleg Zaikin 0002 |
Projection Heuristics for Binary Branchings Between Sum and Product. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeffrey M. Dudek, Vu H. N. Phan, Moshe Y. Vardi |
ProCount: Weighted Projected Model Counting with Graded Project-Join Trees. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexis de Colnet, Stefan Mengel |
Characterizing Tseitin-Formulas with Short Regular Resolution Refutations. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Chu-Min Li, Felip Manyà (eds.) |
Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Carlos Ansótegui, Jesus Ojeda, António Pacheco 0004, Josep Pon, Josep M. Salvia, Eduard Torres |
OptiLog: A Framework for SAT-based Systems. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Wojciech Nawrocki, Zhenjun Liu, Andreas Fröhlich, Marijn J. H. Heule, Armin Biere |
XOR Local Search for Boolean Brent Equations. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexey Ignatiev, João Marques-Silva 0001 |
SAT-Based Rigorous Explanations for Decision Lists. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Shaowei Cai 0001, Xindi Zhang |
Deep Cooperation of CDCL and Local Search for SAT. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Norbert Hundeshagen, Martin Lange, Georg Siebert |
DiMo - Discrete Modelling Using Propositional Logic. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Monika Trimoska, Gilles Dequen, Sorina Ionica |
Logical Cryptanalysis with WDSat. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Juraj Síc, Jan Strejcek |
DQBDD: An Efficient BDD-Based DQBF Solver. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Pimpalkhare, Federico Mora, Elizabeth Polgreen, Sanjit A. Seshia |
MedleySolver: Online SMT Algorithm Selection. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Leroy Chew |
Hardness and Optimality in QBF Proof Systems Modulo NP. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Olaf Beyersdorff, Luca Pulina, Martina Seidl, Ankit Shukla |
QBFFam: A Tool for Generating QBF Families from Proof Complexity. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Joshua Blinkhorn, Tomás Peitl, Friedrich Slivovsky |
Davis and Putnam Meet Henkin: Solving DQBF with Resolution. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Chunxiao Li 0002, Jonathan Chung 0003, Soham Mukherjee, Marc Vinyals, Noah Fleming, Antonina Kolokolova, Alice Mu, Vijay Ganesh |
On the Hierarchical Community Structure of Practical Boolean Formulas. |
SAT |
2021 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license