20% off all books with the code: BOOKS
  • check 10+ million books
  • check New arrivals every day
  • check Trusted by 1M+ customers
  • check Great prices & discounts
  • check Shipping across Europe

Satisfiability Modulo Theories: Computer Science, Theory (Mathematical Logic) -

English
2026-03-15
€156.58 €195.73

-20% with code BOOKS

In stock at our supplier

Shipping in 15-21 days

30-day return policy

High Quality Content by WIKIPEDIA articles! In computer science, 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 ... Full description

You May Also Like

Description

High Quality Content by WIKIPEDIA articles! In computer science, 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. Formally speaking, an SMT instance is a formula in first-order logic, where some function and predicate symbols have additional interpretations, and SMT is the problem of determining whether such a formula is satisfiable. In other words, imagine an instance of the Boolean satisfiability problem (SAT) in which some of the binary variables are replaced by predicates over a suitable set of non-binary variables. A predicate is basically a binary-valued function of non-binary variables. Example predicates include linear inequalities (e.g., 3x+ 2y - z geq 4) or equalities involving so-called uninterpreted terms and function symbols (e.g., f(f(u,v),v) = f(u,v) where f is some unspecified function of two unspecified arguments.)

More Information

Publisher OmniScriptum
Release year 2026
Cover type Softcover
EAN 9786131201929
Write Your Own Review
You're reviewing: Satisfiability Modulo Theories: Computer Science, Theory (Mathematical Logic)
Your Rating:

Goodreads Reviews

€156.58 €195.73