Improving Search in a Hypothetical Reasoning System
MetadataShow full item record
Nonmonotonic reasoning has been a field vigorous study for a quarter of a century with practical implementations emerging during the last 15 years. Improving the efficiency of these systems is an important step in them gaining acceptance beyond the research sphere. The use of lemmas - small results can that can be reused later in a proof or derivation - might be one way of improving performance. We have extended an implementation of the THEORIST nonmonotonic reasoning system with four sorts of lemmas: goods, nongoods, derived literals and potential crucial literals. In this paper, we report the results of experiments designed to test wether these lemmas provide general performance boosts.
Proceedings of the Twenty-Sixth Australasian Computer Science Conference, Adelaide, Australia, February 2003.
© 2003 Australian Computer Society Inc. The attached file is reproduced here in accordance with the copyright policy of the publisher. Use hypertext link to access the publisher's website.