Well … it isn't quite that simple
ACM SIGSAM Bulletin
Algebraic numbers: an example of dynamic evaluation
Journal of Symbolic Computation
On the implementation of dynamic evaluation
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Guarded expressions in practice
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
A pragmatic approach to extending provers by computer algebra — with applications to coding theory
Fundamenta Informaticae - Special issue on symbolic computation and artificial intelligence
Interfacing computer algebra and deduction systems
Symbolic computation and automated reasoning
Maple's evaluation process as constraint contextual rewriting
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
A Skeptic’s Approach to Combining HOL and Maple
Journal of Automated Reasoning
An Assume Facility for CAS, with a Sample Implementation for Maple
DISCO '92 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems
System Description: RDL : Rewrite and Decision Procedure Laboratory
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Constraint contextual rewriting
Journal of Symbolic Computation - Special issue: First order theorem proving
| Hi-index | 0.00 |
Maple's symbolic evaluator, together with a feature that is usually known as the assume facility, implements a powerful form of conditional rewriting. In a previous paper the authors showed that Maple's evaluation process can be recast as constraint contextual rewriting (CCR), a form of conditional rewriting that incorporates the services provided by a decision procedure through a well-specified interface. In the present paper, this analysis is extended to a component of the assume facility that deals with problems beyond linear arithmetic and that we call the general solver. This led to the discovery of a fault that causes Maple to return wrong results with some contexts. The reason for this is that the facility wrongly assumes that the general solver is complete in the sense that it uses all the available assumptions in the context. While a simple fix to this problem would reduce the logical strength of the assume facility, we show that a more general approach inspired by techniques available in CCR does not suffer from the problem and naturally leads to stronger forms of simplification.