Worst Case Bounds for some NP-Complete Modified Horn-SAT Problems.
Stefan PorschenEwald SpeckenmeyerPublished in: SAT (2004)
Keyphrases
- np complete
- sat problem
- np hard
- worst case bounds
- satisfiability problem
- random sat instances
- worst case
- randomly generated
- constraint satisfaction problems
- max sat
- boolean satisfiability
- phase transition
- sat instances
- np complete problems
- sat solving
- propositional satisfiability
- backtracking search
- computational complexity
- polynomial time complexity
- davis putnam
- conjunctive queries
- stochastic local search
- bounded treewidth
- optimal solution
- special case
- evolutionary algorithm
- cnf formula
- search algorithm
- reinforcement learning
- temporal logic
- lower bound
- objective function