Improving Coq Propositional Reasoning Using a Lazy CNF Conversion Scheme

@inproceedings{Lescuyer2009ImprovingCP,
  title={Improving Coq Propositional Reasoning Using a Lazy CNF Conversion Scheme},
  author={St{\'e}phane Lescuyer and Sylvain Conchon},
  booktitle={FroCoS},
  year={2009}
}
In an attempt to improve automation capabilities in the Coq proof assistant, we develop a tactic for the propositional fragment based on the DPLL procedure. Although formulas naturally arising in interactive proofs do not require a state-of-the-art SAT solver, the conversion to clausal form required by DPLL strongly damages the performance of the procedure. In this paper, we present a reflexive DPLL algorithm formalized in Coq which outperforms the existing tactics. It is tightly coupled with a… CONTINUE READING
Highly Cited
This paper has 21 citations. REVIEW CITATIONS