Abstract is missing.
- Trusted Scalable SAT Solving with On-The-Fly LRAT CheckingDominik Schreiber 0001. [doi]
- Global Benchmark DatabaseMarkus Iser, Christoph Jabs. [doi]
- Optimal Layout Synthesis for Deep Quantum Circuits on NISQ Processors with 100+ QubitsIrfansha Shaik, Jaco van de Pol. [doi]
- Satsuma: Structure-Based Symmetry Breaking in SATMarkus Anders, Sofia Brenner, Gaurav Rattan. [doi]
- Enhancing MaxSAT Local Search via a Unified Soft Clause Weighting SchemeYi Chu, Chu Min Li, Furong Ye, Shaowei Cai 0001. [doi]
- Parallel Clause Sharing Strategy Based on Graph Structure of SAT ProblemYoichiro Iida, Tomohiro Sonobe, Mary Inaba. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- Strategy Extraction by InterpolationFriedrich Slivovsky. [doi]
- Clausal Congruence ClosureArmin Biere, Katalin Fazekas, Mathias Fleury, Nils Froleyks. [doi]
- SAT Encoding of Partial Ordering Models for Graph Coloring ProblemsDaniel Faber, Adalat Jabrayilov, Petra Mutzel. [doi]
- On Limits of Symbolic Approach to SAT SolvingDmitry Itsykson, Sergei Ovcharov. [doi]
- On the Relative Efficiency of Dynamic and Static Top-Down Compilation to Decision-DNNFAlexis de Colnet. [doi]
- The Strength of the Dominance RuleLeszek Aleksander Kolodziejczyk, Neil Thapen. [doi]
- Revisiting SATZilla Features in 2024Hadar Shavit, Holger H. Hoos. [doi]
- Dynamic Blocked Clause Elimination for Projected Model CountingJean-Marie Lagniez, Pierre Marquis, Armin Biere. [doi]
- Scalable Proof Production and Checking in SMT (Invited Talk)Cesare Tinelli. [doi]
- Entailing Generalization Boosts EnumerationDror Fried, Alexander Nadel, Roberto Sebastiani, Yogev Shalmon. [doi]
- Antichain with SAT and TriesLukás Holík, Pavol Vargovcík. [doi]
- Small Unsatisfiable k-CNFs with Bounded Literal OccurrenceTianwei Zhang, Tomás Peitl, Stefan Szeider. [doi]
- Logical Algorithmics: From Relational Queries to Boolean Reasoning (Invited Talk)Moshe Y. Vardi. [doi]
- Anytime Approximate Formal Feature AttributionJinqiang Yu, Graham Farr, Alexey Ignatiev, Peter J. Stuckey. [doi]
- MaxSAT Resolution with Inclusion RedundancyIlario Bonacina, Maria Luisa Bonet, Massimo Lauria. [doi]
- Towards Universally Accessible SAT TechnologyAlexey Ignatiev, Zi Li Tan, Christos Karamanos. [doi]
- Models and Counter-Models of Quantified Boolean Formulas (Invited Talk)Martina Seidl. [doi]
- New Lower Bounds for Polynomial Calculus over Non-Boolean BasesYogesh Dahiya, Meena Mahajan, Sasank Mouli. [doi]
- Hierarchical Stochastic SAT and Quality Assessment of Logic LockingChristoph Scholl 0001, Tobias Seufert, Fabian Siegwolf. [doi]
- eSLIM: Circuit Minimization with SAT Based Local ImprovementFranz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider. [doi]
- The Relative Strength of #SAT Proof SystemsOlaf Beyersdorff, Johannes Klaus Fichte, Markus Hecher, Tim Hoffmann, Kaspar Kasche. [doi]
- Lazy Reimplication in Chronological BacktrackingRobin Coutelier, Mathias Fleury, Laura Kovács. [doi]
- Cooking String-Integer Conversions with NoodlesVojtech Havlena, Lukás Holík, Ondrej Lengál, Juraj Síc. [doi]
- Speeding up Pseudo-Boolean PropagationRobert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell, Rui Zhao. [doi]
- Quantum Circuit Mapping Based on Incremental and Parallel SAT SolvingJiong Yang 0002, Yaroslav A. Kharkov, Yunong Shi, Marijn J. H. Heule, Bruno Dutertre. [doi]