Communications of the ACM
Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Learnability and the Vapnik-Chervonenkis dimension
Journal of the ACM (JACM)
Elementary formal system as a unifying framework for language learning
COLT '89 Proceedings of the second annual workshop on Computational learning theory
Inductive inference of monotonic formal systems from positive data
New Generation Computing - Selected papers from the international workshop on algorithmic learning theory,1990
Machine learning: a theoretical approach
Machine learning: a theoretical approach
Learning elementary formal systems
Theoretical Computer Science
Short note: procedural semantics and negative information of elementary formal system
Journal of Logic Programming
Rich classes inferable from positive data
Information and Computation
Foundations of logic programming
Principles of knowledge representation
Learning Information Extraction Rules for Semi-Structured and Free Text
Machine Learning - Special issue on natural language learning
Token-Templates and Logic Programs for Intelligent Web Search
Journal of Intelligent Information Systems - Special issue on methodologies for intelligent information systems
Polynomial-time learning of elementary formal systems
New Generation Computing
Wrapper induction: efficiency and expressiveness
Artificial Intelligence - Special issue on Intelligent internet systems
Inductive Inference: Theory and Methods
ACM Computing Surveys (CSUR)
On Learning Sets and Functions
Machine Learning
A Guided Tour Across the Boundaries of Learning Recursive Languages
Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report
A Unifying Approach to HTML Wrapper Representation and Learning
DS '00 Proceedings of the Third International Conference on Discovery Science
Formal languages and their relation to automata
Formal languages and their relation to automata
| Hi-index | 0.00 |
An elementary formal system (EFS) is a logic program such as a Prolog program, for instance, that directly manipulates strings. Arikawa and his co-workers proposed elementary formal systems as a unifying framework for formal language learning.In the present paper, we introduce advanced elementary formal systems (AEFSs), i.e., elementary formal systems which allow for the use of a certain kind of negation, which is nonmonotonic, in essence, and which is conceptually close to negation as failure.We study the expressiveness of this approach by comparing certain AEFS definable language classes to the levels in the Chomsky hierarchy and to the language classes that are definable by EFSs that meet the same syntactical constraints.Moreover, we investigate the learnability of the corresponding AEFS definable language classes in two major learning paradigms, namely in Gold's model of learning in the limit and Valiant's model of probably approximately correct learning. In particular, we show which learnability results achieved for EFSs extend to AEFSs and which do not.