Hierarchies of polynomially solvable satisfiability problems

@article{Pretolani1996HierarchiesOP,
  title={Hierarchies of polynomially solvable satisfiability problems},
  author={Daniele Pretolani},
  journal={Annals of Mathematics and Artificial Intelligence},
  year={1996},
  volume={17},
  pages={339-357}
}
In this paper, we introduce general techniques for extending classes of polynomially solvable SAT instances. We generalize the approach of Gallo and Scutellà, who defined the hierarchy {Γ i }, where Γl corresponds to the Generalized Horn class. We propose a family of polynomial hierarchies, where a polynomial hierarchy {Π i } is a sequence of polynomially solvable classes that cover the whole set of CNF formulas, and such that Π i ∩ Π i+1 fori≥0. Following a different approach, based on a new… CONTINUE READING
Highly Cited
This paper has 28 citations. REVIEW CITATIONS