Misplaced Pages

Stephan Schulz: Difference between revisions

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
Browse history interactively← Previous editNext edit →Content deleted Content addedVisualWikitext
Revision as of 22:12, 9 December 2009 editKimDabelsteinPetersen (talk | contribs)Extended confirmed users, Pending changes reviewers19,610 edits Reverted to revision 272036116 by Addbot; rv per WP:BLP.. using TW← Previous edit Revision as of 05:25, 10 December 2009 edit undo2over0 (talk | contribs)17,247 edits some cleanupNext edit →
Line 13: Line 13:
}} }}


'''Stephan Schulz''' is a ] ] working in the field of ]. He is best known for the development of the high performance ] which has won the CNF division of the , and has been among the strongest systems in the for several years (coming second in the . In 2002, Schulz was recognized for the best paper by ]<ref name="f2002">{{cite journal|date=2002-12|title=Flairs 2002 Conference Report|journal=AI Magazine|url=http://www.accessmylibrary.com/coms2/summary_0286-27024342_ITM}}</ref> and has been published in his field.<ref>{{cite web|url=http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/s/Schulz:Stephan.html|title=DBLP Bibliography |publisher=Universitat Trier|accessdate=2008-09-16}}</ref> '''Stephan Schulz''' is a ] ] working in the field of ]. He is best known for the development of the high performance ], which won the ] division of the ] in 2000.<ref></ref> It has been among the strongest systems in the competition for several years, coming second in 2008.<ref></ref> In 2002, Schulz was recognized by the ] with the ''best paper'' award for his work ''A Comparison of Different Techniques for Grounding Near-Propositional CNF Formulae''.<ref name="f2002">{{cite journal|date=2002-12|title=Flairs 2002 Conference Report|journal=AI Magazine|url=http://www.accessmylibrary.com/coms2/summary_0286-27024342_ITM}}</ref>


Together with ], he has founded and has been organizing the which became a venue for presentation and publishing of practically oriented Automated Reasoning research. He has been also significantly involved with the ] about implementations of logics, and is a member of the Steering Committee of the ]. Together with ], Schulz founded and has been organizing the , a venue for presentation and publishing of practically oriented Automated Reasoning research. He has been significantly involved with the ] on implementations of logics, and is a member of the Steering Committee of the ].


==References== ==References==
Line 22: Line 22:
==External links== ==External links==
* *
* * at the ]


{{academic-bio-stub}} {{academic-bio-stub}}

Revision as of 05:25, 10 December 2009

This article is an orphan, as no other articles link to it. Please introduce links to this page from related articles; try the Find link tool for suggestions. (February 2009)
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
NationalityGerman
Known forE equational theorem prover
Scientific career
FieldsComputer 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

  1. competition
  2. FOF division of CASC in 2008
  3. "Flairs 2002 Conference Report". AI Magazine. 2002-12. {{cite journal}}: Check date values in: |date= (help)

External links

Stub icon

This biography of an academic is a stub. You can help Misplaced Pages by expanding it.

Categories: