A Dichotomy Theorem for the Inverse Satisfiability Problem.
Victor LagerkvistBiman RoyPublished in: FSTTCS (2017)
Keyphrases
- satisfiability problem
- search algorithm
- np complete
- temporal logic
- phase transition
- sat problem
- pspace complete
- stochastic local search algorithms
- solving hard
- stochastic local search
- sat instances
- model checking
- max sat
- finite domain
- np hard
- cellular automata
- decision procedures
- modal logic
- constraint satisfaction
- state space
- weighted max sat
- presburger arithmetic
- mazurkiewicz traces