H. Luckhardt

Learn More
We investigate algorithms deciding propositional tautologies for DNF and coNP{complete subclasses given by restrictions on the number of occurrences of literals. Especially polynomial use of resolution for reductions in combination with a new combinatorial principle called \Generalized Sign Principle" is studied. Upper bounds on time complexity are given(More)
We investigate polynomial reductions and eecient branching rules for algorithms deciding propositional tautologies for DNF and coNP{complete subclasses. Upper bounds on the time complexity are given with exponential part 2 (F) where (F) is one of the measures n(F) = #f variables g, `(F) = #f literal occurrences g and k(F) = #f clauses g. We start with a(More)
  • 1