162
click to vote
AISC
2008
Springer
15 years 9 months ago
2008
Springer
We introduce high-level theories in analogy with high-level programming languages. The basic point is that even though one can define many theories via simple, low-level axiomatiza...
180
click to vote
AISC
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. The same methodology is used to develop 3 different applications. We begin by using a very expressive, appropriate Domain Specific Language, to write down precise problem...
200
click to vote
AISC
2008
Springer
15 years 9 months ago
2008
Springer
We describe the use of symbolic algebraic computation allied with AI search techniques, applied to the problem of the identification, enumeration and storage of all monoids of orde...
187
click to vote
AISC
2008
Springer
15 years 9 months ago
2008
Springer
We use higher-order logic to verify a quantifier elimination procedure for linear arithmetic over ordered fields, where the coefficients of variables are multivariate polynomials o...
191
click to vote
AISC
2008
Springer
15 years 9 months ago
2008
Springer
Many inequalities involving the functions ln, exp, sin, cos, etc., can be proved automatically by MetiTarski: a resolution theorem prover (Metis) modified to call a decision proced...