A new design and implementation of progol by bottom-up computation

Hiroshi Fujita, Naoki Yagi, Tomonobu Ozaki, Koichi Furukawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

This paper describes a parallel version of Progol based on MGTP which is a theorem prover employing bottom-up inference suitable for parallel implementation. Hypothesis formation in Progol, which is performed by top-down computation with Prolog in the sequential implementation, will be performed more efficiently by bottom-up computation with MGTP in the new implementation. For the Progol's generalto- specific search for hypotheses through the subsumptiou lattice, we developed a new way of calculating a heuristic function for the A*-like algorithm, which was also implemented with MGTP. Since MGTP already has very efficient parallel implementations on parallel inference machines, an efficient implementation of parallel-Progol will readily be realized as well.

Original languageEnglish
Title of host publicationInductive Logic Programming - 6th International Workshop, ILP-1996, Selected Papers
EditorsStephen Muggleton
PublisherSpringer Verlag
Pages163-174
Number of pages12
ISBN (Print)3540634940, 9783540634942
Publication statusPublished - Jan 1 1997
Event6th International Workshop on Inductive Logic Programming, ILP-1996 - Stockholm, Sweden
Duration: Aug 26 1996Aug 28 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1314
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other6th International Workshop on Inductive Logic Programming, ILP-1996
CountrySweden
CityStockholm
Period8/26/968/28/96

Fingerprint

Bottom-up
Parallel Implementation
Efficient Implementation
Prolog
Heuristics
Theorem
Design

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Fujita, H., Yagi, N., Ozaki, T., & Furukawa, K. (1997). A new design and implementation of progol by bottom-up computation. In S. Muggleton (Ed.), Inductive Logic Programming - 6th International Workshop, ILP-1996, Selected Papers (pp. 163-174). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1314). Springer Verlag.

A new design and implementation of progol by bottom-up computation. / Fujita, Hiroshi; Yagi, Naoki; Ozaki, Tomonobu; Furukawa, Koichi.

Inductive Logic Programming - 6th International Workshop, ILP-1996, Selected Papers. ed. / Stephen Muggleton. Springer Verlag, 1997. p. 163-174 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1314).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Fujita, H, Yagi, N, Ozaki, T & Furukawa, K 1997, A new design and implementation of progol by bottom-up computation. in S Muggleton (ed.), Inductive Logic Programming - 6th International Workshop, ILP-1996, Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1314, Springer Verlag, pp. 163-174, 6th International Workshop on Inductive Logic Programming, ILP-1996, Stockholm, Sweden, 8/26/96.
Fujita H, Yagi N, Ozaki T, Furukawa K. A new design and implementation of progol by bottom-up computation. In Muggleton S, editor, Inductive Logic Programming - 6th International Workshop, ILP-1996, Selected Papers. Springer Verlag. 1997. p. 163-174. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Fujita, Hiroshi ; Yagi, Naoki ; Ozaki, Tomonobu ; Furukawa, Koichi. / A new design and implementation of progol by bottom-up computation. Inductive Logic Programming - 6th International Workshop, ILP-1996, Selected Papers. editor / Stephen Muggleton. Springer Verlag, 1997. pp. 163-174 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{fe63333181054b8daaee7189c4931a9e,
title = "A new design and implementation of progol by bottom-up computation",
abstract = "This paper describes a parallel version of Progol based on MGTP which is a theorem prover employing bottom-up inference suitable for parallel implementation. Hypothesis formation in Progol, which is performed by top-down computation with Prolog in the sequential implementation, will be performed more efficiently by bottom-up computation with MGTP in the new implementation. For the Progol's generalto- specific search for hypotheses through the subsumptiou lattice, we developed a new way of calculating a heuristic function for the A*-like algorithm, which was also implemented with MGTP. Since MGTP already has very efficient parallel implementations on parallel inference machines, an efficient implementation of parallel-Progol will readily be realized as well.",
author = "Hiroshi Fujita and Naoki Yagi and Tomonobu Ozaki and Koichi Furukawa",
year = "1997",
month = "1",
day = "1",
language = "English",
isbn = "3540634940",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "163--174",
editor = "Stephen Muggleton",
booktitle = "Inductive Logic Programming - 6th International Workshop, ILP-1996, Selected Papers",
address = "Germany",

}

TY - GEN

T1 - A new design and implementation of progol by bottom-up computation

AU - Fujita, Hiroshi

AU - Yagi, Naoki

AU - Ozaki, Tomonobu

AU - Furukawa, Koichi

PY - 1997/1/1

Y1 - 1997/1/1

N2 - This paper describes a parallel version of Progol based on MGTP which is a theorem prover employing bottom-up inference suitable for parallel implementation. Hypothesis formation in Progol, which is performed by top-down computation with Prolog in the sequential implementation, will be performed more efficiently by bottom-up computation with MGTP in the new implementation. For the Progol's generalto- specific search for hypotheses through the subsumptiou lattice, we developed a new way of calculating a heuristic function for the A*-like algorithm, which was also implemented with MGTP. Since MGTP already has very efficient parallel implementations on parallel inference machines, an efficient implementation of parallel-Progol will readily be realized as well.

AB - This paper describes a parallel version of Progol based on MGTP which is a theorem prover employing bottom-up inference suitable for parallel implementation. Hypothesis formation in Progol, which is performed by top-down computation with Prolog in the sequential implementation, will be performed more efficiently by bottom-up computation with MGTP in the new implementation. For the Progol's generalto- specific search for hypotheses through the subsumptiou lattice, we developed a new way of calculating a heuristic function for the A*-like algorithm, which was also implemented with MGTP. Since MGTP already has very efficient parallel implementations on parallel inference machines, an efficient implementation of parallel-Progol will readily be realized as well.

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

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

M3 - Conference contribution

AN - SCOPUS:38149075991

SN - 3540634940

SN - 9783540634942

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 163

EP - 174

BT - Inductive Logic Programming - 6th International Workshop, ILP-1996, Selected Papers

A2 - Muggleton, Stephen

PB - Springer Verlag

ER -