FLOC 2018: FEDERATED LOGIC CONFERENCE 2018
SAT PROCEEDINGS: KEYWORD INDEX
2
2-CNF
A
artificial intelligence
B
backdoor
backtracking
Betweenness Centrality
binarized neural network
Binary Analysis
black-box optimization
C
CAMUS
Cardinality Constraint
cardinality encodings
CDCL
cdcl-cuttingplanes
Centrality
certificates
Chronological Backtracking
circuit
Combinatorial benchmarks
Compilers
Complexity measures
Conflict-driven search
Core SAT
Counterexample-guided Algorithms
Crafted benchmarks
Curry-Howard correspondence
Cutting planes
D
Deficiency
E
experimental analysis
F
Filter
G
Games
I
ic3
Invariants
IRM-calc
Isomorphism type
L
long-distance resolution
M
Machine Learning
MARCO
MaxSAT
MAXSAT application
Minimal unsatisfiability
Minimally strongly connected digraph
Model Counting
model sampling
Multi-Pass Dynamic Programming
N
non-cnf
nonlinear integer arithmetic
novel applications domains
O
Open-WBO
optimal propagation
Optimization Modulo Bit-Vectors
P
Parameterized Algorithms
parameterized complexity
PDR
perfect samplers
power-law
problem encodings and reformulations
Projected Model Counting
proof complexity
propositional logic
prototyping
Pseudo-Boolean Solving
python
Q
Q-Resolution
QBF
QBF calculi
quantified boolean formula
Quantified Boolean Formulas
R
random parity equations
random SAT
Randomized algorithms
Resolution
Restart
S
SAT
SAT encoding
SAT Solver
SAT solvers
SAT solving
SAT-based Optimization
Sat4j
satisfiability threshold
semantics
Separations
Set Membership
sharpness
Singular DP-reduction
Size
SMT
Space
strategies
Symmetries
Symmetry Breaking
T
toolkit
Totalizer
Tree Decompositions
treewidth
Tseitin formulas
U
unit propagation
Unweighted Partial MaxSAT
V
validation
Verification
W
Weighted MaxSAT
witness generation
X
XORSAT