Abstract
We show that by incorporating availability checking into model generation approach for first-order theorem proving, we can construct more relevant models, thereby further restricting forward chaining.
References
J.W. Lloyd, ‘Foundations of Logic Programming', 2nd edn, Springer-Verlag, Heidelberg, 1987.
D.W. Ramsay, ‘Generating Relevant Models', Journal of Automated Reasoning, 7: 359–368, 1991.
R. Manthey and F. Bry, 'sATCHMO: a theorem prover implemented in Prolog', Proceedings of 9th Conference on Automated Deduction, 1988.
D.W. Loveland, D.W. Reed and D.S. Wilson, ‘SATCHMORE: SATCHMO with RElevancy', Journal of Automated Reasoning, 14: 325–351, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
He, L., Chao, Y., Simajiri, Y., Seki, H., Itoh, H. (1996). Constructing more relevant models. In: Jaffar, J., Yap, R.H.C. (eds) Concurrency and Parallelism, Programming, Networking, and Security. ASIAN 1996. Lecture Notes in Computer Science, vol 1179. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027811
Download citation
DOI: https://doi.org/10.1007/BFb0027811
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62031-0
Online ISBN: 978-3-540-49626-7
eBook Packages: Springer Book Archive