13
$\begingroup$

Is there any web-based course or materials about logic / automatic theorem proving? (I checked MIT's OpenCourseWare and I only found a vaguely related AI course)

$\endgroup$
7
$\begingroup$

There are basically two historical veins of automated theorem proving, either you accept a weakened logic in exchange for more automation eg ACL2, or you accept some fairly weak automation in exchange for a strong logic . Fortunately, there are some relatively modern tools such as Coq (and I suppose Isabelle/HOL) which support both veins of theorem proving.

If you want a short concrete taste of this, I'd suggest checking out this tutorial by adam chipala which exposits some techniques in Coq that are very clever which allow for easy reasoning in at least the context of programming language theory. That aside, all these websites have a number of good references for good tutorials both about proof assistants and how to use them.

$\endgroup$
  • $\begingroup$ just out of curiosity, how is adam.chlipala.net/cpdt a tutorial? It seems to be an entire book! How did you specifically had in mind to go through it? $\endgroup$ – Charlie Parker Nov 3 '17 at 22:47
  • 1
    $\begingroup$ it wasn't a book at first :) . Notice how it was first published as a book in 2013, 4-5 years after i linked it :) $\endgroup$ – Carter Tazio Schonwald Nov 28 '17 at 20:07
4
$\begingroup$

I'll repeat the suggestion and highly recommend Frank Pfenning's course notes, which you can also find at the original course website (google "15-815 cmu"). Another book you can try is Jean Gallier's Logic for Computer Science: Foundations of Automatic Theorem Proving, recently recommended on a LambdaTheUltimate thread.

$\endgroup$
3
$\begingroup$

John Harrison "Handbook of Practical Logic and Automated Reasoning" - superbook

$\endgroup$
2
$\begingroup$

Materials for one course on Isabelle (previously mentioned) are available.

$\endgroup$
1
$\begingroup$

I haven't read any of these but they might be useful:

Some notes of Frank Pfenning.

A paper of Wirth.

$\endgroup$
1
$\begingroup$

Benjamin Pierce has a nice introduction to automatic theorem proving in his Software Foundations Courseware, using Coq.

$\endgroup$
1
$\begingroup$

Have you heard of the Coq proof assistant? It is quite popular here in France. The official webpage contains good documetation.

$\endgroup$

Your Answer

By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

Not the answer you're looking for? Browse other questions tagged or ask your own question.