default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID26th SAT 2023: Alghero, Italy
- Meena Mahajan
, Friedrich Slivovsky:
26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy. LIPIcs 271, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-286-0 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:18
- Markus Anders, Pascal Schweitzer, Mate Soos:
Algorithms Transcending the SAT-Symmetry Interface. 1:1-1:21 - Olaf Beyersdorff, Tim Hoffmann, Luc Nicolas Spachmann:
Proof Complexity of Propositional Model Counting. 2:1-2:18 - Armin Biere, Nils Froleyks, Wenxi Wang:
CadiBack: Extracting Backbones with CaDiCaL. 3:1-3:12 - Benjamin Böhm, Olaf Beyersdorff:
QCDCL vs QBF Resolution: Further Insights. 4:1-4:17 - Ilario Bonacina, Maria Luisa Bonet, Jordi Levy:
Polynomial Calculus for MaxSAT. 5:1-5:17 - Randal E. Bryant, Wojciech Nawrocki, Jeremy Avigad, Marijn J. H. Heule:
Certified Knowledge Compilation with Application to Verified Model Counting. 6:1-6:20 - Alexis de Colnet:
Separating Incremental and Non-Incremental Bottom-Up Compilation. 7:1-7:20 - Katalin Fazekas, Aina Niemetz, Mathias Preiner, Markus Kirchweger, Stefan Szeider, Armin Biere:
IPASIR-UP: User Propagators for CDCL. 8:1-8:13 - Dror Fried, Alexander Nadel, Yogev Shalmon:
AllSAT for Combinational Circuits. 9:1-9:18 - Long-Hin Fung, Tony Tan:
On the Complexity of k-DQBF. 10:1-10:15 - Andrew Haberlandt, Harrison Green, Marijn J. H. Heule:
Effective Auxiliary Variables via Structured Reencoding. 11:1-11:19 - George Katsirelos:
An Analysis of Core-Guided Maximum Satisfiability Solvers Using Linear Programming. 12:1-12:19 - Markus Kirchweger, Tomás Peitl, Stefan Szeider:
A SAT Solver's Opinion on the Erdős-Faber-Lovász Conjecture. 13:1-13:17 - Markus Kirchweger, Manfred Scheucher, Stefan Szeider:
SAT-Based Generation of Planar Graphs. 14:1-14:18 - Gabriele Masina, Giuseppe Spallitta, Roberto Sebastiani:
On CNF Conversion for Disjoint SAT Enumeration. 15:1-15:16 - Stefan Mengel:
Bounds on BDD-Based Bucket Elimination. 16:1-16:11 - Alexander Nadel:
Solving Huge Instances with Intel(R) SAT Solver. 17:1-17:12 - Albert Oliveras, Chunxiao Li, Darryl Wu, Jonathan Chung, Vijay Ganesh:
Learning Shorter Redundant Clauses in SDCL Using MaxSAT. 18:1-18:17 - Pedro Orvalho, Vasco Manquinho, Ruben Martins:
UpMax: User Partitioning for MaxSAT. 19:1-19:13 - Andreas Plank, Martina Seidl:
QMusExt: A Minimal (Un)satisfiable Core Extractor for Quantified Boolean Formulas. 20:1-20:10 - Florian Pollitt, Mathias Fleury, Armin Biere:
Faster LRAT Checking Than Solving with CaDiCaL. 21:1-21:12 - Adrián Rebola-Pardo:
Even Shorter Proofs Without New Variables. 22:1-22:20 - Tereza Schwarzová, Jan Strejcek, Juraj Major:
Reducing Acceptance Marks in Emerson-Lei Automata by QBF Solving. 23:1-23:20 - Irfansha Shaik, Maximilian Heisinger, Martina Seidl, Jaco van de Pol:
Validation of QBF Encodings with Winning Strategies. 24:1-24:10 - Anshujit Sharma, Matthew Burns, Michael C. Huang:
Combining Cubic Dynamical Solvers with Make/Break Heuristics to Solve SAT. 25:1-25:21 - Jacobo Torán, Florian Wörz:
Cutting Planes Width and the Complexity of Graph Isomorphism Refutations. 26:1-26:20 - Marc Vinyals, Chunxiao Li, Noah Fleming, Antonina Kolokolova, Vijay Ganesh:
Limits of CDCL Learning via Merge Resolution. 27:1-27:19 - Jiong Yang, Arijit Shaw, Teodora Baluta, Mate Soos, Kuldeep S. Meel:
Explaining SAT Solving Using Causal Reasoning. 28:1-28:19 - Junping Zhou, Jiaxin Liang, Minghao Yin, Bo He:
LS-DTKMS: A Local Search Algorithm for Diversified Top-k MaxSAT Problem. 29:1-29:16 - Neng-Fa Zhou, Ruiwei Wang, Roland H. C. Yap:
A Comparison of SAT Encodings for Acyclicity of Directed Graphs. 30:1-30:9
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-28 20:35 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:
