HE LiFeng, Yuyan Chao, Tsuyoshi Nakamura, Hidenori Itoh. Z-SATCHMORE: An Improvement of A-SATCHMORE[J]. Journal of Computer Science and Technology, 2003, 18(2).
Citation:
HE LiFeng, Yuyan Chao, Tsuyoshi Nakamura, Hidenori Itoh. Z-SATCHMORE: An Improvement of A-SATCHMORE[J]. Journal of Computer Science and Technology, 2003, 18(2).
HE LiFeng, Yuyan Chao, Tsuyoshi Nakamura, Hidenori Itoh. Z-SATCHMORE: An Improvement of A-SATCHMORE[J]. Journal of Computer Science and Technology, 2003, 18(2).
Citation:
HE LiFeng, Yuyan Chao, Tsuyoshi Nakamura, Hidenori Itoh. Z-SATCHMORE: An Improvement of A-SATCHMORE[J]. Journal of Computer Science and Technology, 2003, 18(2).
This paper presents an improvement of A-SATCHMORE (SATCHMOREwith Availability). A-SATCHMORE incorporates relevancy testingand availability checking into SATCHMO to prune away irrelevant forwardchaining. However, considering every consequent atom of those non-Hornclauses being derivable, A-SATCHMORE may suffer from apotential explosion of the search space when some of such consequentatoms are actually underivable. This paper introduces a solution forthis problem and shows its correctness.