Polarity and Variable Selection Heuristics for SAT-Based Anytime MaxSAT.
Alexander NadelPublished in: J. Satisf. Boolean Model. Comput. (2020)
Keyphrases
- sat solvers
- boolean satisfiability
- sentiment analysis
- orders of magnitude
- maximum satisfiability
- search space
- sat instances
- sentiment classification
- sat problem
- constraint satisfaction
- constraint solver
- answer set programming
- max sat
- sat encodings
- polarity classification
- upper bound
- positive or negative
- combinatorial optimization
- randomly generated
- probabilistic planning
- version space
- answer sets
- symmetry breaking
- boolean formula
- search strategies
- bounded model checking
- branch and bound algorithm
- opinion mining
- integer linear programming
- boolean functions
- natural language processing