This is an old revision of this page, as edited by Guillaume2303 (talk | contribs) at 16:23, 16 September 2008 (prodding, lack of notability). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
Revision as of 16:23, 16 September 2008 by Guillaume2303 (talk | contribs) (prodding, lack of notability)(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)| This article may have been previously nominated for deletion: Misplaced Pages:Articles for deletion/Stephan Schulz exists. It is proposed that this article be deleted because of the following concern:
If you can address this concern by improving, copyediting, sourcing, renaming, or merging the page, please edit this page and do so. You may remove this message if you improve the article or otherwise object to deletion for any reason. Although not required, you are encouraged to explain why you object to the deletion, either in your edit summary or on the talk page. If this template is removed, do not replace it. This message has remained in place for seven days, so the article may be deleted without further notice. Find sources: "Stephan Schulz" – news · newspapers · books · scholar · JSTORPRODExpired+%5B%5BWP%3APROD%7CPROD%5D%5D%2C+concern+was%3A+does+not+meet+notability+requirements+of+%5B%5BWP%3APROF%5D%5DExpired ], concern was: does not meet notability requirements of WP:PROF Nominator: Please consider notifying the author/project: {{subst:proposed deletion notify|Stephan Schulz|concern=does not meet notability requirements of ]}} ~~~~Timestamp: 20080916162350 16:23, 16 September 2008 (UTC) Administrators: delete |
| Stephan Schulz | |
|---|---|
| File:StephanSchulz.jpgStephan 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. |