Functional Equations in Shostak Theories
We consider Shostak theories introduced in . The class of Shostak theories consists of decidable first order equality theories, specified by two algorithms: a canoniser and a solver. A canoniser calculates the normal form of a term. A solver tests whether an equality can be reduced to an equivalent substitution and constructs this substitution when it exists. The examples of Shostak theories are linear arithmetics of integers and rational numbers, theories of lists, arrays, ets..
KeywordsOrder Equation Order Variable Function Symbol Horn Clause Automate Deduction
Unable to display preview. Download preview PDF.