Improving search in a hypothetical reasoning system

Authors:
Richard A. Hagen;Abdul Sattar;Scott Goodwin
Affiliations:
Knowledge Representation and Reasoning unit, School of Information Technology, Griffith University, Queensland, Australia;Knowledge Representation and Reasoning unit, School of Information Technology, Griffith University, Queensland, Australia;School of Computer Science, University of Windsor, Ontario, Canada
Venue:
ACSC '03 Proceedings of the 26th Australasian computer science conference - Volume 16
Year:
2003

Citing 11
Cited 1

A PROLOG technology theorem prover: implementation by an extended PROLOG compiler

Proc. of the 8th international conference on Automated deduction
A logical framework for default reasoning

Artificial Intelligence
Benchmark problems for formal nonmonotonic reasoning

Proceedings of the 2nd international workshop on Non-monotonic reasoning
The Stanford GraphBase: a platform for combinatorial computing

The Stanford GraphBase: a platform for combinatorial computing
Consistency-motivated reason maintenance in hypothetical reasoning

New Generation Computing
Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning

LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
XSB: A System for Effciently Computing WFS

LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Caching and Lemmaizing in Model Elimination Theorem Provers

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
XRay: A Prolog Technology Theorem Prover for Default Reasoning: A System Description

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

Automated theorem proving: A logical basis (Fundamental studies in computer science)
The hyper system: knowledge reformation for efficient first-order hypothetical reasoning

PRICAI'00 Proceedings of the 6th Pacific Rim international conference on Artificial intelligence

Code improvements for model elimination based reasoning systems

ACSC '04 Proceedings of the 27th Australasian conference on Computer science - Volume 26

Quantified Score

Hi-index	0.00

Visualization

Abstract

Nonmonotonic reasoning has been a field of 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 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, nogoods, derived literals and potential crucial literals. In this paper, we report the results of experiments designed to test whether these lemmas provide general performance boosts.