Rolf Wiehagen

According to our database, Rolf Wiehagen authored at least 58 papers between 1975 and 2008.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2008

When unlearning helps.

Ganesh Baliga, John Case, Wolfgang Merkle, Frank Stephan, Rolf Wiehagen

Inf. Comput., 2008

2004

Robust learning--rich and poor.

John Case, Sanjay Jain, Frank Stephan, Rolf Wiehagen

J. Comput. Syst. Sci., 2004

Learning all subfunctions of a function.

Sanjay Jain, Efim B. Kinber, Rolf Wiehagen

Inf. Comput., 2004

2003

On learning of functions refutably.

Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas Zeugmann

Theor. Comput. Sci., 2003

On the intrinsic complexity of learning recursive functions.

Sanjay Jain, Efim B. Kinber, Christophe Papazian, Carl H. Smith, Rolf Wiehagen

Inf. Comput., 2003

2002

Learning by the Process of Elimination.

Rusins Freivalds, Marek Karpinski, Carl H. Smith, Rolf Wiehagen

Inf. Comput., 2002

2001

Foreword.

Rolf Wiehagen, Thomas Zeugmann

Theor. Comput. Sci., 2001

On the role of search for learning from examples.

Stuart A. Kurtz, Carl H. Smith, Rolf Wiehagen

J. Exp. Theor. Artif. Intell., 2001

Robust Learning Is Rich.

Sanjay Jain, Carl H. Smith, Rolf Wiehagen

J. Comput. Syst. Sci., 2001

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

Sanjay Jain, Efim B. Kinber, Rolf Wiehagen

J. Comput. Syst. Sci., 2001

Learning Recursive Functions Refutably.

Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas Zeugmann

Proceedings of the Algorithmic Learning Theory, 12th International Conference, 2001

2000

Learning languages and functions by erasing.

Sanjay Jain, Efim B. Kinber, Steffen Lange, Rolf Wiehagen, Thomas Zeugmann

Theor. Comput. Sci., 2000

Language Learning From Texts: Degrees of Instrinsic Complexity and Their Characterizations.

Sanjay Jain, Efim B. Kinber, Rolf Wiehagen

Proceedings of the Thirteenth Annual Conference on Computational Learning Theory (COLT 2000), June 28, 2000

1999

On the Intrinsic Complexity of Learning Recursive Functions.

Efim B. Kinber, Christophe Papazian, Carl H. Smith, Rolf Wiehagen

Proceedings of the Twelfth Annual Conference on Computational Learning Theory, 1999

1998

Learning Recursive Languages from Good Examples.

Steffen Lange, Jochen Nessel, Rolf Wiehagen

Ann. Math. Artif. Intell., 1998

Identifying Nearly Minimal Gödel Numbers from Additional Information.

Rusins Freivalds, Ognian Botuscharov, Rolf Wiehagen

Ann. Math. Artif. Intell., 1998

On the Power of Learning Robustly.

Sanjay Jain, Carl H. Smith, Rolf Wiehagen

Proceedings of the Eleventh Annual Conference on Computational Learning Theory, 1998

Editor's Introduction.

Michael M. Richter, Carl H. Smith, Rolf Wiehagen, Thomas Zeugmann

Proceedings of the Algorithmic Learning Theory, 9th International Conference, 1998

1997

Classifying Predicates and Languages.

Carl H. Smith, Rolf Wiehagen, Thomas Zeugmann

Int. J. Found. Comput. Sci., 1997

Learning Small Programs with Additional Information.

Rusins Freivalds, Gints Tervits, Rolf Wiehagen, Carl H. Smith

Proceedings of the Logical Foundations of Computer Science, 4th International Symposium, 1997

1996

Learning by Erasing.

Steffen Lange, Rolf Wiehagen, Thomas Zeugmann

Proceedings of the Algorithmic Learning Theory, 7th International Workshop, 1996

On Learning and Co-learning of Minimal Programs.

Sanjay Jain, Efim B. Kinber, Rolf Wiehagen

Proceedings of the Algorithmic Learning Theory, 7th International Workshop, 1996

1995

How Inductive Inference Strategies Discover Their Errors

Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen

Inf. Comput., May, 1995

Generalization versus classification.

Rolf Wiehagen, Carl H. Smith

J. Exp. Theor. Artif. Intell., 1995

On Learning Multiple Concepts in Parallel.

Efim B. Kinber, Carl H. Smith, Mahendran Velauthapillai, Rolf Wiehagen

J. Comput. Syst. Sci., 1995

