Compare commits
2 Commits
6af9acff12
...
d29e2086dd
Author | SHA1 | Date | |
---|---|---|---|
d29e2086dd | |||
cee940b083 |
22
tools/prob/comics.md
Normal file
22
tools/prob/comics.md
Normal file
@@ -0,0 +1,22 @@
|
||||
+++
|
||||
date = 2025-06-07
|
||||
draft = false
|
||||
title = 'COMICS'
|
||||
subtitle = 'Probabilistic Model Checker'
|
||||
links = [
|
||||
{ title = "Homepage", url = "https://ths.rwth-aachen.de/research/tools/comics/", icon = 'fa-solid fa-home' },
|
||||
# { title = "Source Code", url = "https://github.com/moves-rwth/storm", icon = 'fa-brands fa-github' },
|
||||
# { title = "Playground", url = "https://cvc5.github.io/app/", icon = 'fa-solid fa-gamepad' }
|
||||
]
|
||||
applications = ['Counterexample Generator']
|
||||
developers = ['RWTH Aachen']
|
||||
# licenses = ['GPLv3']
|
||||
# inputs = ['PRISM', 'JANI', 'PNML', 'GreatSPN', 'Galileo', 'MRMC']
|
||||
# interfaces = ['CLI', 'C++', 'Python']
|
||||
# maintenance = ['Unknown']
|
||||
# techniques = ['CDCL']
|
||||
# publications = ['Hensel2022']
|
||||
+++
|
||||
|
||||
<!-- {{<inactive year="2023">}} -->
|
||||
COMICS is a stand-alone tool which performs model checking and the generation of counterexamples for discrete-time Markov Chains (DTMCs).
|
21
tools/sat-smt/cadical.md
Normal file
21
tools/sat-smt/cadical.md
Normal file
@@ -0,0 +1,21 @@
|
||||
+++
|
||||
date = 2025-06-07
|
||||
draft = false
|
||||
title = 'CaDiCaL'
|
||||
subtitle = 'SAT Solver'
|
||||
links = [
|
||||
# { title = "Homepage", url = "https://wwwlehre.dhbw-stuttgart.de/~sschulz/E/", icon = 'fa-solid fa-home' },
|
||||
{ title = "Source Code", url = "https://github.com/arminbiere/cadical", icon = 'fa-brands fa-github' },
|
||||
# { title = "Playground", url = "https://jfmc.github.io/z3-play/", icon = 'fa-solid fa-gamepad' }
|
||||
]
|
||||
applications = ['SAT Solver']
|
||||
developers = ['University of Freiburg']
|
||||
licenses = ['MIT']
|
||||
# inputs = ['']
|
||||
interfaces = ['CLI']
|
||||
maintenance = ['Actively Maintained']
|
||||
# techniques = ['CDCL']
|
||||
# publications = ['deMoura2008']
|
||||
+++
|
||||
|
||||
CaDiCaL is a simplified satisfiability solver.
|
21
tools/sat-smt/e.md
Normal file
21
tools/sat-smt/e.md
Normal file
@@ -0,0 +1,21 @@
|
||||
+++
|
||||
date = 2025-06-07
|
||||
draft = false
|
||||
title = 'E'
|
||||
subtitle = 'Theorem Prover'
|
||||
links = [
|
||||
{ title = "Homepage", url = "https://wwwlehre.dhbw-stuttgart.de/~sschulz/E/", icon = 'fa-solid fa-home' },
|
||||
{ title = "Source Code", url = "https://github.com/eprover/eprover", icon = 'fa-brands fa-github' },
|
||||
# { title = "Playground", url = "https://jfmc.github.io/z3-play/", icon = 'fa-solid fa-gamepad' }
|
||||
]
|
||||
applications = ['Theorem Prover']
|
||||
developers = ['DHBW Stuttgart']
|
||||
licenses = ['GPLv2']
|
||||
# inputs = ['']
|
||||
interfaces = ['CLI']
|
||||
maintenance = ['Actively Maintained']
|
||||
# techniques = ['CDCL']
|
||||
# publications = ['deMoura2008']
|
||||
+++
|
||||
|
||||
E is a theorem prover for full first-order logic (and now monomorphic higher-order logic) with equality.
|
21
tools/sat-smt/vampire.md
Normal file
21
tools/sat-smt/vampire.md
Normal file
@@ -0,0 +1,21 @@
|
||||
+++
|
||||
date = 2025-06-07
|
||||
draft = false
|
||||
title = 'Vampire'
|
||||
subtitle = 'Theorem Prover'
|
||||
links = [
|
||||
{ title = "Homepage", url = "https://vprover.github.io/index.html", icon = 'fa-solid fa-home' },
|
||||
{ title = "Source Code", url = "https://github.com/vprover/vampire", icon = 'fa-brands fa-github' },
|
||||
# { title = "Playground", url = "https://jfmc.github.io/z3-play/", icon = 'fa-solid fa-gamepad' }
|
||||
]
|
||||
applications = ['Theorem Prover']
|
||||
developers = ['TU Wien']
|
||||
licenses = ['BSD']
|
||||
# inputs = ['']
|
||||
interfaces = ['CLI']
|
||||
maintenance = ['Actively Maintained']
|
||||
# techniques = ['CDCL']
|
||||
# publications = ['deMoura2008']
|
||||
+++
|
||||
|
||||
Vampire is a theorem prover.
|
21
tools/sat-smt/zipperposition.md
Normal file
21
tools/sat-smt/zipperposition.md
Normal file
@@ -0,0 +1,21 @@
|
||||
+++
|
||||
date = 2025-06-07
|
||||
draft = false
|
||||
title = 'Zipperposition'
|
||||
subtitle = 'Theorem Prover'
|
||||
links = [
|
||||
{ title = "Homepage", url = "https://sneeuwballen.github.io/zipperposition/", icon = 'fa-solid fa-home' },
|
||||
{ title = "Source Code", url = "https://github.com/sneeuwballen/zipperposition", icon = 'fa-brands fa-github' },
|
||||
# { title = "Playground", url = "https://jfmc.github.io/z3-play/", icon = 'fa-solid fa-gamepad' }
|
||||
]
|
||||
applications = ['Theorem Prover']
|
||||
developers = ['TU Wien']
|
||||
licenses = ['BSD']
|
||||
# inputs = ['']
|
||||
interfaces = ['CLI']
|
||||
maintenance = ['Actively Maintained']
|
||||
# techniques = ['CDCL']
|
||||
# publications = ['deMoura2008']
|
||||
+++
|
||||
|
||||
Zipperposition is an automated theorem prover for first-order logic with equality and theories.
|
Reference in New Issue
Block a user