Abstract
We introduce a method for reducing the redundant search space for SATCHMO's model generation approach by means of intelligent backtracking. During the reasoning, we mark an asserted consequent atom as “useful” whenever it has been used as an antecedent atom for forward chaining. We show that a splitting of the consequence of a non-Horn clause is unnecessary if one of its consequent atoms is found not to be “useful” at the time it is retracted from the database on backtracking, and therefore the remaining splitting over the clause's consequence can be immediately abandoned. In this way, much of the redundant search space can be eliminated. Our method is simple in principle, easy to implement in Prolog, independent of other refinements, and effective for model generation theorem proving.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bruynooghe, M. and Pereira, L. M.: Deduction revision by intelligent backtracking, in J. A. Campbell (ed.), Implementations of Prolog, Ellis Horwood, 1984, pp. 194–215.
Bry, F. and Yahya, A.: Positive unit hyperresolution tableaux and their application to minimal model generation, J. Automated Reasoning 25 (2000), 35–82.
Cox, P. T.: Finding backtrack points for intelligent backtracking, in J. A. Campbell (ed.), Implementations of Prolog, Ellis Horwood, 1984, pp. 216–233.
Doyle, J.: A true maintenance system, Artificial Intelligence 12 (1979), 231–272.
Hasegawa, R., Inoue, K., Ohta, Y. and Koshimura, M.: Non-Horn magic sets to incorporate top-down inference into bottom-up theorem proving, in Proceedings of CADE-14, 1997, pp. 176–190.
He, L., Chao, Y., Simajiri, Y., Seki, H. and Itoh, H.: A-SATCHMORE: SATCHMORE with availability checking, New Generation Computing 16 (1998), 55–74.
Kumar, V. and Lin, Y. J.: An intelligent backtracking scheme for Prolog, in Proceedings of the 1987 Symposium on Logic Programming, 1987, pp. 406–414.
Loveland, D. W., Reed, D. W. and Wilson, D. S.: SATCHMORE: SATCHMO with RElevancy, J. Automated Reasoning 14 (1995), 325–351.
Manthey, R. and Bry, F.: SATCHMO: A theorem prover implemented in Prolog, in Proceedings of 9th Intl. Conf. on Automated Deduction, 1988, pp. 415–434.
Ramsay, A.: Generating relevant models, J. Automated Reasoning 7 (1991), 359–368.
Stickel, M. E.: Schubert's steamroller problem: Formulations and solutions, J. Automated Reasoning 2 (1986), 89–101.
Sutcliffe, G. and Suttner, C.: http://www.cs.jcu.edu.au/~tptp/
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
He, L. I-SATCHMO: An Improvement of SATCHMO. Journal of Automated Reasoning 27, 313–322 (2001). https://doi.org/10.1023/A:1017594402123
Issue Date:
DOI: https://doi.org/10.1023/A:1017594402123