• English
    • Norsk
  • English 
    • English
    • Norsk
  • Administration
View Item 
  •   Home
  • Det matematisk-naturvitenskapelige fakultet
  • Institutt for informatikk
  • Institutt for informatikk
  • View Item
  •   Home
  • Det matematisk-naturvitenskapelige fakultet
  • Institutt for informatikk
  • Institutt for informatikk
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

A Reflective Theorem Prover for the Connection Calculus

Holen, Bjarne
Master thesis
View/Open
thesis2.pdf (761.4Kb)
Year
2005
Permanent link
http://urn.nb.no/URN:NBN:no-10624

Metadata
Show metadata
Appears in the following Collection
  • Institutt for informatikk [3603]
Abstract
Rewriting logic can be used to prototype systems for automated

deduction. In this paper, we illustrate how this approach allows

experiments with deduction strategies in a flexible and conceptually

satisfying way.

This is achieved by exploiting the reflective property of rewriting

logic. By specifying a theorem prover in this way one quickly

obtains a readable, reliable and reasonably efficient system which

can be used both as a platform for tactic experiments and as a basis

for an optimized implementation. The approach is illustrated by

specifying a calculus for the connection method in rewriting logic

which clearly separates rules from tactics.
 
Responsible for this website 
University of Oslo Library


Contact Us 
duo-hjelp@ub.uio.no


Privacy policy
 

 

For students / employeesSubmit master thesisAccess to restricted material

Browse

All of DUOCommunities & CollectionsBy Issue DateAuthorsTitlesThis CollectionBy Issue DateAuthorsTitles

For library staff

Login
RSS Feeds
 
Responsible for this website 
University of Oslo Library


Contact Us 
duo-hjelp@ub.uio.no


Privacy policy