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

6 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
DOIs
Publication statusPublished - 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

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'A new design and implementation of progol by bottom-up computation'. Together they form a unique fingerprint.

Cite this