SAT2024: INTERNATIONAL CONFERENCE ON THEORY AND APPLICATIONS OF SATISFIABILITY TESTING

A
Anders, Markus	satsuma: Structure-based Symmetry Breaking in SAT
B
Beyersdorff, Olaf	The Relative Strength of #SAT Proof Systems
Biere, Armin	Clausal Congruence Closure Dynamic Blocked Clause Elimination for Projected Model Counting
Bonacina, Ilario	MaxSAT Resolution with Inclusion Redundancy
Bonet, María Luisa	MaxSAT Resolution with Inclusion Redundancy
Brenner, Sofia	satsuma: Structure-based Symmetry Breaking in SAT
C
Cai, Shaowei	Enhancing MaxSAT Local Search via a Unified Soft Clause Weighting Scheme
Chu, Yi	Enhancing MaxSAT Local Search via a Unified Soft Clause Weighting Scheme
Coutelier, Robin	Lazy Reimplication in Chronological Backtracking
D
Dahiya, Yogesh	New lower bounds for Polynomial Calculus over non-Boolean bases
de Colnet, Alexis	On the Relative Efficiency of Dynamic and Static Top-Down Compilation to Decision-DNNF
Dutertre, Bruno	Quantum Circuit Mapping Based on Incremental and Parallel SAT Solving
F
Faber, Daniel	SAT Encoding of Partial Ordering Models for Graph Coloring Problems
Farr, Graham	Anytime Approximate Formal Feature Attribution
Fazekas, Katalin	Clausal Congruence Closure
Fichte, Johannes K.	The Relative Strength of #SAT Proof Systems
Fleury, Mathias	Clausal Congruence Closure Lazy Reimplication in Chronological Backtracking
Fried, Dror	Entailing Generalization Boosts Enumeration
Froleyks, Nils	Clausal Congruence Closure
H
Havlena, Vojtěch	Cooking String-Integer Conversions with Noodles
Hecher, Markus	The Relative Strength of #SAT Proof Systems
Heule, Marijn	Quantum Circuit Mapping Based on Incremental and Parallel SAT Solving
Hoffmann, Tim	The Relative Strength of #SAT Proof Systems
Holík, Lukáš	Antichain with SAT and Tries Cooking String-Integer Conversions with Noodles
Hoos, Holger	Revisiting SATZilla Features in 2024
I
Ignatiev, Alexey	Anytime Approximate Formal Feature Attribution Towards Universally Accessible SAT Technology
Iida, Yoichiro	Parallel Clause Sharing Strategy based on Graph Structure of SAT Problem
Inaba, Mary	Parallel Clause Sharing Strategy based on Graph Structure of SAT Problem
Iser, Markus	Global Benchmark Database
Itsykson, Dmitry	On Limits of Symbolic Approach to SAT Solving
J
Jabrayilov, Adalat	SAT Encoding of Partial Ordering Models for Graph Coloring Problems
Jabs, Christoph	Global Benchmark Database
K
Karamanos, Christos	Towards Universally Accessible SAT Technology
Kasche, Kaspar	The Relative Strength of #SAT Proof Systems
Kharkov, Yaroslav A.	Quantum Circuit Mapping Based on Incremental and Parallel SAT Solving
Kovács, Laura	Lazy Reimplication in Chronological Backtracking
Kołodziejczyk, Leszek Aleksander	The strength of the dominance rule
L
Lagniez, Jean Marie	Dynamic Blocked Clause Elimination for Projected Model Counting
Lauria, Massimo	MaxSAT Resolution with Inclusion Redundancy
Lengal, Ondrej	Cooking String-Integer Conversions with Noodles
Li, Chu-Min	Enhancing MaxSAT Local Search via a Unified Soft Clause Weighting Scheme
M
Mahajan, Meena	New lower bounds for Polynomial Calculus over non-Boolean bases
Marquis, Pierre	Dynamic Blocked Clause Elimination for Projected Model Counting
Mouli, Sasank	New lower bounds for Polynomial Calculus over non-Boolean bases
Mutzel, Petra	SAT Encoding of Partial Ordering Models for Graph Coloring Problems
N
Nadel, Alexander	Entailing Generalization Boosts Enumeration
Nieuwenhuis, Robert	Speeding-up Pseudo-Boolean Propagation
O
Oliveras, Albert	Speeding-up Pseudo-Boolean Propagation
Ovcharov, Sergei	On Limits of Symbolic Approach to SAT Solving
P
Peitl, Tomáš	Small unsatisfiable k-CNFs with bounded literal occurrence
R
Rattan, Gaurav	satsuma: Structure-based Symmetry Breaking in SAT
Reichl, Franz-Xaver	eSLIM: Circuit Minimization with SAT Based Local Improvement
Rodríguez Carbonell, Enric	Speeding-up Pseudo-Boolean Propagation
S
Scholl, Christoph	Hierarchical Stochastic SAT and Quality Assessment of Logic Locking
Schreiber, Dominik	Scalable Trusted SAT Solving with on-the-fly LRAT Checking
Sebastiani, Roberto	Entailing Generalization Boosts Enumeration
Seidl, Martina	Models and Counter-Models of Quantified Boolean Formulas
Seufert, Tobias	Hierarchical Stochastic SAT and Quality Assessment of Logic Locking
Shaik, Irfansha	Optimal Layout Synthesis for Deep Quantum Circuits on NISQ Processors with 100+ Qubits
Shalmon, Yogev	Entailing Generalization Boosts Enumeration
Shavit, Hadar	Revisiting SATZilla Features in 2024
Shi, Yunong	Quantum Circuit Mapping Based on Incremental and Parallel SAT Solving
Siegwolf, Fabian	Hierarchical Stochastic SAT and Quality Assessment of Logic Locking
Slivovsky, Friedrich	Strategy Extraction by Interpolation eSLIM: Circuit Minimization with SAT Based Local Improvement
Sonobe, Tomohiro	Parallel Clause Sharing Strategy based on Graph Structure of SAT Problem
Stuckey, Peter J.	Anytime Approximate Formal Feature Attribution
Szeider, Stefan	Small unsatisfiable k-CNFs with bounded literal occurrence eSLIM: Circuit Minimization with SAT Based Local Improvement
Síč, Juraj	Cooking String-Integer Conversions with Noodles
T
Tan, Zi Li	Towards Universally Accessible SAT Technology
Thapen, Neil	The strength of the dominance rule
Tinelli, Cesare	Scalable Proof Production and Checking in SMT
V
van de Pol, Jaco	Optimal Layout Synthesis for Deep Quantum Circuits on NISQ Processors with 100+ Qubits
Vardi, Moshe	Logical Algorithmics: From Relational Queries to Boolean Reasoning
Vargovčík, Pavol	Antichain with SAT and Tries
Y
Yang, Jiong	Quantum Circuit Mapping Based on Incremental and Parallel SAT Solving
Ye, Furong	Enhancing MaxSAT Local Search via a Unified Soft Clause Weighting Scheme
Yu, Jinqiang	Anytime Approximate Formal Feature Attribution
Z
Zhang, Tianwei	Small unsatisfiable k-CNFs with bounded literal occurrence
Zhao, Rui	Speeding-up Pseudo-Boolean Propagation

Disclaimer | Powered by EasyChair Smart Program