Login / Signup
SAT
2003
2008
2018
2024
2003
2024
Keyphrases
Publications
2024
Ilario Bonacina
,
Maria Luisa Bonet
,
Massimo Lauria
MaxSAT Resolution with Inclusion Redundancy.
SAT
(2024)
Jiong Yang
,
Yaroslav A. Kharkov
,
Yunong Shi
,
Marijn J. H. Heule
,
Bruno Dutertre
Quantum Circuit Mapping Based on Incremental and Parallel SAT Solving.
SAT
(2024)
Yi Chu
,
Chu-Min Li
,
Furong Ye
,
Shaowei Cai
Enhancing MaxSAT Local Search via a Unified Soft Clause Weighting Scheme.
SAT
(2024)
Olaf Beyersdorff
,
Johannes Klaus Fichte
,
Markus Hecher
,
Tim Hoffmann
,
Kaspar Kasche
The Relative Strength of #SAT Proof Systems.
SAT
(2024)
Robert Nieuwenhuis
,
Albert Oliveras
,
Enric Rodríguez-Carbonell
,
Rui Zhao
Speeding up Pseudo-Boolean Propagation.
SAT
(2024)
Dominik Schreiber
Trusted Scalable SAT Solving with On-The-Fly LRAT Checking.
SAT
(2024)
Vojtech Havlena
,
Lukás Holík
,
Ondrej Lengál
,
Juraj Síc
Cooking String-Integer Conversions with Noodles.
SAT
(2024)
Yoichiro Iida
,
Tomohiro Sonobe
,
Mary Inaba
Parallel Clause Sharing Strategy Based on Graph Structure of SAT Problem.
SAT
(2024)
Christoph Scholl
,
Tobias Seufert
,
Fabian Siegwolf
Hierarchical Stochastic SAT and Quality Assessment of Logic Locking.
SAT
(2024)
Dmitry Itsykson
,
Sergei Ovcharov
On Limits of Symbolic Approach to SAT Solving.
SAT
(2024)
Cesare Tinelli
Scalable Proof Production and Checking in SMT (Invited Talk).
SAT
(2024)
Alexey Ignatiev
,
Zi Li Tan
,
Christos Karamanos
Towards Universally Accessible SAT Technology.
SAT
(2024)
Irfansha Shaik
,
Jaco van de Pol
Optimal Layout Synthesis for Deep Quantum Circuits on NISQ Processors with 100+ Qubits.
SAT
(2024)
Jinqiang Yu
,
Graham Farr
,
Alexey Ignatiev
,
Peter J. Stuckey
Anytime Approximate Formal Feature Attribution.
SAT
(2024)
Lukás Holík
,
Pavol Vargovcík
Antichain with SAT and Tries.
SAT
(2024)
Leszek Aleksander Kolodziejczyk
,
Neil Thapen
The Strength of the Dominance Rule.
SAT
(2024)
Moshe Y. Vardi
Logical Algorithmics: From Relational Queries to Boolean Reasoning (Invited Talk).
SAT
(2024)
Hadar Shavit
,
Holger H. Hoos
Revisiting SATZilla Features in 2024.
SAT
(2024)
Daniel Faber
,
Adalat Jabrayilov
,
Petra Mutzel
SAT Encoding of Partial Ordering Models for Graph Coloring Problems.
SAT
(2024)
Robin Coutelier
,
Mathias Fleury
,
Laura Kovács
Lazy Reimplication in Chronological Backtracking.
SAT
(2024)
Martina Seidl
Models and Counter-Models of Quantified Boolean Formulas (Invited Talk).
SAT
(2024)
Markus Anders
,
Sofia Brenner
,
Gaurav Rattan
Satsuma: Structure-Based Symmetry Breaking in SAT.
SAT
(2024)
Yogesh Dahiya
,
Meena Mahajan
,
Sasank Mouli
New Lower Bounds for Polynomial Calculus over Non-Boolean Bases.
SAT
(2024)
Franz-Xaver Reichl
,
Friedrich Slivovsky
,
Stefan Szeider
eSLIM: Circuit Minimization with SAT Based Local Improvement.
SAT
(2024)
Markus Iser
,
Christoph Jabs
Global Benchmark Database.
SAT
(2024)
Armin Biere
,
Katalin Fazekas
,
Mathias Fleury
,
Nils Froleyks
Clausal Congruence Closure.
SAT
(2024)
Alexis de Colnet
On the Relative Efficiency of Dynamic and Static Top-Down Compilation to Decision-DNNF.
SAT
(2024)
Friedrich Slivovsky
Strategy Extraction by Interpolation.
SAT
(2024)
Dror Fried
,
Alexander Nadel
,
Roberto Sebastiani
,
Yogev Shalmon
Entailing Generalization Boosts Enumeration.
SAT
(2024)
Front Matter, Table of Contents, Preface, Conference Organization.
SAT
(2024)
Jean-Marie Lagniez
,
Pierre Marquis
,
Armin Biere
Dynamic Blocked Clause Elimination for Projected Model Counting.
SAT
(2024)
Tianwei Zhang
,
Tomás Peitl
,
Stefan Szeider
Small Unsatisfiable k-CNFs with Bounded Literal Occurrence.
SAT
(2024)
volume 305, 2024
27th International Conference on Theory and Applications of Satisfiability Testing, SAT 2024, August 21-24, 2024, Pune, India
SAT
305 (2024)
2023
Irfansha Shaik
,
Maximilian Heisinger
,
Martina Seidl
,
Jaco van de Pol
Validation of QBF Encodings with Winning Strategies.
SAT
(2023)
Florian Pollitt
,
Mathias Fleury
,
Armin Biere
Faster LRAT Checking Than Solving with CaDiCaL.
SAT
(2023)
Albert Oliveras
,
Chunxiao Li
,
Darryl Wu
,
Jonathan Chung
,
Vijay Ganesh
Learning Shorter Redundant Clauses in SDCL Using MaxSAT.
SAT
(2023)
Benjamin Böhm
,
Olaf Beyersdorff
QCDCL vs QBF Resolution: Further Insights.
SAT
(2023)
Pedro Orvalho
,
Vasco M. Manquinho
,
Ruben Martins
UpMax: User Partitioning for MaxSAT.
SAT
(2023)
Randal E. Bryant
,
Wojciech Nawrocki
,
Jeremy Avigad
,
Marijn J. H. Heule
Certified Knowledge Compilation with Application to Verified Model Counting.
SAT
(2023)
Dror Fried
,
Alexander Nadel
,
Yogev Shalmon
AllSAT for Combinational Circuits.
SAT
(2023)
Neng-Fa Zhou
,
Ruiwei Wang
,
Roland H. C. Yap
A Comparison of SAT Encodings for Acyclicity of Directed Graphs.
SAT
(2023)
Markus Kirchweger
,
Manfred Scheucher
,
Stefan Szeider
SAT-Based Generation of Planar Graphs.
SAT
(2023)
Front Matter, Table of Contents, Preface, Conference Organization.
SAT
(2023)
Andrew Haberlandt
,
Harrison Green
,
Marijn J. H. Heule
Effective Auxiliary Variables via Structured Reencoding.
SAT
(2023)
Jacobo Torán
,
Florian Wörz
Cutting Planes Width and the Complexity of Graph Isomorphism Refutations.
SAT
(2023)
Alexis de Colnet
Separating Incremental and Non-Incremental Bottom-Up Compilation.
SAT
(2023)
Long-Hin Fung
,
Tony Tan
On the Complexity of k-DQBF.
SAT
(2023)
Ilario Bonacina
,
Maria Luisa Bonet
,
Jordi Levy
Polynomial Calculus for MaxSAT.
SAT
(2023)
George Katsirelos
An Analysis of Core-Guided Maximum Satisfiability Solvers Using Linear Programming.
SAT
(2023)
volume 271, 2023
26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy
SAT
271 (2023)