Name
Abstract | ||
|---|---|---|
There are many problems with the simplification of elementary functions, particularly over the complex plane, though not exclusively – see (20). Systems tend to make “howlers” 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 are probably more amenable to the techniques of artificial intelligence and theorem proving than the original problem of complex-variable analysis. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1023/A:1016007415899 | Ann. Math. Artif. Intell. |
Keywords | Field | DocType |
elementary functions,branch cuts,complex identities | Discrete mathematics,Computer science,Automated theorem proving,Elementary function,Complex plane,Artificial intelligence,Calculus | Journal |
Volume | Issue | ISSN |
36 | 3 | 1573-7470 |
Citations | PageRank | References |
13 | 1.53 | 7 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Russell Bradford | 1 | 92 | 7.78 |
| Robert M. Corless | 2 | 1239 | 127.79 |
| James H. Davenport | 3 | 844 | 141.40 |
| David J. Jeffrey | 4 | 1172 | 132.12 |
| Stephen M. Watt | 5 | 671 | 84.72 |