22 lines
827 B
Markdown
22 lines
827 B
Markdown
+++
|
|
date = 2025-06-07
|
|
draft = false
|
|
title = 'MetiTarski'
|
|
subtitle = 'Theorem Prover'
|
|
links = [
|
|
{ title = "Homepage", url = "https://www.cl.cam.ac.uk/~lp15/papers/Arith/", icon = 'fa-solid fa-home' },
|
|
{ title = "Source Code", url = "https://bitbucket.org/lcpaulson/metitarski-git", icon = 'fa-solid fa-code' },
|
|
# { title = "Playground", url = "https://www.why3.org/try/", icon = 'fa-solid fa-gamepad' }
|
|
]
|
|
applications = ['University of Cambridge']
|
|
developers = ['Inria']
|
|
licenses = ['MIT']
|
|
inputs = ['WhyML']
|
|
interfaces = ['CLI', 'Why3']
|
|
maintenance = ['Actively Maintained']
|
|
# techniques = ['CDCL']
|
|
# publications = ['deMoura2008']
|
|
+++
|
|
|
|
<!-- {{<inactive year="2022">}} -->
|
|
MetiTarski is an automatic theorem prover based on a combination of resolution and a decision procedure for the theory of real closed fields. |