2007 | OriginalPaper | Chapter
Quantified Linear Arithmetic
Published in: The Calculus of Computation
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Recall from Chapter 3 that satisfiability in the theories of linear integer arithmetic
T
ℤ
and linear rational (or real) arithmetic
T
ℚ
is decidable. This chapter explores a common method of deciding satisfiability of arbitrarily quantified formulae in decidable theories in the context of
T
ℤ
and
T
ℚ
.