Non-horn magic sets to incorporate top-down inference into bottom-up theorem proving

Ryuzo Hasegawa, Katsumi Inoue, Yoshihiko Ohta, Miyuki Koshimura

Research output: Chapter in Book/Report/Conference proceedingConference contribution

19 Citations (Scopus)


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 atoms of an original clause in parallel. The second one evaluates them sequentially while propagating the bindings in an antecedent atom 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 effects of NHM by proving some typical problems taken from the TPTP problem library.

Original languageEnglish
Title of host publicationAutomated Deduction – CADE-14 - 14th International Conference on Automated Deduction, Proceedings
EditorsWilliam McCune
PublisherSpringer Verlag
Number of pages15
ISBN (Print)3540631046, 9783540631040
Publication statusPublished - 1997
Event14th International Conference on Automated Deduction, CADE 1997 - Townsville, Australia
Duration: Jul 13 1997Jul 17 1997

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other14th International Conference on Automated Deduction, CADE 1997

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Non-horn magic sets to incorporate top-down inference into bottom-up theorem proving'. Together they form a unique fingerprint.

Cite this