CNF Satisfiability in a Subspace and Related Problems.
Vikraman ArvindVenkatesan GuruswamiPublished in: CoRR (2021)
Keyphrases
- related problems
- cnf formula
- conjunctive normal form
- sat solving
- satisfiability problem
- boolean formula
- np complete
- sat problem
- sat instances
- boolean functions
- stochastic local search
- knowledge compilation
- high dimensional
- propositional satisfiability
- computational complexity
- high dimensional data
- low dimensional
- propositional logic
- principal component analysis
- subspace learning
- range searching
- subspace clustering
- structured databases
- propositional formulas
- principal components
- max sat
- stable marriage
- practical problems
- feature space
- clause learning
- phase transition
- sat solvers
- broadly applicable
- feature extraction
- linear subspace
- lower dimensional
- dimensionality reduction
- knowledge base
- model counting
- terminological reasoning