SAT2024: INTERNATIONAL CONFERENCE ON THEORY AND APPLICATIONS OF SATISFIABILITY TESTING
TALK KEYWORD INDEX

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

#
#SAT
(
(k s)-SAT
A
Algorithms
AllSAT
AllSAT-CT
alternating automata
antichain
B
Bandwidth Coloring Problem
Benchmark Metadata
Benchmarking
Binary Decision Diagrams
binary pigeonhole principle
blocked clause elimination
boolean satisfiability
Branch-and-bound
C
CDCL
Certification
Chronological Backtracking
Circuit Minimization
Clause Learning
Combinational Equivalence Checking
Congruence Closure
Conjunctive Normal Form
D
Data-driven Empirical Research
Decision Procedure
Decision-DNNF Circuits
Distributed algorithms
Domain-wise Evaluation
dominance
DRAT
E
Enumeration
error-correcting codes
Exact Synthesis
Expansion
Experimental Evaluation
Explainable AI
Extension variables
F
feature extraction
Finite fields
Formal Feature Attribution
Fourier basis
G
Generalization
Graph Coloring Problem
Graph Theory
H
Hall
Hardware Equivalence Checking
Hierarchical Stochastic SAT
HPC
I
Implementation-level details
Incremental solving
Instance Features
Integer Linear Programming
Interpolation
K
k-CNF
Knowledge Compilation
L
Layout Synthesis
Lazy Reimplication
Local Search Method
Logic
Lower Bounds
M
MaxSAT
MaxSAT resolution
Minimal Unsatisfiable Subsets
minimally unsatisfiable formulas
Model Counting
MUS Enumeration
O
OBDD
P
Parallel Plans
Parallel solving
Parallel strategy
Parity principle
Pigeonhole principle
Polynomial Calculus
Practical Applicability
practical graph isomorphism
Prime implicants
projected model counting
Proof complexity
Proof generation
Proof Systems
Proofs
propositional logic
Propositional Satisfiability
Prototyping
Pseudo-Boolean Solving
PySAT
Python
Q
QBF
Quantified Boolean Formula
Quantum Circuits
Quantum compilation
Quantum computing
Qubit Mapping and Routing
R
Redundancy
Relational queries
running time prediction
S
SAT
SAT Encoding
SAT Solvers
SAT solving
SAT Sweeping
Satisfiability
Satisfiability modulo theories
satisfiability prediction
Satisfiability Solving
SLIM
SMT solving
Solution Counting
Solution Extraction
Stochastic Boolean Satisfiability
Strategy Extraction
string conversions
string solving
Structural Hashing
Structure of SAT
Symbolic quantifier elimination
symmetry breaking
symmetry detection
symmetry exploitation
T
Top-down compilation
Transpiling
tree-like resolution
trie
V
Variable selection heuristics
W
Weighted Partial MaxSAT
Weighting Scheme