CNF Satisfiability in a Subspace and Related Problems.
Vikraman ArvindVenkatesan GuruswamiPublished in: Algorithmica (2022)
Keyphrases
- related problems
- cnf formula
- conjunctive normal form
- sat solving
- np complete
- satisfiability problem
- sat problem
- boolean formula
- sat instances
- low dimensional
- subspace learning
- sat solvers
- linear subspace
- propositional logic
- satisfiability testing
- dimensionality reduction
- high dimensional
- broadly applicable
- stochastic local search
- model counting
- stable marriage
- principal component analysis
- range searching
- feature space
- knowledge compilation
- boolean functions
- lower dimensional
- phase transition
- propositional satisfiability
- subspace clustering
- max sat
- computational complexity
- randomly generated
- sat encodings
- polynomial size
- propositional formulas
- boolean satisfiability
- temporal logic
- high dimensional data
- subspace clusters
- terminological reasoning