SMT-COMP
E904157
SMT-COMP is an annual competition that benchmarks and compares the performance of SMT (Satisfiability Modulo Theories) solvers on a standardized set of logical problems.
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
SMT solver competition
ⓘ
competition ⓘ |
| benchmarksAre | publicly available ⓘ |
| encourages |
reproducible experiments
ⓘ
standardized input formats ⓘ |
| evaluates | SMT solvers ⓘ |
| evaluatesAspect |
solver correctness
ⓘ
solver efficiency ⓘ solver performance ⓘ solver robustness ⓘ |
| focusesOn |
SMT solvers
ⓘ
Satisfiability Modulo Theories NERFINISHED ⓘ automated reasoning ⓘ decision procedures ⓘ |
| fullName | Satisfiability Modulo Theories Competition NERFINISHED ⓘ |
| hasFormat | competitive evaluation ⓘ |
| hasImpactOn |
academic research in SMT
ⓘ
design of SMT solvers ⓘ industrial use of SMT technology ⓘ |
| hasOutcome |
awards for best-performing solvers
ⓘ
rankings of SMT solvers ⓘ |
| hasPurpose |
benchmark SMT solvers
ⓘ
compare performance of SMT solvers ⓘ encourage development of SMT technology ⓘ provide standardized evaluation of SMT solvers ⓘ |
| includes |
application track
ⓘ
incremental track ⓘ model-validation track ⓘ multiple logic divisions ⓘ non-incremental track ⓘ unsat-core track ⓘ |
| inputFormat | SMT-LIB language NERFINISHED ⓘ |
| isAssociatedWith |
SMT community
ⓘ
SMT-LIB NERFINISHED ⓘ automated reasoning community ⓘ |
| isHeld | annually ⓘ |
| isRelatedTo |
CADE ATP System Competition
NERFINISHED
ⓘ
SAT Competition NERFINISHED ⓘ |
| isTypicallyAffiliatedWith | CAV conference ⓘ |
| language | English ⓘ |
| organisedBy |
SMT-COMP organizing committee
NERFINISHED
ⓘ
researchers in SMT ⓘ |
| resultsAre | publicly available ⓘ |
| startYear | 2005 ⓘ |
| uses |
SMT-LIB benchmark library
NERFINISHED
ⓘ
standardized set of logical problems ⓘ |
| website | https://smt-comp.github.io ⓘ |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject surface form:
Satisfiability Modulo Theories