Positive Planar Satisfiability Problems under 3-Connectivity Constraints.
Md. Manzurul HasanDebajyoti MondalMd. Saidur RahmanPublished in: CoRR (2021)
Keyphrases
- scheduling problem
- satisfiability problem
- graph coloring problems
- finite domain
- np complete
- phase transition
- search algorithm
- temporal logic
- constraint satisfaction
- stochastic local search algorithms
- stochastic local search
- constraint programming
- sat problem
- pspace complete
- davis putnam
- optimization problems
- mazurkiewicz traces
- constraint solving
- max sat
- combinatorial problems