Reasoning about the elementary functions of complex analysis

Robert M. Corless, James H. Davenport, David J. Jeffrey, Gurjeet Litt, Stephen M. Watt

Research output: Chapter or section in a book/report/conference proceedingChapter or section

8 Citations (SciVal)


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.
Original languageEnglish
Title of host publicationArtificial Intelligence and Symbolic Computation
Subtitle of host publicationRevised Papers
EditorsJ. A. Campbell, E. Roanes-Lozano
Place of PublicationBerlin, Germany
Number of pages12
ISBN (Print)9783540420712
Publication statusPublished - 2001
EventInternational Conference Artificial Intelligence and Symbolic Computation (AISC), 2000 - Madrid, Spain
Duration: 17 Jul 200019 Jul 2000

Publication series

NameLecture Notes in Artificial Intelligence


ConferenceInternational Conference Artificial Intelligence and Symbolic Computation (AISC), 2000

Bibliographical note

ID number: ISI:000174952100009


Dive into the research topics of 'Reasoning about the elementary functions of complex analysis'. Together they form a unique fingerprint.

Cite this