A new design and implementation of progol by bottom-up computation
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 subsumption 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.
Unable to display preview. Download preview PDF.
- [BR91]Beeri, C. and Ramakrishnan, R.: On the Power of Magic. J. Logic Programming, Vol.10, (1991) 255–299Google Scholar
- [FH91]Fujita, H. and Hasegawa, R.: A Model Generation Theorem Prover in KL1 Using a Ramified-Stack Algorithm. Proc. of the 8th ICLP, (1991) 535–548Google Scholar
- [MB88]Manthey, R. and Bry, F.: SATCHMO: A theorem prover implemented in Prolog. Proc. of the 9th CADE, (1988) 415–434Google Scholar
- [Mug95]Muggleton, S.: Inverse Entailment and Progol. New Generation Computing, Vol. 13, (1995) 245–286Google Scholar
- [UC90]Ueda, K. and Chikayama, T.: Design of the kernel language for the parallel inference machine. The Computer Journal, 33(6) (1990) 494–500Google Scholar
- [Yag96]Yagi, N.: On the Construction of parallel ILP Model. Master's thesis, Keio University, (1996)Google Scholar