{"type":"ScholarlyArticle","title":"Incorporating Generalization Heuristics into Verification of Prolog Programs","authors":[{"name":"Hirohisa Seki","slug":"hirohisa-seki","given":"Hirohisa","family":"Seki","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/1985/146","pdf":"https://ijcai.org/proceedings/1985/0146.pdf","markdown":"https://ijcai.org/proceedings/1985/146.md","bibtex":"https://ijcai.org/proceedings/1985/bibtex/146","volume":{"slug":"1985","title":"Proceedings of the Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1985","url":"https://ijcai.org/proceedings/1985/","year":1985,"location":"Los Angeles, California, USA","dates":"","editors":"Aravind Joshi","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Logic Programming","track":"Logic Programming","number":146,"pages":{"first":737,"last":740},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}