Abstract: "We have been building a parallel automated reasoning system and also developing a program synthesizer, which is a promising application of the system for use on the Parallel Inference Machine (PIM). Firstly, we will present a parallel theorem prover for first-order logic implemented...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Hasegawa, Ryuzo (VerfasserIn), Fujita, Hiroshi (VerfasserIn), Fujita, Masayuki (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	Tokyo, Japan 1990
Schriftenreihe:	Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 588
Schlagworte:	Automatic theorem proving
Zusammenfassung:	Abstract: "We have been building a parallel automated reasoning system and also developing a program synthesizer, which is a promising application of the system for use on the Parallel Inference Machine (PIM). Firstly, we will present a parallel theorem prover for first-order logic implemented in KL1, and the KL1 implementation techniques which are also useful for other related areas, such as truth maintenance systems and intelligent database systems. The MGTP prover, which has already being developed, adopts a model generation method, as used in SATCHMO, that was first implemented in Prolog by Manthey and Bry. SATCHMO tries to find ground models for the given set of clauses that satisfies a condition called range-restrictedness The condition imposed on the clause set allows us to use only matching rather than unification during the proving process. This property is also favorable in implementing a prover in KL1 since matching is easily realized with head unification and the variables in the given clauses can be represented as KL1 variables. For ground model cases, experimental results show that the MGTP prover is more than three times faster than the SATCHMO prover on SUN 3/260 even in the pseudo parallel environment of the PSI-II machine. To deal with nonground models, MGTP is extended by incorporating unification with occurs check, weighting heuristics and other deletion strategies while still keeping a model generation paradigm We then present a formal system for program synthesis using the MGTP prover. The sorting program is taken as an example. The program specification is expressed as a formula. Subprograms can be used in the synthesized program if the corresponding lemmas are provided to the prover. The program extraction mechanism is based on constructive logic. The proof trace obtained from the prover is translated to an LF (Edinburgh Logical Framework) proof term and a program can be extracted from this proof term.
Beschreibung:	19 S.