A method to eliminate redundant case-splittings in MGTP and its evaluation

Takashi Matsumoto, Miyuki Koshimura, Tetsuji Kuboyama, Ryuzo Hasegawa

Research output: Contribution to journalArticlepeer-review


We present a new method to eliminate redundant inferences caused by case-splitting in MGTP. There are two types of redundancies eliminated by the method: One is that the same sub-proof tree may be generated at several descendant nodes after a case-splitting occurs. Another is caused by useless model candidate extensions with irrelevant non-Horn clauses. Both types of redundancies can be eliminated by combining the folding-up function that conveys unit lemmata obtained from solved descendant nodes to a proper antecedent node and the NHM function that suppresses useless model extensions. The method has been implemented in MGTP. We evaluate its effects on a UNIX workstation for some typical problems taken from the TPTP problem library.

Original languageEnglish
Pages (from-to)75-80
Number of pages6
JournalResearch Reports on Information Science and Electrical Engineering of Kyushu University
Issue number1
Publication statusPublished - Mar 1997

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Electrical and Electronic Engineering


Dive into the research topics of 'A method to eliminate redundant case-splittings in MGTP and its evaluation'. Together they form a unique fingerprint.

Cite this