Regular resolution for CNF of bounded incidence treewidth with few long clauses.
Andrea CalìIgor RazgonPublished in: CoRR (2019)
Keyphrases
- clause learning
- bounded treewidth
- boolean functions
- consequence finding
- search space
- sat solvers
- np complete
- cnf formula
- conjunctive normal form
- satisfiability problem
- unit propagation
- upper bound
- sat solving
- propositional satisfiability
- boolean formula
- sat problem
- disjunctive normal form
- polynomial size
- constraint satisfaction
- space complexity
- max sat
- learning algorithm
- theorem proving
- first order logic
- search algorithm
- bayesian networks