default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID27th SAT 2024: Pune, India
- Supratik Chakraborty
, Jie-Hong Roland Jiang:
27th International Conference on Theory and Applications of Satisfiability Testing, SAT 2024, Pune, India, August 21-24, 2024. LIPIcs 305, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-334-8 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xviii
- Martina Seidl:
Models and Counter-Models of Quantified Boolean Formulas (Invited Talk). 1:1-1:7 - Cesare Tinelli:
Scalable Proof Production and Checking in SMT (Invited Talk). 2:1-2:2 - Moshe Y. Vardi:
Logical Algorithmics: From Relational Queries to Boolean Reasoning (Invited Talk). 3:1-3:1 - Markus Anders, Sofia Brenner, Gaurav Rattan:
Satsuma: Structure-Based Symmetry Breaking in SAT. 4:1-4:23 - Olaf Beyersdorff, Johannes Klaus Fichte, Markus Hecher, Tim Hoffmann, Kaspar Kasche:
The Relative Strength of #SAT Proof Systems. 5:1-5:19 - Armin Biere, Katalin Fazekas, Mathias Fleury, Nils Froleyks:
Clausal Congruence Closure. 6:1-6:25 - Ilario Bonacina, Maria Luisa Bonet, Massimo Lauria:
MaxSAT Resolution with Inclusion Redundancy. 7:1-7:15 - Yi Chu, Chu-Min Li, Furong Ye, Shaowei Cai:
Enhancing MaxSAT Local Search via a Unified Soft Clause Weighting Scheme. 8:1-8:18 - Robin Coutelier, Mathias Fleury, Laura Kovács:
Lazy Reimplication in Chronological Backtracking. 9:1-9:19 - Yogesh Dahiya, Meena Mahajan, Sasank Mouli:
New Lower Bounds for Polynomial Calculus over Non-Boolean Bases. 10:1-10:20 - Alexis de Colnet:
On the Relative Efficiency of Dynamic and Static Top-Down Compilation to Decision-DNNF. 11:1-11:21 - Daniel Faber, Adalat Jabrayilov, Petra Mutzel:
SAT Encoding of Partial Ordering Models for Graph Coloring Problems. 12:1-12:20 - Dror Fried, Alexander Nadel, Roberto Sebastiani, Yogev Shalmon:
Entailing Generalization Boosts Enumeration. 13:1-13:14 - Vojtech Havlena, Lukás Holík, Ondrej Lengál, Juraj Síc:
Cooking String-Integer Conversions with Noodles. 14:1-14:19 - Lukás Holík, Pavol Vargovcík:
Antichain with SAT and Tries. 15:1-15:24 - Alexey Ignatiev, Zi Li Tan, Christos Karamanos:
Towards Universally Accessible SAT Technology. 16:1-16:11 - Yoichiro Iida, Tomohiro Sonobe, Mary Inaba:
Parallel Clause Sharing Strategy Based on Graph Structure of SAT Problem. 17:1-17:18 - Markus Iser, Christoph Jabs:
Global Benchmark Database. 18:1-18:10 - Dmitry Itsykson, Sergei Ovcharov:
On Limits of Symbolic Approach to SAT Solving. 19:1-19:22 - Leszek Aleksander Kolodziejczyk, Neil Thapen:
The Strength of the Dominance Rule. 20:1-20:22 - Jean-Marie Lagniez, Pierre Marquis, Armin Biere:
Dynamic Blocked Clause Elimination for Projected Model Counting. 21:1-21:17 - Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell, Rui Zhao:
Speeding up Pseudo-Boolean Propagation. 22:1-22:18 - Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider:
eSLIM: Circuit Minimization with SAT Based Local Improvement. 23:1-23:14 - Christoph Scholl, Tobias Seufert, Fabian Siegwolf:
Hierarchical Stochastic SAT and Quality Assessment of Logic Locking. 24:1-24:22 - Dominik Schreiber:
Trusted Scalable SAT Solving with On-The-Fly LRAT Checking. 25:1-25:19 - Irfansha Shaik, Jaco van de Pol:
Optimal Layout Synthesis for Deep Quantum Circuits on NISQ Processors with 100+ Qubits. 26:1-26:18 - Hadar Shavit, Holger H. Hoos:
Revisiting SATZilla Features in 2024. 27:1-27:26 - Friedrich Slivovsky:
Strategy Extraction by Interpolation. 28:1-28:20 - Jiong Yang, Yaroslav A. Kharkov, Yunong Shi, Marijn J. H. Heule, Bruno Dutertre:
Quantum Circuit Mapping Based on Incremental and Parallel SAT Solving. 29:1-29:18 - Jinqiang Yu, Graham Farr, Alexey Ignatiev, Peter J. Stuckey:
Anytime Approximate Formal Feature Attribution. 30:1-30:23 - Tianwei Zhang, Tomás Peitl, Stefan Szeider:
Small Unsatisfiable k-CNFs with Bounded Literal Occurrence. 31:1-31:22
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 2025-12-12 01:07 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:
