---
title: "Incorporating Generalization Heuristics into Verification of Prolog Programs"
authors:
  - "Hirohisa Seki"
doi: ""
url: "https://ijcai.org/proceedings/1985/146"
pdf: "https://ijcai.org/proceedings/1985/0146.pdf"
venue: "Proceedings of the Ninth International Joint Conference on Artificial Intelligence"
year: 1985
pages: "737-740"
track: "Logic Programming"
keywords:
---

# Incorporating Generalization Heuristics into Verification of Prolog Programs

Hirohisa Seki

*Proceedings of the Ninth International Joint Conference on Artificial Intelligence*, pages 737-740.

## Abstract

This paper is eoneerned with the problem of generalization heuristics, whieh are ineorporated into our verifleation system for Prolog programs. Two kinds of generalisation are diseussed, that is, a meebanical generali1ation and an intelligent generalization. We show that the meehanieal generalisation used in Boyer-Moore's theorem prover (BMTP) ean be performed by the simplifleation rule of our verifleation aystem, as weil as in the ease of eross-fertilization. To the intelligent generalization heuristie, whieh is not employed in BMTP, we give a generalization seheme whieh is naturally ineorporated into our inferenee system of the extended-exeeution style of the Prolog interpreter, and whieh proves to be eft'eetive also for flawed induetion aehemea.