## Automated theorem proving: mapping logic into AI (1986)

Venue: | Proceedings of the International Symposium on Methodologies for Intelligent Systems |

Citations: | 1 - 0 self |

### BibTeX

@INPROCEEDINGS{Loveland86automatedtheorem,

author = {D. W. Loveland},

title = {Automated theorem proving: mapping logic into AI},

booktitle = {Proceedings of the International Symposium on Methodologies for Intelligent Systems},

year = {1986},

pages = {214--229},

publisher = {Press}

}

### OpenURL

### Abstract

ABSTRACT. Logic can be defined as the formal study of reasoning; if we replace "for-mal " by "mechanical " we can place almost the entire set of methodologies used in the field of automated theorem proving (ATP) within the scope of logic. Because of the goals of ATP, if not always the methodologies, ATP has been considered to be within the domain of AI. We explore the methodologies of ATP, including the logics that underlie the theorem provers, and discuss some of the mechanisms that utilize these logics. These include term rewriting systems, mathematical induction, inductionless induction and even mixed integer programming. The ATP field, via resolution, has even provided the foundation for an exciting AI and database programming language, PROLOG. We conclude with a new method for extending the PROLOG system to work with non-Horn clause sets within a positive logic format, particularly simple for "slightly non-Horn " clause sets.