An approach to tableau inferencing with “hardwired” heuristics
暂无分享,去创建一个
In this paper we discuss a prototype of the tableau method which derives its rule base from Jeffrey's text [3]. The heuristics are a subset of those outlined for HARP by Oppacher and Suen [4]. The prototype was written in C and intended for use with the IBM family of microcomputers. We shall outline some of our implementation strategies and, insofar as is possible, contrast them with those of the earlier pioneering work of Oppacher and Suen.
[1] R. Smullyan. First-Order Logic , 1968 .
[2] Evert Willem Beth,et al. Formal Methods: An Introduction to Symbolic Logic and to the Study of Effective Operations in Arithmetic and Logic , 1962 .
[3] Steve Reeves,et al. Semantic tableaux as a framework for automated theorem-proving , 1987 .
[4] R. Jeffrey. Formal Logic: Its Scope and Limits , 1981 .