FLOC 2022: FEDERATED LOGIC CONFERENCE 2022

A
Alos, Josep	OptiLog v2: Model, Solve, Tune And Run
Anders, Markus	SAT Preprocessors and Symmetry
Ansótegui, Carlos	OptiLog v2: Model, Solve, Tune And Run
Audemard, Gilles	A New Exact Solver for (Weighted) Max#SAT
B
Bach, Jakob	A Comprehensive Study of k-Portfolios of Recent SAT Solvers
Bannach, Max	On the Parallel Parameterized Complexity of MaxSAT Variants
Berent, Lucas	Towards a SAT Encoding for Quantum Circuits
Berg, Jeremias	25 years of SAT: Maximum Satisfiability for Real-World Optimization Improvements to the Implicit Hitting Set Approach to Pseudo-Boolean Optimization MaxSAT-Based Bi-Objective Boolean Optimization Incremental Maximum Satisfiability
Beyersdorff, Olaf	Classes of Hard Formulas for QBF Resolution Should decisions in QCDCL follow prefix order? 25 years of SAT: Proof complexity and SAT solving
Biere, Armin	Migrating Solver State
Biere, Armin	25 years of SAT: Trusting SAT Solvers
Bjørner, Nikolaj	Analysis of Core-Guided MaxSAT Using Cores and Correction Sets
Bryant, Randal	(BDD event)
Burgholzer, Lukas	Towards a SAT Encoding for Quantum Circuits
Böhm, Benjamin	Should decisions in QCDCL follow prefix order?
Böhm, Klemens	A Comprehensive Study of k-Portfolios of Recent SAT Solvers
C
Cabral, Miguel	SAT-based Leximax Optimisation Algorithms
Chew, Leroy	Relating existing powerful proof systems for QBF
Chowdhury, Md Solimul	Migrating Solver State
Competitions, Awards And	Awards / Competition Results - I (with Live Broadcast)
F
Fichte, Johannes K.	Proofs for Propositional Model Counting
G
Ganian, Robert	Weighted Model Counting with Twin-Width
Garzón, Iván	On the performance of deep generative models of realistic SAT instances
Giráldez-Cru, Jesús	On the performance of deep generative models of realistic SAT instances
Gocht, Stephan	Certified CNF Translations for Pseudo-Boolean Solving
H
Hecher, Markus	Proofs for Propositional Model Counting
Heule, Marijn	Relating existing powerful proof systems for QBF 25 years of SAT: Modern SAT Techniques / Remembering Hans van Maaren The packing chromatic number of the infinite square grid is at least 14 Migrating Solver State
I
Iser, Markus	A Comprehensive Study of k-Portfolios of Recent SAT Solvers
Itsykson, Dmitry	Tight Bounds for Tseitin Formulas
J
Jabs, Christoph	MaxSAT-Based Bi-Objective Boolean Optimization
Janota, Mikolas	Towards Learning Quantifier Instantiation in SMT SAT-based Leximax Optimisation Algorithms
Jiang, Jie-Hong Roland	Quantifier Elimination in Stochastic Boolean Satisfiability
Jung, Jean Christoph	QBF Programming with the Modeling Language Bule
Järvisalo, Matti	Improvements to the Implicit Hitting Set Approach to Pseudo-Boolean Optimization MaxSAT-Based Bi-Objective Boolean Optimization Awards and Competition - II (with Live Broadcast) Incremental Maximum Satisfiability
K
Kiesl, Benjamin	Migrating Solver State
Kirchweger, Markus	A SAT Attack on Rota's Basis Conjecture
L
Lagniez, Jean Marie	A New Exact Solver for (Weighted) Max#SAT
M
Mahajan, Meena	QBF Merge Resolution is powerful but unnatural
Manquinho, Vasco	SAT-based Leximax Optimisation Algorithms
Martins, Ruben	Certified CNF Translations for Pseudo-Boolean Solving
Mayer-Eichberger, Valentin	QBF Programming with the Modeling Language Bule
Mengel, Stefan	Changing Partitions in Rectangle Decision Lists
Mesejo, Pablo	On the performance of deep generative models of realistic SAT instances
Miceli, Marie	A New Exact Solver for (Weighted) Max#SAT
Mosse, Milan	A generalization of the Satisfiability Coding Lemma and its applications
N
Nadel, Alexander	25 years of SAT: Conflict-Driven SAT Solving Introducing Intel(R) SAT Solver
Narodytska, Nina	Analysis of Core-Guided MaxSAT Using Cores and Correction Sets
Niskanen, Andreas	MaxSAT-Based Bi-Objective Boolean Optimization Incremental Maximum Satisfiability
Nordström, Jakob	Certified CNF Translations for Pseudo-Boolean Solving
O
Oertel, Andy	Certified CNF Translations for Pseudo-Boolean Solving
P
Peitl, Tomáš	Should decisions in QCDCL follow prefix order?
Piepenbrock, Jelle	Towards Learning Quantifier Instantiation in SMT
Piotrowski, Bartosz	Towards Learning Quantifier Instantiation in SMT
Pokrývka, Filip	Weighted Model Counting with Twin-Width
R
Reichl, Franz-Xaver	Pedant: A Certifying DQBF Solver
Riazanov, Artur	Tight Bounds for Tseitin Formulas
Roland, Valentin	Proofs for Propositional Model Counting
S
Saffidine, Abdallah	QBF Programming with the Modeling Language Bule
Salvia, Josep Maria	OptiLog v2: Model, Solve, Tune And Run
Scheucher, Manfred	A SAT Attack on Rota's Basis Conjecture
Schidler, André	Weighted Model Counting with Twin-Width
Schleitzer, Agnes	Classes of Hard Formulas for QBF Resolution
Scholl, Christoph	Quantifier Elimination in Stochastic Boolean Satisfiability
Sha, Harry	A generalization of the Satisfiability Coding Lemma and its applications
Simonov, Kirill	Weighted Model Counting with Twin-Width
Skambath, Malte	On the Parallel Parameterized Complexity of MaxSAT Variants
Slivovsky, Friedrich	Quantified CDCL with Universal Resolution Pedant: A Certifying DQBF Solver
Smirnov, Pavel	Improvements to the Implicit Hitting Set Approach to Pseudo-Boolean Optimization
Smirnov, Petr	Tight Bounds for Tseitin Formulas
Sood, Gaurav	QBF Merge Resolution is powerful but unnatural
Subercaseaux, Bernardo	The packing chromatic number of the infinite square grid is at least 14
Szeider, Stefan	A SAT Attack on Rota's Basis Conjecture Weighted Model Counting with Twin-Width
T
Tan, Li-Yang	A generalization of the Satisfiability Coding Lemma and its applications
Tantau, Till	On the Parallel Parameterized Complexity of MaxSAT Variants
Torres Montiel, Eduard	OptiLog v2: Model, Solve, Tune And Run
Tu, Kuan-Hua	Quantifier Elimination in Stochastic Boolean Satisfiability
W
Wang, Hao-Ren	Quantifier Elimination in Stochastic Boolean Satisfiability
Whalen, Michael	Migrating Solver State
Wille, Robert	Towards a SAT Encoding for Quantum Circuits

Disclaimer | Powered by EasyChair Smart Program