A Semantically Guided Deductive System for Automatic Theorem Proving

  • Authors:
  • R. Reiter

  • Affiliations:
  • Department of Computer Science, University ty of British Columbia

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1976

Quantified Score

Hi-index 14.98

Visualization

Abstract

A semantic and deductive formal system for automatic theorem proving is presented. The system has, as its deductive component, a form of natural deduction. Its semantic component relies on an underlying representation of a model. This model is invoked to prune subgoals generated by the deductive component, whenever such subgoals test false in the model. In addition, the model is used to suggest inferences to be made at the deductive level. Conversely, the current state of the proof suggests changes to be made to the model, e.g., when a construction is required as in geometry.