Minimization of Visibly Pushdown Automata Using Partial Max-SAT.
Matthias HeizmannChristian SchillingDaniel TischnerPublished in: CoRR (2017)
Keyphrases
- max sat
- weighted max sat
- lower bound
- branch and bound algorithm
- search algorithm
- sat solvers
- tabu search
- satisfiability problem
- linear programming
- branch and bound
- sat problem
- objective function
- boolean satisfiability
- maximum satisfiability
- max sat solver
- variable ordering
- constraint satisfaction
- cellular automata
- finite state
- np hard
- search space
- orders of magnitude
- special case
- finite automata
- stochastic local search
- integer programming
- unsatisfiable cores