Division of Informatics
Forrest Hill & 80 South Bridge
Research Paper #460 | |
|---|---|
| Title: | Abstract Theorem Proving: Mapping Back |
| Authors: | Giunchiglia,F; Walsh,T |
| Date: | Jan 1990 |
| Presented: | Submitted to 10th International Conference on Automatic Deduction |
| Keywords: | |
| Abstract: | Abstraction is a very powerful heuristic that has often been used in theorem proving (eg. [Pla81,Pla86,Ten87,Imi87,GW89b]). This paper uses the general theory of abstraction presented in [GW89a]) to consider the problem of how an abstract solution can be "mapped back" onto a solution of the original problem. We describe the basic ideas and report some experimental results. |
| Download: | NO ONLINE COPY |
![[Search These Pages]](http://www.dai.ed.ac.uk/icons/dai_search.gif){kind=icon}
![[DAI Home Page]](http://www.dai.ed.ac.uk/icons/dai_home.gif){kind=icon}
![[Comment]](http://www.dai.ed.ac.uk/icons/dai_comment.gif){kind=icon}