Thisvolumeisacollectionofpapers onautomateddeduction inclassical, modal, and many-valued logics, with an emphasis on rst-order theories. Some authors bridgethe gaptohigher-order logicbydealingwithsimpletype theory ina r- order setting, or by resolving shortcomings of r st-order logic with the help of higher-order notions. Most papers rely on resolution or tableaux methods, with a few exceptions choosing the equational paradigm. In its entirety the volume is a mirror of contemporary research in r st-order theorem proving. One trend to be observed is the interest in e ective decision procedures. The main aim of rs t-order theorem proving was and still is to demonstrate the validity or unsatisa bility of formulas, by more and more - phisticatedmethods. Withinthelastyears, however, theothersideofthemedal{ falsi abilityand satisab ility { has r eceived growing attention. Though in g- eral non-terminating, theorem provers sometimes act as decision procedures on subclasses ofrs t-order logic. Inparticularcases theiroutputcanevenbeused to extract n ite representations of models or counter-examples. Another devel- mentistheextension ofdeductiontechniquesfromclassicallogictomany-valued and modal logics. By suitably generalizing classical concepts many results carry over to non-classical logics. This line of research is stimulated by artici al int- ligence with its need for more expressive logics capable of modeling real-world reasoning. From a formal point of view this volume comprises two types of papers, invited and contributed ones. Gilles Dowek, Melvin Fitting, Deepak Kapur, Alexander Leitsch, and David Plaisted accepted our invitation to present recent developments in and their view of the e ld. Contributed papers on the other hand underwent a two-staged selection process.