NDLI: Meta-interpretive learning: application to grammatical inference

Content Provider	Springer Nature Link
Author	Muggleton, Stephen H. Lin, Dianhuan Pahlavi, Niels Tamaddoni Nezhad, Alireza
Copyright Year	2013
Abstract	Despite early interest Predicate Invention has lately been under-explored within ILP. We develop a framework in which predicate invention and recursive generalisations are implemented using abduction with respect to a meta-interpreter. The approach is based on a previously unexplored case of Inverse Entailment for Grammatical Inference of Regular languages. Every abduced grammar H is represented by a conjunction of existentially quantified atomic formulae. Thus ¬H is a universally quantified clause representing a denial. The hypothesis space of solutions for ¬H can be ordered by θ-subsumption. We show that the representation can be mapped to a fragment of Higher-Order Datalog in which atomic formulae in H are projections of first-order definite clause grammar rules and the existentially quantified variables are projections of first-order predicate symbols. This allows predicate invention to be effected by the introduction of first-order variables. Previous work by Inoue and Furukawa used abduction and meta-level reasoning to invent predicates representing propositions. By contrast, the present paper uses abduction with a meta-interpretive framework to invent relations. We describe the implementations of Meta-interpretive Learning (MIL) using two different declarative representations: Prolog and Answer Set Programming (ASP). We compare these implementations against a state-of-the-art ILP system MC-TopLog using the dataset of learning Regular and Context-Free grammars as well learning a simplified natural language grammar and a grammatical description of a staircase. Experiments indicate that on randomly chosen grammars, the two implementations have significantly higher accuracies than MC-TopLog. In terms of running time, Metagol is overall fastest in these tasks. Experiments indicate that the Prolog implementation is competitive with the ASP one due to its ability to encode a strong procedural bias. We demonstrate that MIL can be applied to learning natural grammars. In this case experiments indicate that increasing the available background knowledge, reduces the running time. Additionally ASP$_{M}$ (ASP using a meta-interpreter) is shown to have a speed advantage over Metagol when background knowledge is sparse. We also demonstrate that by combining Metagol$_{ R }$ (Metagol with a Regular grammar meta-interpreter) and Metagol$_{ CF }$ (Context-Free meta-interpreter) we can formulate a system, Metagol$_{ RCF }$, which can change representation by firstly assuming the target to be Regular, and then failing this, switch to assuming it to be Context-Free. Metagol$_{ RCF }$ runs up to 100 times faster than Metagol$_{ CF }$ on grammars chosen randomly from Regular and non-Regular Context-Free grammars.
Starting Page	25
Ending Page	49
Page Count	25
File Format	PDF
ISSN	08856125
Journal	Machine Learning
Volume Number	94
Issue Number	1
e-ISSN	15730565
Language	English
Publisher	Springer US
Publisher Date	2013-05-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Inductive logic programming Meta-interpretative learning Predicate invention Recursion Grammatical inference Artificial Intelligence (incl. Robotics) Control, Robotics, Mechatronics Computing Methodologies Simulation and Modeling Language Translation and Linguistics
Content Type	Text
Resource Type	Article
Subject	Artificial Intelligence Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited

Completing causal networks by meta-level abduction

Inductive equivalence in clausal logic and nonmonotonic logic programming

Relational information gain

Incremental learning of event definitions with Inductive Logic Programming

K-Optimal: a novel approximate inference algorithm for ProbLog

Guest editors introduction: special issue on inductive logic programming

Languages as hyperplanes: grammatical inference with string kernels

Brave induction: a logical framework for learning from incomplete information

Meta-interpretive learning: application to grammatical inference

Similar Documents

Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited

Completing causal networks by meta-level abduction

Inductive equivalence in clausal logic and nonmonotonic logic programming

Relational information gain

Incremental learning of event definitions with Inductive Logic Programming

K-Optimal: a novel approximate inference algorithm for ProbLog

Guest editors introduction: special issue on inductive logic programming

Languages as hyperplanes: grammatical inference with string kernels

Brave induction: a logical framework for learning from incomplete information

Meta-interpretive learning: application to grammatical inference