Reasoning about the elementary functions of complex analysis
Corless, R. M., Davenport, J. H., Jeffrey, D. J., Litt, G. and Watt, S. M., 2001. Reasoning about the elementary functions of complex analysis. In: Artificial Intelligence and Symbolic Computation. Vol. 1930. , pp. 115-126. (Lecture Notes in Artificial Intelligence)
Related documents:This repository does not currently have the full-text of this item.
You may be able to access a copy if URLs are provided below.
There are many problems with the simplification of elementary functions, particularly over the complex plane. Systems tend to make major errors, or not to simplify enough. In this paper we outline the "unwinding number" approach to such problems, and show how it can be used to prevent errors and to systematise such simplification, even though we have not yet reduced the simplification process to a complete algorithm. The unsolved problems axe probably more amenable to the techniques of artificial intelligence and theorem proving than the original problem of complex-variable analysis.
|Item Type||Book Sections|
|Creators||Corless, R. M., Davenport, J. H., Jeffrey, D. J., Litt, G. and Watt, S. M.|
|Departments||Faculty of Science > Computer Science|
|Additional Information||ID number: ISI:000174952100009|
Actions (login required)