This is an old revision of this page, as edited by Guillaume2303 (talk | contribs) at 16:25, 16 September 2008 (Undid revision 238832020 by Crusio (talk)revert, has been prodded before, should go to AfD). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
Revision as of 16:25, 16 September 2008 by Guillaume2303 (talk | contribs) (Undid revision 238832020 by Crusio (talk)revert, has been prodded before, should go to AfD)(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)| 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. |