Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction

@article{Stickel1994UpsidedownMO,
  title={Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction},
  author={Mark E. Stickel},
  journal={Journal of Automated Reasoning},
  year={1994},
  volume={13},
  pages={189-210}
}
Typical bottom-up, forward-chaining reasoning systems such as hyperresolution lack goaldirectedness, while typical top-down, backward-chaining reasoning systems like Prolog or model elimination repeatedly solve the same goals. Reasoning systems that are goal-directed and avoid repeatedly solving the same goals can be constructed by formulating the top-down methods meta-theoretically for execution by a bottom-up reasoning system (hence, we use the term upside-down meta-interpretation). This… CONTINUE READING
Highly Cited
This paper has 42 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 51 references

Automated Reasoning: Introduction and Applications

L. Wos, R. Overbeek, E. Lusk, J. Boyle
1992

Investigations in model elimination based theorem proving

O. L. Astrachan
Ph.D. dissertation, • 1992
View 1 Excerpt

Linear Resolution for Consequence Finding

Artif. Intell. • 1992
View 2 Excerpts

Generating relevant models

A. Ramsey
J. Automated Reasoning 7(3), • 1991
View 1 Excerpt

Similar Papers

Loading similar papers…