Translate:
English
Chinese (S)
Chinese (T)
Croatian
Dutch
French
German
Hebrew
Italian
Japanese
Korean
Portuguese
Russian
Serbian
Spanish
Swedish
Turkish
Additional
Satisfiability modulo theories
English Wikipedia - The Free Encyclopedia
Download this dictionary
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
list
s,
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
.
See more at Wikipedia.org...
© This article uses material from
Wikipedia
®
and is licensed under the
GNU Free Documentation License
and under the
Creative Commons Attribution-ShareAlike License