Rolf Wiehagen

发表

Classifying Recursive Predicates and Languages

Carl H. Smith, Rolf Wiehagen, Thomas Zeugmann, 1995, GOSLER Final Report.

Learning languages and functions by erasing

Rolf Wiehagen, Sanjay Jain, Thomas Zeugmann, 2000, Theor. Comput. Sci..

Ignoring data may be the only way to learn efficiently

Rolf Wiehagen, Thomas Zeugmann, Rolf Wiehagen, 1994, J. Exp. Theor. Artif. Intell..

cation of Predicates and Languages

Rolf Wiehagen, Carl H. Smith, 1994 .

Inconsistency can be Necessary for Learning in Polynomial Time

Rolf Wiehagen, 2006 .

Learning by Erasing 3

Rolf Wiehagen, T. Zeugmann, S. Lange, 1996 .

Characterization Problems in the Theory of Inductive Inference

Rolf Wiehagen, Rolf Wiehagen, 1978, ICALP.

On the Power of Probabilistic Inductive Inference in Nonstandard Numberings

Rusins Freivalds, Rolf Wiehagen, Efim B. Kinber, 1989, J. Inf. Process. Cybern..

On the Complexity of Program Synthesis from Examples

Rolf Wiehagen, Rolf Wiehagen, 1986, J. Inf. Process. Cybern..

On learning of functions refutably

Rolf Wiehagen, Sanjay Jain, Thomas Zeugmann, 2003, Theor. Comput. Sci..

Learning Recursive Functions Refutably

Rolf Wiehagen, Sanjay Jain, Thomas Zeugmann, 2001, ALT.

Learning and Consistency

Rolf Wiehagen, Thomas Zeugmann, Rolf Wiehagen, 1995, GOSLER Final Report.

Too Much Information Can Be Too Much for Learning Eciently

Rolf Wiehagen, Thomas Zeugmann, Rolf Wiehagen, 1992 .

Robust Learning - Rich and Poor

John Case, Rolf Wiehagen, Sanjay Jain, 2001, COLT/EuroCOLT.

Learning by the Process of Elimination

Carl H. Smith, Marek Karpinski, Rusins Freivalds, 2002, Inf. Comput..

Research in the theory of inductive inference by GDR mathematicians - A survey

Rolf Wiehagen, Reinhard Klette, Rolf Wiehagen, 1980, Inf. Sci..

On the Complexity of Effective Program Synthesis

Rolf Wiehagen, Rolf Wiehagen, 1986, AII.

Language Learning from Texts: Degrees of Intrinsic Complexity and Their Characterizations

Rolf Wiehagen, Sanjay Jain, Efim B. Kinber, 2000, J. Comput. Syst. Sci..

On the intrinsic complexity of learning recursive functions

Carl H. Smith, Rolf Wiehagen, Efim B. Kinber, 1999, COLT '99.

Classifying Predicates and Languages

Carl H. Smith, Rolf Wiehagen, Thomas Zeugmann, 1997, Int. J. Found. Comput. Sci..

How Inductive Inference Strategies Discover Their Errors

Rusins Freivalds, Rolf Wiehagen, Efim B. Kinber, 1995, Inf. Comput..

Generalization versus classification

Carl H. Smith, Rolf Wiehagen, Rolf Wiehagen, 1992, COLT '92.

Identification of Formal Languages

Rolf Wiehagen, Rolf Wiehagen, 1977, MFCS.

Polynomial-Time Inference of Pattern Languages

Rolf Wiehagen, Steffen Lange, Rolf Wiehagen, 1990, ALT.

Editor's Introduction

Rolf Wiehagen, Thomas Zeugmann, Michael M. Richter, 1998, ALT.

On learning multiple concepts in parallel

Carl H. Smith, Rolf Wiehagen, Efim B. Kinber, 1993, COLT '93.

When unlearning helps

John Case, Rolf Wiehagen, Frank Stephan, 2008, Inf. Comput..

Robust learning--rich and poor

John Case, Rolf Wiehagen, Sanjay Jain, 2004, J. Comput. Syst. Sci..

Learning all subfunctions of a function

Rolf Wiehagen, Sanjay Jain, Efim B. Kinber, 2004, Inf. Comput..

Robust Learning Is Rich

Carl H. Smith, Rolf Wiehagen, Sanjay Jain, 2001, J. Comput. Syst. Sci..

On the role of search for learning from examples

Stuart A. Kurtz, Carl H. Smith, Rolf Wiehagen, 2001, J. Exp. Theor. Artif. Intell..

On the power of learning robustly

Carl H. Smith, Rolf Wiehagen, Sanjay Jain, 1998, COLT' 98.

Dual Types of Hypotheses in Inductive Inference

Rusins Freivalds, Rolf Wiehagen, Efim B. Kinber, 1991, Nonmonotonic and Inductive Logic.

Error Detecting in Inductive Inference

Rusins Freivalds, Rolf Wiehagen, Efim B. Kinber, 1995, GOSLER Final Report.