FLOC 2018: FEDERATED LOGIC CONFERENCE 2018

This page contains an index consisting of author-provided keywords.

A
Artificial Intelligence	MLIC: A MaxSAT-Based framework for learning interpretable classification rules
automatic algorithm configuration	CryptoMiniSat Parameter-Optimization for Solving Cryptographic Instances
B
bobs-only	Stedman and Erin Triples encoded as a SAT Problem
Boolean Satisfiability	Stedman and Erin Triples encoded as a SAT Problem
C
CDCL	Seeking Practical CDCL Insights from Theoretical SAT Benchmarks Divide and Conquer: Towards Faster Pseudo-Boolean Solving
CNF	The Effect of Scrambling CNFs
comparator network	Competitive Sorter-based Encoding of PB-Constraints into SAT
Competition	The Effect of Scrambling CNFs
conflict-driven clause learning	Seeking Practical CDCL Insights from Theoretical SAT Benchmarks
conflict-driven search	Divide and Conquer: Towards Faster Pseudo-Boolean Solving
constraints solver	Competitive Sorter-based Encoding of PB-Constraints into SAT
Crafted benchmarks	Seeking Practical CDCL Insights from Theoretical SAT Benchmarks
cryptographic CNF instances	CryptoMiniSat Parameter-Optimization for Solving Cryptographic Instances
cutting planes	Divide and Conquer: Towards Faster Pseudo-Boolean Solving
D
division	Divide and Conquer: Towards Faster Pseudo-Boolean Solving
DRAT proofs	Two flavors of DRAT
E
Erin	Stedman and Erin Triples encoded as a SAT Problem
Erin Triples	Stedman and Erin Triples encoded as a SAT Problem
Evaluation	Seeking Practical CDCL Insights from Theoretical SAT Benchmarks The Effect of Scrambling CNFs
Experiments	A Problem Meta-Data Library for Research in SAT
H
Hamiltonian cycle	Stedman and Erin Triples encoded as a SAT Problem
I
Interpretable Machine Learning	MLIC: A MaxSAT-Based framework for learning interpretable classification rules
L
LFSR	Stedman and Erin Triples encoded as a SAT Problem
linear algorithm	Local-Style Search in the Linear MaxSAT Algorithm: A Computational Study of Solution-Based Phase Saving
linear-feedback shift register	Stedman and Erin Triples encoded as a SAT Problem
M
MaxSAT	Local-Style Search in the Linear MaxSAT Algorithm: A Computational Study of Solution-Based Phase Saving MLIC: A MaxSAT-Based framework for learning interpretable classification rules
meta-data library	A Problem Meta-Data Library for Research in SAT
O
odd-even network	Competitive Sorter-based Encoding of PB-Constraints into SAT
P
Parallel Processing	Tuning Parallel SAT Solvers
parameter optimization	CryptoMiniSat Parameter-Optimization for Solving Cryptographic Instances
phase saving	Local-Style Search in the Linear MaxSAT Algorithm: A Computational Study of Solution-Based Phase Saving
Portfolio Solver	Tuning Parallel SAT Solvers
problem fingerprinting	A Problem Meta-Data Library for Research in SAT
Proof checking	Two flavors of DRAT
proof complexity	Seeking Practical CDCL Insights from Theoretical SAT Benchmarks
Pseudo-Boolean	Competitive Sorter-based Encoding of PB-Constraints into SAT
Pseudo-Boolean Solving	Divide and Conquer: Towards Faster Pseudo-Boolean Solving
R
resolution	Seeking Practical CDCL Insights from Theoretical SAT Benchmarks Divide and Conquer: Towards Faster Pseudo-Boolean Solving
S
SAT	Local-Style Search in the Linear MaxSAT Algorithm: A Computational Study of Solution-Based Phase Saving Tuning Parallel SAT Solvers The Effect of Scrambling CNFs Competitive Sorter-based Encoding of PB-Constraints into SAT
SAT solver	CryptoMiniSat Parameter-Optimization for Solving Cryptographic Instances
SAT solving	Seeking Practical CDCL Insights from Theoretical SAT Benchmarks Divide and Conquer: Towards Faster Pseudo-Boolean Solving
saturation	Divide and Conquer: Towards Faster Pseudo-Boolean Solving
Scrambling	The Effect of Scrambling CNFs
selection network	Competitive Sorter-based Encoding of PB-Constraints into SAT
solution-based phase saving	Local-Style Search in the Linear MaxSAT Algorithm: A Computational Study of Solution-Based Phase Saving
Stedman	Stedman and Erin Triples encoded as a SAT Problem
Stedman Triples	Stedman and Erin Triples encoded as a SAT Problem
U
Unsatisfiability proof generation	Two flavors of DRAT

Disclaimer | Powered by EasyChair Smart Program