### Abstract

In this paper we present a new inductive inference algorithm for a class of logic programs, called linear monadic logic programs. It has several unique features not found in Shapiro's Model Inference System. It has been proved that a set of trees is rational if and only if it is computed by a linear monadic logic program, and that the rational set of trees is recognized by a tree automaton. Based on these facts, we can reduce the problem of inductive inference of linear monadic logic programs to the problem of inductive inference of tree automata. Further several efficient inference algorithms for finite automata have been developed. We extend them to an inference algorithm for tree automata and use it to get an efficient inductive inference algorithm for linear monadic logic programs. The correctness, time complexity and several comparisons of our algorithm with Model Inference System are shown.

Original language | English |
---|---|

Pages (from-to) | 365-380 |

Number of pages | 16 |

Journal | New Generation Computing |

Volume | 7 |

Issue number | 4 |

DOIs | |

Publication status | Published - 1990 Dec |

Externally published | Yes |

### Fingerprint

### Keywords

- Algebraic Semantics
- Inductive Inference
- Logic Program
- Polynomial Time
- Query

### ASJC Scopus subject areas

- Theoretical Computer Science
- Software
- Hardware and Architecture
- Computer Networks and Communications

### Cite this

**Inductive inference of logic programs based on algebraic semantics.** / Sakakibara, Yasubumi.

Research output: Contribution to journal › Article

*New Generation Computing*, vol. 7, no. 4, pp. 365-380. https://doi.org/10.1007/BF03037452

}

TY - JOUR

T1 - Inductive inference of logic programs based on algebraic semantics

AU - Sakakibara, Yasubumi

PY - 1990/12

Y1 - 1990/12

N2 - In this paper we present a new inductive inference algorithm for a class of logic programs, called linear monadic logic programs. It has several unique features not found in Shapiro's Model Inference System. It has been proved that a set of trees is rational if and only if it is computed by a linear monadic logic program, and that the rational set of trees is recognized by a tree automaton. Based on these facts, we can reduce the problem of inductive inference of linear monadic logic programs to the problem of inductive inference of tree automata. Further several efficient inference algorithms for finite automata have been developed. We extend them to an inference algorithm for tree automata and use it to get an efficient inductive inference algorithm for linear monadic logic programs. The correctness, time complexity and several comparisons of our algorithm with Model Inference System are shown.

AB - In this paper we present a new inductive inference algorithm for a class of logic programs, called linear monadic logic programs. It has several unique features not found in Shapiro's Model Inference System. It has been proved that a set of trees is rational if and only if it is computed by a linear monadic logic program, and that the rational set of trees is recognized by a tree automaton. Based on these facts, we can reduce the problem of inductive inference of linear monadic logic programs to the problem of inductive inference of tree automata. Further several efficient inference algorithms for finite automata have been developed. We extend them to an inference algorithm for tree automata and use it to get an efficient inductive inference algorithm for linear monadic logic programs. The correctness, time complexity and several comparisons of our algorithm with Model Inference System are shown.

KW - Algebraic Semantics

KW - Inductive Inference

KW - Logic Program

KW - Polynomial Time

KW - Query

UR - http://www.scopus.com/inward/record.url?scp=0347594442&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0347594442&partnerID=8YFLogxK

U2 - 10.1007/BF03037452

DO - 10.1007/BF03037452

M3 - Article

AN - SCOPUS:0347594442

VL - 7

SP - 365

EP - 380

JO - New Generation Computing

JF - New Generation Computing

SN - 0288-3635

IS - 4

ER -