On the Approximability of Splitting-SAT in 2-CNF Horn Formulas.
Hans-Joachim BöckenhauerLucia KellerPublished in: IWOCA (2013)
Keyphrases
- horn formulas
- knowledge compilation
- model counting
- cnf formula
- sat solvers
- sat solving
- propositional satisfiability
- sat problem
- polynomial size
- sat instances
- normal form
- prime implicates
- conjunctive normal form
- stochastic local search
- boolean satisfiability
- search algorithm
- boolean formula
- orders of magnitude
- search strategies
- max sat
- boolean functions
- satisfiability problem
- knowledge based systems