A GRASP for the Minimum Cost SAT Problem.
Giovanni FeliciDaniele FeronePaola FestaAntonio NapoletanoTommaso PastorePublished in: LION (2017)
Keyphrases
- minimum cost
- sat problem
- np hard
- np complete
- satisfiability problem
- constraint satisfaction problems
- sat solvers
- phase transition
- network flow
- max sat
- randomly generated
- approximation algorithms
- network flow problem
- capacity constraints
- sat instances
- boolean satisfiability
- spanning tree
- propositional satisfiability
- decision problems
- random sat instances
- davis putnam
- stochastic local search
- network simplex algorithm
- tabu search
- optimal solution
- linear programming
- temporal logic
- worst case
- branch and bound
- scheduling problem
- special case
- maximum satisfiability
- constraint satisfaction
- constraint programming
- orders of magnitude
- information retrieval systems
- branch and bound algorithm
- upper bound
- boolean formula
- integer programming
- minimum cost flow
- random sat
- reinforcement learning
- genetic algorithm