<--- Back to Details
First PageDocument Content
Automated theorem proving / Formal methods / Logic in computer science / ACL2 / Lisp programming language / Mathematical proof / Isabelle / Coq / HOL / Theoretical computer science / Mathematical software / Mathematics
Date: 2013-10-30 13:20:29
Automated theorem proving
Formal methods
Logic in computer science
ACL2
Lisp programming language
Mathematical proof
Isabelle
Coq
HOL
Theoretical computer science
Mathematical software
Mathematics

Learning proofs from refutations

Add to Reading List

Source URL: www.ai4fm.org

Download Document from Source Website

File Size: 67,64 KB

Share Document on Facebook

Similar Documents

Proof of a CWMO problem generalized Darij Grinberg version 7 September 2009 The following result is due to Dan Schwarz. It was proposed as problem 4 (c) for the 9th grade of the Romanian Mathematical OlympiadIt wa

DocID: 1ubUd - View Document

MATHEMATICAL ENGINEERING TECHNICAL REPORTS A Proof of the M-Convex Intersection Theorem

DocID: 1tZxZ - View Document

If Mathematical Proof is a Game, What are the States and Moves? David McAllester 1

DocID: 1tNdk - View Document

Proof, beliefs, and algorithms through the lens of sum-of-squares Mathematical background and pre work Mathematical background We will not assume a lot of mathematical background in this course but will use some basic n

DocID: 1t42e - View Document

Proof, beliefs, and algorithms through the lens of sum-of-squares 1 Mathematical Definitions Let us now turn to formally defining the problem of polynomial

DocID: 1sZHr - View Document