Using Difference Reduction for Generic Proof Search

dc.creatorNegrete, Santiago
dc.date.accessioned2013-04-13T00:43:08Z
dc.date.available2013-04-13T00:43:08Z
dc.date.created2013-04-13T00:43:08Z
dc.date.issued1998-12-15
dc.identifierRevista Computación y Sistemas; Vol. 2 No. 2 y No. 3
dc.identifier1405-5546
dc.identifierhttp://www.repositoriodigital.ipn.mx/handle/123456789/15110
dc.description.abstractAbstract. In this paper a new approach to generic theorem proving is introduced. We present a set 01 techniques to guide prool search in framework theories that works with different object theories encoded. The techniques are based on the principIe 01 Difference Reduction and programmed in a Proof Plans environment. We use presentations ollogics in natural deduction style to test our techniques. Two example theorem prools are included to show how the whole setting works.
dc.languageen_US
dc.publisherRevista Computación y Sistemas; Vol. 2 No. 2 y No. 3
dc.relationRevista Computación y Sistemas;Vol. 2 No. 2 y No. 3
dc.subjectKeywords. Framework theories, proof search, rewrite rules, unification, natural deduction.
dc.titleUsing Difference Reduction for Generic Proof Search
dc.typeArticle


Este ítem pertenece a la siguiente institución