This is an old revision of this page, as edited by RussBot (talk | contribs) at 12:48, 23 September 2008 (Robot-assisted fix links to disambiguation page German). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
Revision as of 12:48, 23 September 2008 by RussBot (talk | contribs) (Robot-assisted fix links to disambiguation page German)(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff) | The topic of this article may not meet Misplaced Pages's general notability guideline. Please help to demonstrate the notability of the topic by citing reliable secondary sources that are independent of the topic and provide significant coverage of it beyond a mere trivial mention. If notability cannot be shown, the article is likely to be merged, redirected, or deleted. Find sources: "Stephan Schulz" – news · newspapers · books · scholar · JSTOR (September 2008) (Learn how and when to remove this message) |
| Stephan Schulz | |
|---|---|
| Nationality | German |
| Known for | E equational theorem prover |
| Scientific career | |
| Fields | Computer Technology |
Stephan Schulz is a German computer scientist working in the field of automated reasoning. He is best known for the development of the high performance E equational theorem prover which has won the CNF division of the CASC-17 competition, and has been among the strongest systems in the CASC competition for several years (coming second in the FOF division of CASC in 2008. In 2002, Schulz was recognized for the best paper by FLAIRS and has been published in his field.
References
- "Flairs 2002 Conference Report". AI Magazine. 2002-12.
{{cite journal}}: Check date values in:|date=(help) - "DBLP Bibliography". Universitat Trier. Retrieved 2008-09-16.
External links
 | This biography of an academic is a stub. You can help Misplaced Pages by expanding it. |