On planar variants of the monotone satisfiability problem with bounded variable appearances.
Andreas DarmannJanosch DöckerBritta DornPublished in: CoRR (2016)
Keyphrases
- satisfiability problem
- np complete
- finite domain
- search algorithm
- temporal logic
- phase transition
- sat problem
- pspace complete
- stochastic local search algorithms
- sat instances
- stochastic local search
- appearance model
- upper bound
- max sat
- boolean functions
- cellular automata
- reinforcement learning
- decision procedures
- bounded treewidth
- conjunctive normal form