Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:








Author, Editor

Author(s):

Krishna Rao, M. R. K.

dblp



Editor(s):

Anjaneyulu, KSR
Sasikumar, M.
Ramani, S.

dblp
dblp
dblp



BibTeX cite key*:

KrishnaRao96c

Title, Booktitle

Title*:

Learning Prolog programs from examples

Booktitle*:

Knowledge Based Computer Systems

Event, URLs

URL of the conference:


URL for downloading the paper:


Event Address*:

Bombay, India

Language:

English

Event Date*
(no longer used):

December

Organization:


Event Start Date:

22 November 2019

Event End Date:

22 November 2019

Publisher

Name*:

Narosa

URL:


Address*:

New Delhi, India

Type:


Vol, No, Year, pp.

Series:


Volume:


Number:


Month:


Pages:

19-30

Year*:

1996

VG Wort Pages:


ISBN/ISSN:

81-7319-149-2

Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) Abstract:

Logic programs with elegant and simple declarative semantics
have become very common in many areas of artificial intelligence
such as knowledge acquisition, knowledge representation and
common sense and legal reasoning. For example, in Human GENOME
project, logic programs are used in the analysis of amino acid
sequences, protein structure and drug design etc.
In this paper, we investigate the problem of learning logic
(Prolog) programs from examples and present an inference
algorithm for a class of programs.
This class of programs (called one-recursive programs)
is based on the divide-and-conquer approach and mode/type annotations.
Our class is very rich and includes many programs from Sterling and
Shapiro's book including {\tt append, merge, split, insert,
insertion-sort, preorder} and {\tt inorder} traversal of
binary trees, polynomial recognition, derivatives, sum of a list of
natural numbers etc., whereas earlier results can only deal with

very simple programs without local variables and at most two
clauses and one predicate \cite{colt92}.
Further, our algorithm does not need examples for auxiliary
predicates, but only for the target predicate.

Keywords:

learning theory, inductive logic programming



Download
Access Level:


Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Programming Logics Group

Audience:

experts only

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat



BibTeX Entry:

@INPROCEEDINGS{KrishnaRao96c,
AUTHOR = {Krishna Rao, M. R. K.},
EDITOR = {Anjaneyulu, KSR and Sasikumar, M. and Ramani, S.},
TITLE = {Learning Prolog programs from examples},
BOOKTITLE = {Knowledge Based Computer Systems},
PUBLISHER = {Narosa},
YEAR = {1996},
PAGES = {19--30},
ADDRESS = {Bombay, India},
ISBN = {81-7319-149-2},
}


Entry last modified by Uwe Brahm, 03/12/2010
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Christine Kiesel
Created
01/07/1997 02:43:10 PM
Revisions
3.
2.
1.
0.
Editor(s)
Uwe Brahm
Uwe Brahm
Uwe Brahm
Christine Kiesel
Edit Dates
17.04.97 15:28:24
17/03/97 17:02:52
20.01.97 01:21:53
07/01/97 14:51:05