default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRolf Wiehagen
Person information
- affiliation: Kaiserslautern University of Technology, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[j34]Ganesh Baliga
, John Case, Wolfgang Merkle, Frank Stephan, Rolf Wiehagen:
When unlearning helps. Inf. Comput. 206(5): 694-709 (2008)- 2004
- [j33]Sanjay Jain, Efim B. Kinber, Rolf Wiehagen:
Learning all subfunctions of a function. Inf. Comput. 192(2): 185-215 (2004) - [j32]John Case, Sanjay Jain, Frank Stephan, Rolf Wiehagen:
Robust learning--rich and poor. J. Comput. Syst. Sci. 69(2): 123-165 (2004) - 2003
- [j31]Sanjay Jain, Efim B. Kinber, Christophe Papazian, Carl H. Smith, Rolf Wiehagen:
On the intrinsic complexity of learning recursive functions. Inf. Comput. 184(1): 45-70 (2003) - [j30]Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas Zeugmann:
On learning of functions refutably. Theor. Comput. Sci. 298(1): 111-143 (2003) - [c30]Sanjay Jain, Efim B. Kinber, Rolf Wiehagen:
Learning All Subfunctions of a Function. COLT 2003: 714-728 - 2002
- [j29]Rusins Freivalds, Marek Karpinski, Carl H. Smith, Rolf Wiehagen:
Learning by the Process of Elimination. Inf. Comput. 176(1): 37-50 (2002) - 2001
- [j28]Sanjay Jain, Carl H. Smith, Rolf Wiehagen:
Robust Learning Is Rich. J. Comput. Syst. Sci. 62(1): 178-212 (2001) - [j27]Sanjay Jain, Efim B. Kinber, Rolf Wiehagen:
Language Learning from Texts: Degrees of Intrinsic Complexity and Their Characterizations. J. Comput. Syst. Sci. 63(3): 305-354 (2001) - [j26]Stuart A. Kurtz, Carl H. Smith, Rolf Wiehagen:
On the role of search for learning from examples. J. Exp. Theor. Artif. Intell. 13(1): 25-43 (2001) - [j25]Rolf Wiehagen, Thomas Zeugmann:
Foreword. Theor. Comput. Sci. 268(2): 175-177 (2001) - [c29]Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas Zeugmann:
Learning Recursive Functions Refutably. ALT 2001: 283-298 - [c28]John Case, Sanjay Jain, Frank Stephan, Rolf Wiehagen:
Robust Learning - Rich and Poor. COLT/EuroCOLT 2001: 143-159 - 2000
- [j24]Sanjay Jain, Efim B. Kinber, Steffen Lange, Rolf Wiehagen, Thomas Zeugmann:
Learning languages and functions by erasing. Theor. Comput. Sci. 241(1-2): 143-189 (2000) - [c27]Sanjay Jain, Efim B. Kinber, Rolf Wiehagen:
Language Learning From Texts: Degrees of Instrinsic Complexity and Their Characterizations. COLT 2000: 47-58
1990 – 1999
- 1999
- [c26]Efim B. Kinber, Christophe Papazian, Carl H. Smith, Rolf Wiehagen:
On the Intrinsic Complexity of Learning Recursive Functions. COLT 1999: 257-266 - 1998
- [j23]Steffen Lange, Jochen Nessel, Rolf Wiehagen:
Learning Recursive Languages from Good Examples. Ann. Math. Artif. Intell. 23(1-2): 27-52 (1998) - [j22]Rusins Freivalds, Ognian Botuscharov, Rolf Wiehagen:
Identifying Nearly Minimal Gödel Numbers from Additional Information. Ann. Math. Artif. Intell. 23(1-2): 199-209 (1998) - [c25]Michael M. Richter, Carl H. Smith, Rolf Wiehagen, Thomas Zeugmann:
Editor's Introduction. ALT 1998: 1-10 - [c24]Sanjay Jain, Carl H. Smith, Rolf Wiehagen:
On the Power of Learning Robustly. COLT 1998: 187-197 - [e1]Michael M. Richter, Carl H. Smith, Rolf Wiehagen, Thomas Zeugmann:
Algorithmic Learning Theory, 9th International Conference, ALT '98, Otzenhausen, Germany, October 8-10, 1998, Proceedings. Lecture Notes in Computer Science 1501, Springer 1998, ISBN 3-540-65013-X [contents] - 1997
- [j21]Carl H. Smith, Rolf Wiehagen, Thomas Zeugmann:
Classifying Predicates and Languages. Int. J. Found. Comput. Sci. 8(1): 15-42 (1997) - [c23]Rusins Freivalds, Gints Tervits, Rolf Wiehagen, Carl H. Smith:
Learning Small Programs with Additional Information. LFCS 1997: 102-112 - 1996
- [c22]Steffen Lange, Rolf Wiehagen, Thomas Zeugmann:
Learning by Erasing. ALT 1996: 228-241 - [c21]Sanjay Jain, Efim B. Kinber, Rolf Wiehagen:
On Learning and Co-learning of Minimal Programs. ALT 1996: 242-255 - 1995
- [j20]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
How Inductive Inference Strategies Discover Their Errors. Inf. Comput. 118(2): 208-226 (1995) - [j19]Efim B. Kinber, Carl H. Smith, Mahendran Velauthapillai, Rolf Wiehagen:
On Learning Multiple Concepts in Parallel. J. Comput. Syst. Sci. 50(1): 41-52 (1995) - [j18]Rolf Wiehagen, Carl H. Smith:
Generalization versus classification. J. Exp. Theor. Artif. Intell. 7(2): 163-174 (1995) - [c20]Rolf Wiehagen, Thomas Zeugmann:
Learning and Consistency. GOSLER Final Report 1995: 1-24 - [c19]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
Error Detecting in Inductive Inference. GOSLER Final Report 1995: 25-48 - [c18]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
Learning from Good Examples. GOSLER Final Report 1995: 49-62 - [c17]Rolf Wiehagen, Carl H. Smith, Thomas Zeugmann:
Classifying Recursive Predicates and Languages. GOSLER Final Report 1995: 174-189 - 1994
- [j17]Rolf Wiehagen, Thomas Zeugmann:
Ignoring data may be the only way to learn efficiently. J. Exp. Theor. Artif. Intell. 6(1): 131-144 (1994) - [j16]Rolf Wiehagen:
From Inductive Inference to Algorithmic Learning Theory (Invented). New Gener. Comput. 12(4): 321-335 (1994) - [c16]Rusins Freivalds, Ognian Botuscharov, Rolf Wiehagen:
Identifying Nearly Minimal Gödel Numbers From Additional Information. AII/ALT 1994: 91-99 - [c15]Steffen Lange, Jochen Nessel, Rolf Wiehagen:
Language Learning from Good Examples. AII/ALT 1994: 423-437 - 1993
- [j15]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
On the Power of Inductive Inference from Good Examples. Theor. Comput. Sci. 110(1): 131-144 (1993) - [c14]Efim B. Kinber, Carl H. Smith, Mahendran Velauthapillai, Rolf Wiehagen:
On Learning Multiple Concepts in Parallel. COLT 1993: 175-181 - [c13]Rolf Wiehagen, Carl H. Smith, Thomas Zeugmann:
Classification of predicates and languages. EuroCOLT 1993: 171-181 - 1992
- [c12]Rolf Wiehagen, Thomas Zeugmann:
Too Much Can be Too Much for Learning Efficiently. AII 1992: 72-86 - [c11]Rolf Wiehagen:
From Inductive Inference to Algorithmic Learning Theory. ALT 1992: 13-24 - [c10]Rolf Wiehagen, Carl H. Smith:
Generalization versus Classification. COLT 1992: 224-230 - 1991
- [j14]Steffen Lange, Rolf Wiehagen:
Polynomial-time Inference of Arbitrary Pattern Languages. New Gener. Comput. 8(4): 361-370 (1991) - [c9]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
Dual Types of Hypotheses in Inductive Inference. Nonmonotonic and Inductive Logic 1991: 209-240 - 1990
- [c8]Steffen Lange, Rolf Wiehagen:
Polynomial-Time Inference of Pattern Languages. ALT 1990: 289-301 - [c7]Rolf Wiehagen:
A Thesis in Inductive Inference. Nonmonotonic and Inductive Logic 1990: 184-207
1980 – 1989
- 1989
- [j13]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
On the Power of Probabilistic Inductive Inference in Nonstandard Numberings. J. Inf. Process. Cybern. 25(5/6): 239-243 (1989) - [c6]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
Inductive Inference from Good Examples. AII 1989: 1-17 - 1988
- [j12]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings. Math. Log. Q. 34(6): 531-539 (1988) - 1986
- [j11]Rolf Wiehagen:
On the Complexity of Program Synthesis from Examples. J. Inf. Process. Cybern. 22(5/6): 305-323 (1986) - [c5]Rolf Wiehagen:
On the Complexity of Effective Program Synthesis. AII 1986: 209-219 - 1985
- [c4]Rolf Wiehagen:
How fast is program synthesis from examples. Mathematical Methods of Specification and Synthesis of Software Systems 1985: 231-239 - 1984
- [j10]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
Connections between Identifying Functionals, standardizing Operations, and Computable Numberings. Math. Log. Q. 30(9-11): 145-164 (1984) - [j9]Rolf Wiehagen, Rusins Freivalds, Efim B. Kinber:
On the Power of Probabilistic Strategies in Inductive Inference. Theor. Comput. Sci. 28: 111-133 (1984) - 1982
- [j8]Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
Inductive Inference and Computable One-One Numberings. Math. Log. Q. 28(27-32): 463-479 (1982) - 1980
- [j7]Reinhard Klette, Rolf Wiehagen:
Research in the theory of inductive inference by GDR mathematicians - A survey. Inf. Sci. 22(2): 149-169 (1980)
1970 – 1979
- 1979
- [j6]R. V. Freivald, Rolf Wiehagen:
Inductive Inference with Additional Information. J. Inf. Process. Cybern. 15(4): 179-185 (1979) - 1978
- [c3]Rolf Wiehagen:
Characterization Problems in the Theory of Inductive Inference. ICALP 1978: 494-508 - 1977
- [j5]Rolf Wiehagen, Hermann Jung:
Rekursionstheoretische Charakterisierung von erkennbaren Klassen rekursiver Funktionen. J. Inf. Process. Cybern. 13(7/8): 385-397 (1977) - [c2]Rolf Wiehagen:
Identification of Formal Languages. MFCS 1977: 571-579 - 1976
- [j4]Rolf Wiehagen:
Limes-Erkennung rekursiver Funktionen durch spezielle Strategien. J. Inf. Process. Cybern. 12(1/2): 93-99 (1976) - [j3]Rolf Wiehagen, Walter Liepe:
Charakteristische Eigenschaften von erkennbaren Klassen rekursiver Funktionen. J. Inf. Process. Cybern. 12(8/9): 421-438 (1976) - 1975
- [j2]Rolf Wiehagen:
Dechiffrierung von ND-Automaten. J. Inf. Process. Cybern. 11(1/2): 39-60 (1975) - [j1]Rolf Wiehagen:
Limes-Erkennung rekursiver Funktionen durch spezielle Strategien. J. Inf. Process. Cybern. 11(10-12): 653 (1975) - [c1]Rolf Wiehagen:
Inductive Inference of Recursive Functions. MFCS 1975: 462-464
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
