This is an old revision of this page, as edited by TomCat4680 (talk | contribs) at 13:41, 16 December 2009. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
Revision as of 13:41, 16 December 2009 by TomCat4680 (talk | contribs)(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)| An editor has nominated this article for deletion. You are welcome to participate in the deletion discussion, which will decide whether or not to retain it.Feel free to improve the article, but do not remove this notice before the discussion is closed. For more information, see the guide to deletion. Find sources: "Stephan Schulz" – news · newspapers · books · scholar · JSTOR%5B%5BWikipedia%3AArticles+for+deletion%2FStephan+Schulz%5D%5DAFD |
 | 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) |
| This article is an autobiography or has been extensively edited by the subject or by someone connected to the subject. It may need editing to conform to Misplaced Pages's neutral point of view policy. There may be relevant discussion on the talk page. (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 won the CNF division of the CADE ATP System Competition in 2000. It has been among the strongest systems in the competition for several years, coming second in 2008. In 2002, Schulz was recognized by the Florida Artificial Intelligence Research Society with the best paper award for his work A Comparison of Different Techniques for Grounding Near-Propositional CNF Formulae.
Together with Geoff Sutcliffe, Schulz founded and has been organizing the ES* Workshop series, a venue for presentation and publishing of practically oriented Automated Reasoning research. He has been significantly involved with the IWIL Workshop series on implementations of logics, and is a member of the Steering Committee of the International Workshop on First-Order Theorem Proving.
References
- CASC-17 competition
- FOF division of CASC in 2008
- "Flairs 2002 Conference Report". AI Magazine. 2002-12.
{{cite journal}}: Check date values in:|date=(help) - Empirically Successful Topics in Automated Deduction workshop series
- Steering Committee of the International Workshops on First-Order Theorem Proving (FTP)
External links
 | This biography of an academic is a stub. You can help Misplaced Pages by expanding it. |