A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SAT.
Victor LagerkvistBiman RoyPublished in: MFCS (2016)
Keyphrases
- satisfiability problem
- preliminary investigation
- np complete
- sat problem
- stochastic local search algorithms
- stochastic local search
- search algorithm
- sat instances
- solving hard
- temporal logic
- np hard
- pspace complete
- phase transition
- randomly generated
- computational complexity
- constraint satisfaction problems
- max sat
- davis putnam
- model checking
- finite domain
- search space
- knowledge base