Resource Type:
Code
License:
Other/Unknown
Language:
C, C++
Data Format:
Description
CVC3 is an automatic theorem prover for Satisfiability Modulo Theories (SMT) problems. It can be used to prove the validity (or, dually, the satisfiability) of first-order formulas in a large number of built-in logical theories and their combination.
Categorized in: Representation and Reasoning | Automated Theorem Proving
Post comment
Cancel