SMT-LIB2

E824099
SMT-LIB family benchmark format input language standard

SMT-LIB2 is a standardized input language and benchmark format for Satisfiability Modulo Theories (SMT) solvers, enabling consistent specification and exchange of logical problems across different tools.

Try in SPARQL Jump to: Surface forms Statements Referenced by

All labels observed (4)

Label Occurrences
SMT-LIB 2.0 1
SMT-LIB initiative 1
SMT-LIB language 1

Statements (51)

Predicate Object
instanceOf SMT-LIB family ⓘ
benchmark format ⓘ
input language ⓘ
standard ⓘ
abbreviationOf Satisfiability Modulo Theories Library version 2 NERFINISHED ⓘ
application comparing SMT solvers ⓘ
regression testing of SMT solvers ⓘ
sharing SMT benchmarks ⓘ
associatedWith SMT-COMP competition NERFINISHED ⓘ
compatibleWith multiple SMT solvers ⓘ
defines standard attributes ⓘ
standard commands ⓘ
standard logics ⓘ
standard theories ⓘ
domain Satisfiability Modulo Theories NERFINISHED ⓘ
fullName SMT-LIB version 2 NERFINISHED ⓘ
goal improve interoperability of SMT tools ⓘ
provide a common standard for SMT input ⓘ
hasVersion SMT-LIB 2.0 NERFINISHED ⓘ
SMT-LIB 2.1 NERFINISHED ⓘ
SMT-LIB 2.5 NERFINISHED ⓘ
languageFamily Lisp-like ⓘ
maintainedBy SMT-LIB community NERFINISHED ⓘ
partOf SMT-LIB initiative NERFINISHED ⓘ
predecessor SMT-LIB version 1 NERFINISHED ⓘ
purpose enable consistent specification of logical problems ⓘ
enable exchange of SMT problems across different tools ⓘ
provide a standardized benchmark format for SMT solvers ⓘ
provide a standardized input language for SMT solvers ⓘ
supports annotations ⓘ
assert commands ⓘ
check-sat command ⓘ
function declarations ⓘ
get-model command ⓘ
incremental solving ⓘ
logic declarations ⓘ
many-sorted first-order logic ⓘ
push and pop commands ⓘ
quantifiers ⓘ
sort declarations ⓘ
theory declarations ⓘ
theory-specific constructs ⓘ
uninterpreted functions ⓘ
syntaxStyle S-expression ⓘ
usedBy SMT benchmarks NERFINISHED ⓘ
SMT solvers ⓘ
usedIn automated reasoning research ⓘ
constraint solving ⓘ
formal verification ⓘ
hardware verification ⓘ
software verification ⓘ

Referenced by (4)

Full triples — surface form annotated when it differs from this entity's canonical label.

Z3 SMT solver → supportsInputFormat → SMT-LIB2 ⓘ
subject surface form: Z3
Satisfiability Modulo Theories (SMT) → standardizedBy → SMT-LIB2 ⓘ
subject surface form: Satisfiability Modulo Theories
this entity surface form: SMT-LIB initiative
Satisfiability Modulo Theories (SMT) → usesFormat → SMT-LIB2 ⓘ
subject surface form: Satisfiability Modulo Theories
this entity surface form: SMT-LIB language
Satisfiability Modulo Theories (SMT) → relatedStandard → SMT-LIB2 ⓘ
subject surface form: Satisfiability Modulo Theories
this entity surface form: SMT-LIB 2.0