Meta-Resolution: An Algorithmic Formalisation

@article{Fouks1996MetaResolutionAA,
  title={Meta-Resolution: An Algorithmic Formalisation},
  author={Jean-Denis Fouks and Jean-Claude Spehner},
  journal={Theor. Comput. Sci.},
  year={1996},
  volume={166},
  pages={147-172}
}
We study the Tseitin formulae (Tseitin, 1970) on which resolution is known to be inefficient. We first give a new proof of the satisfiability condition and precise the number of solutions if any and otherwise the minimal contradictory subformula. Then, defining a new data structure, we introduce the meta-argument of that proof in the Davis-Putnam and Loveland procedure (Loveland, 1978) and obtain a new algorithm for SAT especially efficient on these formulae. 

Topics from this paper.