Non-Horn magic sets for bottom-up theorem proving

Ryuzo Hasegawa, Miyuki Koshimura, Katsumi Inoue, Yoshihiko Ohta

Research output: Contribution to journalArticlepeer-review


We present a new method, called non-Horn magic sets(NHM), to enhance forward reasoning provers by combining top-down and bottom-up computations. This method is a natural extension of Horn magic sets and is applicable to range-restricted non-Horn clauses. We show two types of transformations to get non-Horn magic sets from the given clause sets: breadth-first NHM and depth-first NHM. The first transformation evaluates the antecedent literals of a transformed clause in parallel. The second one evaluates them sequentially while propagating the bindings in an antecedent literal to the next by using continuation predicates. These transformations are shown to be sound and complete. The NHM method has been implemented on a UNIX workstation. We evaluated NHM effects by proving some typical problems taken from the TPTP problem library.

Original languageEnglish
Pages (from-to)85-90
Number of pages6
JournalResearch Reports on Information Science and Electrical Engineering of Kyushu University
Issue number1
Publication statusPublished - Sept 1 1996

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Electrical and Electronic Engineering


Dive into the research topics of 'Non-Horn magic sets for bottom-up theorem proving'. Together they form a unique fingerprint.

Cite this