R. Hasegawa, K. Inoue, Y. Ohta and M. Koshimura. Nonhorn Magic Sets to Incorporate Top-down Inference into Bottom-up Theorem Proving. Proceedings of CADE97 pages 176-190, 1997.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....set of clauses representing the theory or using certain data structures and special algorithms to achieve top down processing for a given query are available. Most of the transformations involve the introduction of new predicates and or extensive rule rewriting to enable the more focused search [1, 9, 14, 30, 34, 38]. The use of information irrelevant to the query is the major source of inefficiency for bottom up methods. Realizing that, certain approaches utilize a top down component to isolate the relevant clauses of the theory that can contribute to a bottom up search for a refutation of the theory ....

....irrelevant to the query is the major source of inefficiency for bottom up methods. Realizing that, certain approaches utilize a top down component to isolate the relevant clauses of the theory that can contribute to a bottom up search for a refutation of the theory augmented with the query negation[31, 22, 37, 14]. Others employ two cooperating procedures: a top down and bottom up to improve performance [12] The cooperation takes the form of passing intermediate results of one computation to the other. In this paper we offer an alternative method for top down processing of positive queries based on a ....

[Article contains additional citation context not shown here]

R. Hasegawa, K. Inoue, Y. Ohta and M. Koshimura. Nonhorn Magic Sets to Incorporate Top-down Inference into Bottom-up Theorem Proving. Proceedings of CADE97 pages 176-190, 1997.

....set of clauses representing the theory or using certain data structures and special algorithms to achieve top down processing for a given query are available. Most of the transformations involve the introduction of new predicates and or extensive rule rewriting to enable the more focused search [1, 5, 8, 14, 16, 19]. In this paper we offer an alternative method for top down processing of positive queries based on a certain concept of duality. It exploits the implicit modification of the interpretation of logical connectives induced by the reversal of the implication sign of clauses. No additional ....

....theory to achieve top down processing, as opposed to having the same procedure operate on the input theory in a bottom up mode 6 . In contrast to other approaches, ours is applicable to disjunctive theories [13] and avoids the explicit introduction of new predicates into the transformed theory [1, 8, 5, 16, 19]. Rather we achieve the required results by reinterpreting the clauses (and consequently the logical connectives) in a dual mode. As is the original, the transformed theory is a DDDB. The dual transformation is quite simple and involves only changing the direction of implications in all clauses. ....

R. Hasegawa, K. Inoue, Y. Ohta and M. Koshimura. Nonhorn magic sets to incorporate topdown inference into bttom-up theorem proving. Proceedings of CADE97 PP. 1997.

....relevant literals dynamically by utilizing Prolog over Horn clauses, in advance before a violated clause is used for forward chaining. For the same purpose as above, another method called non Horn magic sets (NHM) which combines bottom up proving and top down proving, has also been proposed [4]. The NHM method is based on a static clause transformation, in which a given clause set is transformed to clauses simulating backward reasoning and those for controlling forward reasoning. Although the magic sets method [1] proposed in the field of deductive databases is applicable only to Horn ....

....above, the relevancy testing and the NHM methods have been presented to prevent redundant interpretations from being generated by SATCHMO and MGTP. However, the relationship between both methods has not yet been clarified. According to several experimental results having been obtained so far [6, 4], it is estimated that relevancy testing and NHM have the same pruning ability. In this paper, we define the concept of weak relevancy testing that mitigates the condition of relevancy testing [6] and analyze the relationship between the weak relevancy testing and the NHM methods. Then, we prove ....

[Article contains additional citation context not shown here]

Hasegawa, R., Inoue, K., Ohta, Y. and Koshimura, M., Non-Horn magic sets to incorporate top-down inference into bottom-up theorem proving, in: W. McCune (ed.), Proc. 14th Int. Conf. on Automated Deduction (CADE-14), Lecture Notes in Artificial Intelligence, 1249, pp. 176-190, Springer, 1997.

No context found.

) R. Hasegawa, K. Inoue, Y. Ohta and M. Koshimura. NonHorn Magic Sets to Incorporate Top-down Inference into Bottom-up Theorem Proving. Proceedings of CADE97 pages 176-190. 1997.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC