R-UNSEARCHMO: A Refinement on UNSEARCHMO

Authors:
Yuyan Chao;Norimitsu Kawana;Lifeng He;Tsuyoshi Nakamura;Hidenori Itoh
Affiliations:
-;-;-;-;-
Venue:
PRICAI '02 Proceedings of the 7th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
Year:
2002

Citing 10
Cited 0

HARP: a tableau-based theorem prover

Journal of Automated Reasoning
An efficient strategy for non-Horn deductive databases

Selected papers of the workshop on Deductive database theory
Generating relevant models

Journal of Automated Reasoning
A-SATCHMORE: SATCHMORE with availability checking

New Generation Computing
A Simplified Format for the Model Elimination Theorem-Proving Procedure

Journal of the ACM (JACM)
Positive Unit Hyperresolution Tableaux and Their Application to Minimal Model Generation

Journal of Automated Reasoning
I-SATCHMO: An Improvement of SATCHMO

Journal of Automated Reasoning
SATCHMO: A Theorem Prover Implemented in Prolog

Proceedings of the 9th International Conference on Automated Deduction
SATCHMOREBID: SATCHMO(RE) with BIDirectional relevancy

New Generation Computing
UNSEARCHMO: eliminating redundant search space on backtracking for forward chaining theorem proving

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

By not utilizing the reasoning results derivable whenever refutations are found at nodes in proof trees, UNSEARCHMO might repeat some reasoning that has been made before. Addressing this problem, this paper presents a refinement on UNSEARCHMO, called RUNSEARCHMO, by summarizing the derived refutations as lemmas and utilizing them in the further reasoning. In this way, R-UNSEARCHMO can avoid repeated reasoning and always search a subspace of that UN-SEARCHMO does. Somewhat surprisingly, our refinement almost takes no additional cost. We describe the refinement, present the implementation and provide examples to demonstrate the power of our refinement.