Learning and Consistency.

Rolf Wiehagen, Thomas Zeugmann

Proceedings of the Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report, 1995

Classifying Recursive Predicates and Languages.

Rolf Wiehagen, Carl H. Smith, Thomas Zeugmann

Proceedings of the Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report, 1995

Learning from Good Examples.

Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen

Proceedings of the Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report, 1995

Error Detecting in Inductive Inference.

Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen

Proceedings of the Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report, 1995

1994

From Inductive Inference to Algorithmic Learning Theory (Invented).

Rolf Wiehagen

New Gener. Comput., 1994

Ignoring data may be the only way to learn efficiently.

Rolf Wiehagen, Thomas Zeugmann

J. Exp. Theor. Artif. Intell., 1994

Language Learning from Good Examples.

Steffen Lange, Jochen Nessel, Rolf Wiehagen

Proceedings of the Algorithmic Learning Theory, 1994

1993

On the Power of Inductive Inference from Good Examples.

Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen

Theor. Comput. Sci., 1993

Classification of predicates and languages.

Rolf Wiehagen, Carl H. Smith, Thomas Zeugmann

Proceedings of the First European Conference on Computational Learning Theory, 1993

1992

From Inductive Inference to Algorithmic Learning Theory.

Rolf Wiehagen

Proceedings of the Algorithmic Learning Theory, Third Workshop, 1992

Too Much Can be Too Much for Learning Efficiently.

Rolf Wiehagen, Thomas Zeugmann

Proceedings of the Analogical and Inductive Inference, 1992

1991

Polynomial-time Inference of Arbitrary Pattern Languages.

Steffen Lange, Rolf Wiehagen

New Gener. Comput., 1991

Dual Types of Hypotheses in Inductive Inference.

Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen

Proceedings of the Nonmonotonic and Inductive Logic, 1991

1990

A Thesis in Inductive Inference.

Rolf Wiehagen

Proceedings of the Nonmonotonic and Inductive Logic, 1990

Polynomial-Time Inference of Pattern Languages.

Steffen Lange, Rolf Wiehagen

Proceedings of the Algorithmic Learning Theory, First International Workshop, 1990

1989

On the Power of Probabilistic Inductive Inference in Nonstandard Numberings.

Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen

J. Inf. Process. Cybern., 1989

Inductive Inference from Good Examples.

Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen

Proceedings of the Analogical and Inductive Inference, 1989

1988

Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings.

Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen

Math. Log. Q., 1988

1986

On the Complexity of Program Synthesis from Examples.

Rolf Wiehagen

J. Inf. Process. Cybern., 1986

On the Complexity of Effective Program Synthesis.

Rolf Wiehagen

Proceedings of the Analogical and Inductive Inference, 1986

1985

How fast is program synthesis from examples.

Rolf Wiehagen

Proceedings of the Mathematical Methods of Specification and Synthesis of Software Systems '85, 1985

1984

On the Power of Probabilistic Strategies in Inductive Inference.

Rolf Wiehagen, Rusins Freivalds, Efim B. Kinber

Theor. Comput. Sci., 1984

Connections between Identifying Functionals, standardizing Operations, and Computable Numberings.

Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen

Math. Log. Q., 1984

1982

Inductive Inference and Computable One-One Numberings.

Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen

Math. Log. Q., 1982

1980

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

Reinhard Klette, Rolf Wiehagen

Inf. Sci., 1980

1979

Inductive Inference with Additional Information.

R. V. Freivald, Rolf Wiehagen

J. Inf. Process. Cybern., 1979

1978

Characterization Problems in the Theory of Inductive Inference.

Rolf Wiehagen

Proceedings of the Automata, 1978

1977

Rekursionstheoretische Charakterisierung von erkennbaren Klassen rekursiver Funktionen.

Rolf Wiehagen, Hermann Jung

J. Inf. Process. Cybern., 1977

Identification of Formal Languages.

Rolf Wiehagen

Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

1976

Charakteristische Eigenschaften von erkennbaren Klassen rekursiver Funktionen.

Rolf Wiehagen, Walter Liepe

J. Inf. Process. Cybern., 1976

1975

Limes-Erkennung rekursiver Funktionen durch spezielle Strategien.

Rolf Wiehagen

J. Inf. Process. Cybern., 1975

Dechiffrierung von ND-Automaten.

Rolf Wiehagen

J. Inf. Process. Cybern., 1975

Inductive Inference of Recursive Functions.

Rolf Wiehagen

Proceedings of the Mathematical Foundations of Computer Science 1975, 1975