SAT 2023: 26TH INTERNATIONAL CONFERENCE ON THEORY AND APPLICATIONS OF SATISFIABILITY TESTING

A
Anders, Markus	Algorithms Transcending the SAT-Symmetry Interface
Atserias, Albert	Algorithmic Complexity of Certified Unsatisfiability
Avigad, Jeremy	Certified Knowledge Compilation with Application to Verified Model Counting
B
Baluta, Teodora	Explaining SAT Solving Using Causal Reasoning
Beyersdorff, Olaf	QCDCL vs QBF Resolution: Further Insights Proof Complexity of Propositional Model Counting
Biere, Armin	Faster LRAT Checking than Solving with CaDiCaL CadiBack: Extracting Backbones with CaDiCaL IPASIR-UP: User Propagators for CDCL
Bonacina, Ilario	Polynomial Calculus for MaxSAT
Bonet, María-Luisa	Polynomial Calculus for MaxSAT
Bryant, Randal	Certified Knowledge Compilation with Application to Verified Model Counting
Burns, Matthew	Combining Cubic Dynamical Solvers with Make/Break Heuristics to Solve SAT
Böhm, Benjamin	QCDCL vs QBF Resolution: Further Insights
C
Chung, Jonathan	Learning Shorter Redundant Clauses in SDCL Using MaxSAT
D
de Colnet, Alexis	Separating Incremental and Non-Incremental Bottom-Up Compilation
F
Fazekas, Katalin	IPASIR-UP: User Propagators for CDCL
Fleming, Noah	Limits of CDCL Learning via Merge Resolution
Fleury, Mathias	Faster LRAT Checking than Solving with CaDiCaL
Fried, Dror	AllSAT for Combinational Circuits
Froleyks, Nils	CadiBack: Extracting Backbones with CaDiCaL
Fung, Long-Hin	On the complexity of k-DQBF
G
Ganesh, Vijay	Learning Shorter Redundant Clauses in SDCL Using MaxSAT Limits of CDCL Learning via Merge Resolution
Green, Harrison	Effective Auxiliary Variables via Structured Reencoding
H
Haberlandt, Andrew	Effective Auxiliary Variables via Structured Reencoding
He, Bo	LS-DTKMS: A Local Search Algorithm for Diversified Top-k MaxSAT Problem
Heisinger, Maximilian	Validation of QBF Encodings with Winning Strategies
Heule, Marijn	Certified Knowledge Compilation with Application to Verified Model Counting Effective Auxiliary Variables via Structured Reencoding
Hoffmann, Tim	Proof Complexity of Propositional Model Counting
Huang, Michael	Combining Cubic Dynamical Solvers with Make/Break Heuristics to Solve SAT
K
Katsirelos, George	An Analysis of Core-guided Maximum Satisfiability Solvers Using Linear Programming
Kirchweger, Markus	SAT-Based Generation of Planar Graphs A SAT Solver’s Opinion on the Erdős-Faber-Lovász Conjecture IPASIR-UP: User Propagators for CDCL
Kolokolova, Antonina	Limits of CDCL Learning via Merge Resolution
L
Levy, Jordi	Polynomial Calculus for MaxSAT
Li, Chunxiao	Learning Shorter Redundant Clauses in SDCL Using MaxSAT Limits of CDCL Learning via Merge Resolution
Liang, Jiaxin	LS-DTKMS: A Local Search Algorithm for Diversified Top-k MaxSAT Problem
M
Major, Juraj	Reducing Acceptance Marks in Emerson-Lei Automata by QBF Solving
Manquinho, Vasco	UpMax: User partitioning for MaxSAT
Martins, Ruben	UpMax: User partitioning for MaxSAT
Masina, Gabriele	On CNF Conversion for Disjoint SAT Enumeration
Meel, Kuldeep S.	Explaining SAT Solving Using Causal Reasoning
Mengel, Stefan	Bounds on BDD-Based Bucket Elimination
N
Nadel, Alexander	Solving Huge Instances with Intel(R) SAT Solver AllSAT for Combinational Circuits
Nawrocki, Wojciech	Certified Knowledge Compilation with Application to Verified Model Counting
Niemetz, Aina	IPASIR-UP: User Propagators for CDCL
O
Oliveras, Albert	Learning Shorter Redundant Clauses in SDCL Using MaxSAT
Orvalho, Pedro	UpMax: User partitioning for MaxSAT
P
Peitl, Tomáš	A SAT Solver’s Opinion on the Erdős-Faber-Lovász Conjecture
Plank, Andreas	QMusExt: A Minimal (Un)satisfiable Core Extractor for Quantified Boolean Formulas
Pollitt, Florian	Faster LRAT Checking than Solving with CaDiCaL
Preiner, Mathias	IPASIR-UP: User Propagators for CDCL
R
Rebola Pardo, Adrian	Even shorter proofs without new variables
S
Scheucher, Manfred	SAT-Based Generation of Planar Graphs
Schwarzová, Tereza	Reducing Acceptance Marks in Emerson-Lei Automata by QBF Solving
Schweitzer, Pascal	Algorithms Transcending the SAT-Symmetry Interface
Sebastiani, Roberto	On CNF Conversion for Disjoint SAT Enumeration
Seidl, Martina	Validation of QBF Encodings with Winning Strategies QMusExt: A Minimal (Un)satisfiable Core Extractor for Quantified Boolean Formulas
Shaik, Irfansha	Validation of QBF Encodings with Winning Strategies
Shalmon, Yogev	AllSAT for Combinational Circuits
Sharma, Anshujit	Combining Cubic Dynamical Solvers with Make/Break Heuristics to Solve SAT
Shaw, Arijit	Explaining SAT Solving Using Causal Reasoning
Soos, Mate	Explaining SAT Solving Using Causal Reasoning Algorithms Transcending the SAT-Symmetry Interface
Spachmann, Luc Nicolas	Proof Complexity of Propositional Model Counting
Spallitta, Giuseppe	On CNF Conversion for Disjoint SAT Enumeration
Strejček, Jan	Reducing Acceptance Marks in Emerson-Lei Automata by QBF Solving
Szeider, Stefan	SAT-Based Generation of Planar Graphs A SAT Solver’s Opinion on the Erdős-Faber-Lovász Conjecture IPASIR-UP: User Propagators for CDCL
T
Tan, Tony	On the complexity of k-DQBF
Torán, Jacobo	Cutting Planes Width and the Complexity of Graph Isomorphism Refutations
V
van de Pol, Jaco	Validation of QBF Encodings with Winning Strategies
Vinyals, Marc	Limits of CDCL Learning via Merge Resolution
W
Wang, Ruiwei	A Comparison of SAT Encodings for Acyclicity of Directed Graphs
Wang, Wenxi	CadiBack: Extracting Backbones with CaDiCaL
Williams, Ryan	Around the Fine-Grained Complexity of SAT
Wu, Darryl	Learning Shorter Redundant Clauses in SDCL Using MaxSAT
Wörz, Florian	Cutting Planes Width and the Complexity of Graph Isomorphism Refutations
Y
Yang, Jiong	Explaining SAT Solving Using Causal Reasoning
Yap, Roland	A Comparison of SAT Encodings for Acyclicity of Directed Graphs
Yin, Minghao	LS-DTKMS: A Local Search Algorithm for Diversified Top-k MaxSAT Problem
Z
Zhou, Junping	LS-DTKMS: A Local Search Algorithm for Diversified Top-k MaxSAT Problem
Zhou, Neng-Fa	A Comparison of SAT Encodings for Acyclicity of Directed Graphs

Disclaimer | Powered by EasyChair Smart Program