ASIAN 1996: Concurrency and Parallelism, Programming, Networking, and Security pp 345-346 | Cite as
Constructing more relevant models
Posters
First Online:
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
- 1.J.W. Lloyd, ‘Foundations of Logic Programming', 2nd edn, Springer-Verlag, Heidelberg, 1987.Google Scholar
- 2.D.W. Ramsay, ‘Generating Relevant Models', Journal of Automated Reasoning, 7: 359–368, 1991.CrossRefMathSciNetGoogle Scholar
- 3.R. Manthey and F. Bry, 'sATCHMO: a theorem prover implemented in Prolog', Proceedings of 9th Conference on Automated Deduction, 1988.Google Scholar
- 4.D.W. Loveland, D.W. Reed and D.S. Wilson, ‘SATCHMORE: SATCHMO with RElevancy', Journal of Automated Reasoning, 14: 325–351, 1995.CrossRefMathSciNetGoogle Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 1996