Minimization of Visibly Pushdown Automata Using Partial Max-SAT.
Matthias HeizmannChristian SchillingDaniel TischnerPublished in: TACAS (1) (2017)
Keyphrases
- max sat
- weighted max sat
- lower bound
- sat solvers
- search algorithm
- tabu search
- branch and bound algorithm
- branch and bound
- satisfiability problem
- sat problem
- cellular automata
- model checking
- maximum satisfiability
- finite state
- stochastic local search
- objective function
- constraint satisfaction
- unsatisfiable cores
- boolean satisfiability
- finite automata
- max sat solver
- upper bound
- linear programming
- np complete
- cnf formula
- orders of magnitude
- np hard
- search strategies
- random sat instances