Grammar induction as substructural inductive logic programming

Authors:
Pieter Adriaans;Erik de Haas
Affiliations:
Syllogic, Amersfoort, The Netherlands and Univ. of Amsterdam, Amsterdam, The Netherlands;Syllogic, Amersfoort, The Netherlands
Venue:
Learning language in logic
Year:
2001

Citing 6
Cited 1

A theory of the learnable

Communications of the ACM
Alternation and the computational complexity of logic programs

Journal of Logic Programming
On the occur-check-free PROLOG programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Learnable classes of categorial grammars

Learnable classes of categorial grammars
UML distilled: applying the standard object modeling language

UML distilled: applying the standard object modeling language
Categorial Graphs (Extended Abstract)

FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory

Issues in Learning Language in Logic

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this chapter we describe an approach to grammar induction based on categorial grammars: the EMILE algorithm. Categorial grammars are equivalent to context-free grammars. They were introduced by Ajduciewicz and formalised by Lambek. Technically they can be seen as a variant of the propositional calculus without structural rules. Various learnability results for categorial grammars are known. There exists a whole landscape of these so called substructural logics. This suggests an extension of the ILP research program in the direction of what one might call substructural ILP. We discuss the application of substructural logic to database design and present some complexity results from the literature that suggest the feasibility of this approach.