Rolf Wiehagen

Publication Activity (10 Years)

Years Active: 1975-2008
Publications (10 Years): 0

Publications

Ganesh Baliga, John Case, Wolfgang Merkle, Frank Stephan, Rolf Wiehagen
When unlearning helps. Inf. Comput. 206 (5) (2008)
Sanjay Jain, Efim B. Kinber, Rolf Wiehagen
Learning all subfunctions of a function. Inf. Comput. 192 (2) (2004)
John Case, Sanjay Jain, Frank Stephan, Rolf Wiehagen
Robust learning--rich and poor. J. Comput. Syst. Sci. 69 (2) (2004)
Sanjay Jain, Efim B. Kinber, Rolf Wiehagen
Learning All Subfunctions of a Function. COLT (2003)
Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas Zeugmann
On learning of functions refutably. Theor. Comput. Sci. 298 (1) (2003)
Sanjay Jain, Efim B. Kinber, Christophe Papazian, Carl H. Smith, Rolf Wiehagen
On the intrinsic complexity of learning recursive functions. Inf. Comput. 184 (1) (2003)
Rusins Freivalds, Marek Karpinski, Carl H. Smith, Rolf Wiehagen
Learning by the Process of Elimination. Inf. Comput. 176 (1) (2002)
John Case, Sanjay Jain, Frank Stephan, Rolf Wiehagen
Robust Learning - Rich and Poor. COLT/EuroCOLT (2001)
Sanjay Jain, Carl H. Smith, Rolf Wiehagen
Robust Learning Is Rich. J. Comput. Syst. Sci. 62 (1) (2001)
Stuart A. Kurtz, Carl H. Smith, Rolf Wiehagen
On the role of search for learning from examples. J. Exp. Theor. Artif. Intell. 13 (1) (2001)
Rolf Wiehagen, Thomas Zeugmann
Foreword. Theor. Comput. Sci. 268 (2) (2001)
Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas Zeugmann
Learning Recursive Functions Refutably. ALT (2001)
Sanjay Jain, Efim B. Kinber, Rolf Wiehagen
Language Learning from Texts: Degrees of Intrinsic Complexity and Their Characterizations. J. Comput. Syst. Sci. 63 (3) (2001)
Sanjay Jain, Efim B. Kinber, Steffen Lange, Rolf Wiehagen, Thomas Zeugmann
Learning languages and functions by erasing. Theor. Comput. Sci. 241 (1-2) (2000)
Sanjay Jain, Efim B. Kinber, Rolf Wiehagen
Language Learning From Texts: Degrees of Instrinsic Complexity and Their Characterizations. COLT (2000)
Efim B. Kinber, Christophe Papazian, Carl H. Smith, Rolf Wiehagen
On the Intrinsic Complexity of Learning Recursive Functions. COLT (1999)
Sanjay Jain, Carl H. Smith, Rolf Wiehagen
On the Power of Learning Robustly. COLT (1998)
Rusins Freivalds, Ognian Botuscharov, Rolf Wiehagen
Identifying Nearly Minimal Gödel Numbers from Additional Information. Ann. Math. Artif. Intell. 23 (1-2) (1998)
Michael M. Richter, Carl H. Smith, Rolf Wiehagen, Thomas Zeugmann
Editor's Introduction. ALT (1998)
Steffen Lange, Jochen Nessel, Rolf Wiehagen
Learning Recursive Languages from Good Examples. Ann. Math. Artif. Intell. 23 (1-2) (1998)
Carl H. Smith, Rolf Wiehagen, Thomas Zeugmann
Classifying Predicates and Languages. Int. J. Found. Comput. Sci. 8 (1) (1997)
Rusins Freivalds, Gints Tervits, Rolf Wiehagen, Carl H. Smith
Learning Small Programs with Additional Information. LFCS (1997)
Sanjay Jain, Efim B. Kinber, Rolf Wiehagen
On Learning and Co-learning of Minimal Programs. ALT (1996)
Steffen Lange, Rolf Wiehagen, Thomas Zeugmann
Learning by Erasing. ALT (1996)
Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
Learning from Good Examples. GOSLER Final Report (1995)
Rolf Wiehagen, Thomas Zeugmann
Learning and Consistency. GOSLER Final Report (1995)
Rolf Wiehagen, Carl H. Smith
Generalization versus classification. J. Exp. Theor. Artif. Intell. 7 (2) (1995)
Efim B. Kinber, Carl H. Smith, Mahendran Velauthapillai, Rolf Wiehagen
On Learning Multiple Concepts in Parallel. J. Comput. Syst. Sci. 50 (1) (1995)
Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
How Inductive Inference Strategies Discover Their Errors Inf. Comput. 118 (2) (1995)
Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
Error Detecting in Inductive Inference. GOSLER Final Report (1995)
Rolf Wiehagen, Carl H. Smith, Thomas Zeugmann
Classifying Recursive Predicates and Languages. GOSLER Final Report (1995)
Rolf Wiehagen
From Inductive Inference to Algorithmic Learning Theory (Invented). New Gener. Comput. 12 (4) (1994)
Rusins Freivalds, Ognian Botuscharov, Rolf Wiehagen
Identifying Nearly Minimal Gödel Numbers From Additional Information. AII/ALT (1994)
Steffen Lange, Jochen Nessel, Rolf Wiehagen
Language Learning from Good Examples. AII/ALT (1994)
Rolf Wiehagen, Thomas Zeugmann
Ignoring data may be the only way to learn efficiently. J. Exp. Theor. Artif. Intell. 6 (1) (1994)
Rolf Wiehagen, Carl H. Smith, Thomas Zeugmann
Classification of predicates and languages. EuroCOLT (1993)
Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
On the Power of Inductive Inference from Good Examples. Theor. Comput. Sci. 110 (1) (1993)
Efim B. Kinber, Carl H. Smith, Mahendran Velauthapillai, Rolf Wiehagen
On Learning Multiple Concepts in Parallel. COLT (1993)
Rolf Wiehagen, Thomas Zeugmann
Too Much Can be Too Much for Learning Efficiently. AII (1992)
Rolf Wiehagen
From Inductive Inference to Algorithmic Learning Theory. ALT (1992)
Rolf Wiehagen, Carl H. Smith
Generalization versus Classification. COLT (1992)
Steffen Lange, Rolf Wiehagen
Polynomial-time Inference of Arbitrary Pattern Languages. New Gener. Comput. 8 (4) (1991)
Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
Dual Types of Hypotheses in Inductive Inference. Nonmonotonic and Inductive Logic (1991)
Steffen Lange, Rolf Wiehagen
Polynomial-Time Inference of Pattern Languages. ALT (1990)
Rolf Wiehagen
A Thesis in Inductive Inference. Nonmonotonic and Inductive Logic (1990)
Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
Inductive Inference from Good Examples. AII (1989)
Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
On the Power of Probabilistic Inductive Inference in Nonstandard Numberings. J. Inf. Process. Cybern. 25 (5/6) (1989)
Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings. Math. Log. Q. 34 (6) (1988)
Rolf Wiehagen
On the Complexity of Effective Program Synthesis. AII (1986)
Rolf Wiehagen
On the Complexity of Program Synthesis from Examples. J. Inf. Process. Cybern. 22 (5/6) (1986)
Rolf Wiehagen
How fast is program synthesis from examples. Mathematical Methods of Specification and Synthesis of Software Systems (1985)
Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
Connections between Identifying Functionals, standardizing Operations, and Computable Numberings. Math. Log. Q. 30 (9-11) (1984)
Rolf Wiehagen, Rusins Freivalds, Efim B. Kinber
On the Power of Probabilistic Strategies in Inductive Inference. Theor. Comput. Sci. 28 (1984)
Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen
Inductive Inference and Computable One-One Numberings. Math. Log. Q. 28 (27-32) (1982)
Reinhard Klette, Rolf Wiehagen
Research in the theory of inductive inference by GDR mathematicians - A survey. Inf. Sci. 22 (2) (1980)
R. V. Freivald, Rolf Wiehagen
Inductive Inference with Additional Information. J. Inf. Process. Cybern. 15 (4) (1979)
Rolf Wiehagen
Characterization Problems in the Theory of Inductive Inference. ICALP (1978)
Rolf Wiehagen, Hermann Jung
Rekursionstheoretische Charakterisierung von erkennbaren Klassen rekursiver Funktionen. J. Inf. Process. Cybern. 13 (7/8) (1977)
Rolf Wiehagen
Identification of Formal Languages. MFCS (1977)
Rolf Wiehagen
Limes-Erkennung rekursiver Funktionen durch spezielle Strategien. J. Inf. Process. Cybern. 12 (1/2) (1976)
Rolf Wiehagen, Walter Liepe
Charakteristische Eigenschaften von erkennbaren Klassen rekursiver Funktionen. J. Inf. Process. Cybern. 12 (8/9) (1976)
Rolf Wiehagen
Limes-Erkennung rekursiver Funktionen durch spezielle Strategien. J. Inf. Process. Cybern. 11 (10-12) (1975)
Rolf Wiehagen
Inductive Inference of Recursive Functions. MFCS (1975)
Rolf Wiehagen
Dechiffrierung von ND-Automaten. J. Inf. Process. Cybern. 11 (1/2) (1975)