Satisfiability modulo theories
In computer science and mathematical logic, the satisfiability modulo theories (SMT) problem is a decision problem for logical formulas with respect to combinations of background theories expressed in classical first-order logic with equality. Examples of theories typically used in computer science are the theory of real numbers, the theory of integers, and the theories of various data structures such as lists, arrays, bit vectors and so on. SMT can be thought of as a form of the constraint satisfaction problem and thus a certain formalized approach to constraint programming.
known for
Alt-ErgoAutomated planning and schedulingAutomated theorem provingBoolean satisfiability problemBoolectorCADE ATP System CompetitionCVCCVC3CVC4CVC (theorem prover)CVC LiteCVC Lite theorem proverCVC theorem proverComputer algebra systemConcolic testingConstraint (mathematics)Constraint satisfactionConstraint satisfaction problemDPLL(T)DPLL algorithmDavid L. DillEntscheidungsproblemExtended static checkingF* (programming language)Fast Fourier transformFormal verificationGreg Nelson (computer scientist)Isabelle (proof assistant)Liquid HaskellList of SMT solversList of computer scientistsList of optimization softwareList of people associated with PARCList of programmersMaximum satisfiability problemMicrosoft and open sourceModel theoryOpenCogPredicate transformer semanticsPresburger arithmetic
Link from a Wikipage to another Wikipage
known for
primaryTopic
Satisfiability modulo theories
In computer science and mathematical logic, the satisfiability modulo theories (SMT) problem is a decision problem for logical formulas with respect to combinations of background theories expressed in classical first-order logic with equality. Examples of theories typically used in computer science are the theory of real numbers, the theory of integers, and the theories of various data structures such as lists, arrays, bit vectors and so on. SMT can be thought of as a form of the constraint satisfaction problem and thus a certain formalized approach to constraint programming.
has abstract
En ciencias de la computación ...... rogramación con restricciones.
@es
En informatique et en logique ...... des combinaisons de celles-ci.
@fr
In computer science and mathem ...... ach to constraint programming.
@en
Задача выполнимости формул в т ...... ивов, битовых векторов и т. п.
@ru
У програмуванні, Satisfiabilit ...... сивів, бітових векторів та ін.
@uk
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,023,341,457
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
hypernym
type
comment
En ciencias de la computación ...... rogramación con restricciones.
@es
En informatique et en logique ...... des combinaisons de celles-ci.
@fr
In computer science and mathem ...... ach to constraint programming.
@en
Задача выполнимости формул в т ...... ивов, битовых векторов и т. п.
@ru
У програмуванні, Satisfiabilit ...... сивів, бітових векторів та ін.
@uk
label
Satisfiability Modulo Theories
@uk
Satisfiability modulo theories
@en
Satisfiability modulo theories
@fr
Satisfierbarhet modulo teorier
@sv
Teorías de satisfacibilidad módulo
@es
Задача выполнимости формул в теориях
@ru