Hiroshi Sakamoto, Kouichi Hirata, Hiroki Arimura  Home/Search
Context Related
| i.kyushuu.ac.jp/doitr/trcs179.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: i.kyushuu.ac.jp//doitr (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The elementary formal system (EFS ) is a kind of logic programs which directly manipulates strings, and the learnability of the subclass called hereditary EFSs (HEFSs) has been investigated in the frameworks of the PAC-learning, querylearning, and inductive inference models. The hierarchy of HEFS is expressed by HEFS(m; k; t; r), where m, k, t and r denote the number of clauses, occurrences of variables in the head, atoms in the body, and arity of predicate symbols. The present paper... (Update)
Cited by: More
A Catalog for Prediction-Preserving Reducibility with.. - Hirata, Sakamoto.. (Correct)
Similar documents (at the sentence level):
6.3%: Learning Elementary Formal Systems with Queries - Sakamoto, Hirata, Arimura (2000) (Correct)
Active bibliography (related documents): More All
1.0: On Learning Unions of Pattern Languages and Tree Patterns - Goldman, Kwek (1999) (Correct)
0.7: Extending Elementary Formal Systems - Lange, Grieser, Jantke (Correct)
0.7: Advanced Elementary Formal Systems - Lange, Grieser, Jantke (2001) (Correct)
Similar documents based on text: More All
0.1: A Paraphrase-Based Exploration of Cohesiveness Criteria - Inui, Nogami (2001) (Correct)
0.1: Extracting partial structures from HTML documents - Sakamoto, Arimura, Arikawa (2000) (Correct)
0.1: Knowledge Discovery from Health Data Using Weighted.. - Toru Takae Minoru (Correct)
BibTeX entry: (Update)
H. Sakamoto, K. Hirara, H. Arimura, Learning elementary formal systems with queries, Technical Report DOI-TR-179, Department of Informatics, Kyushu University, 2000. Also available at http://www.i.kyushu-u.ac.jp/doi-tr.html. http://citeseer.ist.psu.edu/sakamoto01learning.html More
@misc{ sakamoto00learning,
author = "H. Sakamoto and K. Hirara and H. Arimura",
title = "Learning elementary formal systems with queries",
text = "H. Sakamoto, K. Hirara, H. Arimura, Learning elementary formal systems
with queries, Technical Report DOI-TR-179, Department of Informatics, Kyushu
University, 2000. Also available at http://www.i.kyushu-u.ac.jp/doi-tr.html.",
year = "2000",
url = "citeseer.ist.psu.edu/sakamoto01learning.html" }
Citations (may not include all citations):951 Computational complexity (context) - Papadimitriou - 1994
537 A theory of learnable (context) - Valiant - 1984
441 Queries and concept learning (context) - Angluin - 1988
328 Algorithmic program debugging (context) - Shapiro - 1982
244 Learning regular sets from queries and counterexamples (context) - Angluin - 1987
142 Finding patterns common to a set of strings (context) - Angluin - 1980
82 When won't membership queries help (context) - Angluin, Kharitonov - 1995
81 Mathematical logic (context) - Ebbinghaus, Flum et al. - 1994
78 Acyclic programs (context) - Apt, Bezem - 1990
59 Prediction-preserving reducibility (context) - Pitt, Warmuth - 1990
43 Generalization and learnability: A study of constrained atom.. - Jr, Frisch - 1992
43 Classic learning - Frazier, Pitt - 1996
40 Lower bound methods and separation results for on-line learn.. (context) - Maass, Tur - 1992
37 Learning from entailment: An application to propositional Ho.. (context) - Frazier, Pitt - 1993
34 Foundations of inductive logic programming (context) - Nienhuys-Cheng, De Wolf - 1997
32 Polynomial time inference of extended regular pattern langua.. (context) - Shinohara - 1982
32 Theory of formal systems (context) - Smullyan - 1961
29 and completeness properties for logic programs (context) - Cavedon, consistency - 1989
22 Learning function-free Horn expressions - Khardon - 1999
18 Learning unions of tree patterns using queries - Arimura, Ishizaka et al. - 1997
18 Learning elementary formal systems (context) - Arikawa, Shinohara et al. - 1992
16 Which classes of elementary formal systems are polynomial-ti.. (context) - Miyano, Shinohara et al. - 1991
15 Finding minimal generalizations for unions of pattern langua.. - Arimura, Shinohara et al. - 1994
11 Polynomial-time learning of elementary formal systems - Miyano, Shinohara et al. - 2000
10 Rich classes inferable from positive data: Length-bounded el.. (context) - Shinohara - 1994
9 Inductive inference of unbounded unions of pattern languages.. (context) - Shinohara, Arimura - 2000
9 bounded context-free grammars (context) - Angluin, k- - 1987
8 Procedural semantics and negative information of elementary .. (context) - Yamamoto - 1992
7 Towards a mathematical theory of machine discovery from fact.. (context) - Mukouchi, Arikawa - 1995
7 Algorithmic learning theory with elementary formal systems (context) - Arikawa, Miyano et al. - 1992
6 Learning pattern languages using queries (context) - Matsumoto, Shinohara - 1997
6 Learning acyclic rst-order Horn sentences from entailment (context) - Arimura - 1997
5 Inductive inference of an approximate concept from positive .. (context) - Mukouchi - 1994
5 Identi cation of unions of languages drawn from an identi ab.. (context) - Wright - 1989
5 Elementary formal systems and formal languages { Simple form.. (context) - Arikawa - 1970
4 Studies on inductive inference from positive data (context) - Shinohara - 1986
3 On approximately identifying concept classes in the limit - Kobayashi, Yokomori - 1995
3 On learning Smullyan's elementary formal systems: Towards an.. (context) - Sakakibara - 1990
2 Constructive learning of context-free languages with a subpa.. - Sugimoto, Toyoshima et al. - 2000
2 Elementary formal systems (context) - Jain, Sharma - 1997
1 Iterated transductions and ecient learning from positive dat.. (context) - Kobayashi - 2000
1 Properties of language classes with nite elasticity (context) - Moriyama, Sato - 1995
1 the complexity of languages de nable by hereditary EFS (context) - Ikeda, Arimura - 1997
Documents on the same site (http://www.i.kyushu-u.ac.jp//doi-tr.html): More
On the Minimization Problem of Text Compression.. - Sakamoto.. (2002) (Correct)
A Sufficient Condition for Secure Ping-Pong Protocols - Mori (2001) (Correct)
Knowledge Discovery from Semistructured Texts - Sakamoto, Arimura, Arikawa (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC