Skip to Content.
Sympa Menu

coq-club - Re: [Coq-Club] Formalization of SAT solver-related problems?

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

Re: [Coq-Club] Formalization of SAT solver-related problems?


Chronological Thread 
  • From: Chantal Keller <chantal.keller AT wanadoo.fr>
  • To: Bradford Larsen <brad.larsen AT gmail.com>
  • Cc: coq-club AT inria.fr
  • Subject: Re: [Coq-Club] Formalization of SAT solver-related problems?
  • Date: Thu, 05 Dec 2013 10:50:42 +0100

Dear Brad,

I just want to point out the SMTCoq ongoing work
<http://cs.au.dk/~chkeller/Recherche/smtcoq.html> aiming at verifying
SAT and SMT proof witnesses inside Coq. Basic tactics are written on top
of it. Experiments show that the possibly exponential proof witnesses do
not produce a blow up when checking them compared to finding them.

It includes CNF-conversion checking in the Tseitin style. It could
indeed be a good idea to provide a top-level tactic just doing this
conversion, independently from external SAT and SMT solvers.

Best,
Chantal KELLER.



Archive powered by MHonArc 2.6.18.

Top of Page