<--- 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

Computer programming / Software engineering / Computing / Fold / Recursion / LaTeX

LATEX Sugar for Isabelle Documents Florian Haftmann, Gerwin Klein, Tobias Nipkow, Norbert Schirmer August 15, 2018 Abstract This document shows how to typset mathematics in Isabelle-based

DocID: 1xVCA - View Document

Mathematical logic / Type theory / Computability theory / Lambda calculus / Theoretical computer science / Model theory / Higher-order logic / Constructible universe / Mathematics

Bounded Model Generation for Isabelle/HOL Using a SAT Solver Tjark Weber

DocID: 1xVzf - View Document

Proof assistants / Theoretical computer science / Logic in computer science / Mathematical logic / Isabelle / Logic for Computable Functions / Mathematics / Resolution / Constructible universe / Theorem prover / LCF / Formal methods

Integrating a SAT Solver with an LCF-style Theorem Prover A Fast Decision Procedure for Propositional Logic for the Isabelle System Tjark Weber

DocID: 1xVu1 - View Document

Mathematical logic / Logic / Proof theory / Mathematics / Proof assistants / Logic in computer science / Type theory / Substructural logic / Sequent / First-order logic / Isabelle / Higher-order logic

PDF Document

DocID: 1xVhU - View Document

Computer programming / Recursion / Mathematical logic / Software engineering / Computability theory / Theory of computation / Theoretical computer science / -recursive function / Recursive definition / Well-founded relation / Functional programming / Pattern matching

Defining Recursive Functions in Isabelle/HOL Alexander Krauss Abstract This tutorial describes the use of the function package, which provides general recursive function definitions for Isabelle/HOL. We start with very

DocID: 1xVds - View Document