Positive planar satisfiability problems under 3-connectivity constraints.
Md. Manzurul HasanDebajyoti MondalMd. Saidur RahmanPublished in: Theor. Comput. Sci. (2022)
Keyphrases
- satisfiability problem
- finite domain
- np complete
- phase transition
- search algorithm
- temporal logic
- constraint satisfaction
- sat problem
- solving hard
- objective function
- sat instances
- max sat
- combinatorial problems
- stochastic local search algorithms
- constraint programming
- davis putnam
- conjunctive normal form
- mazurkiewicz traces
- pspace complete
- constraint solver
- constraint solving
- stochastic local search
- global constraints
- constraint propagation
- modal logic
- optimal solution