Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas.
K. SubramaniPiotr J. WojciechowskiPublished in: Ann. Math. Artif. Intell. (2022)
Keyphrases
- exact algorithms
- max sat
- cnf formula
- lower bound
- search algorithm
- sat solvers
- sat problem
- branch and bound algorithm
- tabu search
- branch and bound
- satisfiability problem
- constraint satisfaction
- linear programming
- knapsack problem
- conjunctive normal form
- approximation algorithms
- theorem proving
- exact solution
- multi objective
- combinatorial optimization problems
- combinatorial optimization
- orders of magnitude
- np complete
- upper bound
- propositional satisfiability
- propositional formulas