I-SATCHMORE: an improvement of A-SATCHMORE

Authors:
LiFeng He;Chao Yuyan;Nakamura Tsuyoshi;Itoh Hidenori
Affiliations:
Faculty of Information Science and Technology, Aichi Prefectural University, Aichi, 480-1198 Japan;Faculty of Environment Information and Business, Nagoya Sangyo University, Aichi, 488-8711 Japan;Department of Artificial Intelligence and Computer Science, Nagoya Institute of Technology, Nagoya, 466-8555 Japan;Department of Artificial Intelligence and Computer Science, Nagoya Institute of Technology, Nagoya, 466-8555 Japan
Venue:
Journal of Computer Science and Technology
Year:
2003

Citing 9
Cited 2

Schubert's steamroller problem: formulations and solutions

Journal of Automated Reasoning
Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
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
Symbolic Logic and Mechanical Theorem Proving

Symbolic Logic and Mechanical Theorem Proving
Positive Unit Hyperresolution Tableaux and Their Application to Minimal Model Generation

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

Proceedings of the 9th International Conference on Automated Deduction
Automated theorem proving: A logical basis (Fundamental studies in computer science)

Automated theorem proving: A logical basis (Fundamental studies in computer science)

Eliminating redundant search space on backtracking for forward chaining theorem proving

Journal of Computer Science and Technology
An Improvement of Herbrand's theorem and its application to model generation theorem proving

Journal of Computer Science and Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an improvement of A-SATCHMORE (SATCHMORE with Availability). A-SATCHMORE incorporates relevancy testing and availability checking into SATCHMO to prune away irrelevant forward chaining. However, considering every consequent atom of those non-Horn clauses being derivable, A-SATCHMORE may suffer from a potential explosion of the search space when some of such consequent atoms are actually underivable. This paper introduces a solution for this problem and shows its correctness.