SAT 2016: 19TH INTERNATIONAL CONFERENCE ON THEORY AND APPLICATIONS OF SATISFIABILITY TESTING

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

A
approximation	Complexity and Approximability for Parameterized MAXCSPs
B
beta-acyclic formulas	Structure-based knowledge compilation: the singular case of $\beta$-acyclic formulas
C
cardinality constraints	CNF Encoding of Cardinality Constraints via Tree-Decomposition
CDCL SAT Solvers	Experiments with CNF Structure and Hardness
Community Structure	Experiments with CNF Structure and Hardness
complex networks	Pseudo-Industrial Random SAT Generators
constraint satisfaction problems	Complexity and Approximability for Parameterized MAXCSPs
D
deficiency	Minimal unsatisfiability and deficiency: recent developments
dependency schemes	Using Decomposition-Parameters for QBF: Mind the Prefix!
E
Empirical Hardness	Experiments with CNF Structure and Hardness
F
full clauses	Minimal unsatisfiability and deficiency: recent developments
I
incidence graph	Complexity and Approximability for Parameterized MAXCSPs
irreducible clause-sets	Minimal unsatisfiability and deficiency: recent developments
K
knowledge compilation	Structure-based knowledge compilation: the singular case of $\beta$-acyclic formulas
M
Max SAT	CNF Encoding of Cardinality Constraints via Tree-Decomposition
minimal unsatisfiability	Minimal unsatisfiability and deficiency: recent developments
P
parameterized complexity	Using Decomposition-Parameters for QBF: Mind the Prefix!
propositional model counting	Structure-based knowledge compilation: the singular case of $\beta$-acyclic formulas
pseudo-industrial instances	Pseudo-Industrial Random SAT Generators
Q
quantified boolean formula	Using Decomposition-Parameters for QBF: Mind the Prefix!
R
random SAT generation	Pseudo-Industrial Random SAT Generators
S
Satisfiability	Using Decomposition-Parameters for QBF: Mind the Prefix!
structural parameterizations	Complexity and Approximability for Parameterized MAXCSPs
structure-based algorithm	Structure-based knowledge compilation: the singular case of $\beta$-acyclic formulas
T
tree-decomposition	CNF Encoding of Cardinality Constraints via Tree-Decomposition
Treewidth	Experiments with CNF Structure and Hardness
treewidth and pathwidth	Using Decomposition-Parameters for QBF: Mind the Prefix!
V
variable degrees	Minimal unsatisfiability and deficiency: recent developments
VSIDS	Experiments with CNF Structure and Hardness

Disclaimer | Powered by EasyChair Smart Program