Incorporating Generalization Heuristics into Verification of Prolog Programs
Proceedings of the Ninth International Joint Conference on Artificial Intelligence. Logic Programming. 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.
@inproceedings{ijcai1985p146,
title = {Incorporating Generalization Heuristics into Verification of Prolog Programs},
author = {Seki, Hirohisa},
booktitle = {Proceedings of the Ninth International Joint Conference on
Artificial Intelligence, {IJCAI-85}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Aravind Joshi},
pages = {737--740},
year = {1985},
note = {Logic Programming},
url = {https://ijcai.org/proceedings/1985/146},
}
TY - CPAPER TI - Incorporating Generalization Heuristics into Verification of Prolog Programs AU - Seki, Hirohisa T2 - Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85 PB - International Joint Conferences on Artificial Intelligence PY - 1985 SP - 737 EP - 740 UR - https://ijcai.org/proceedings/1985/146 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
