ePrints

Revising Basic Theorem Proving Algorithms to Cope with the Logic of Partial Functions

Lookup NU author(s): Professor Cliff JonesORCiD, Matthew Lovert, Dr Jason Steggles

Downloads

• Published version [.pdf]

Abstract

Partial terms are those that can fail to denote a value; such terms arise frequently in the specification and development of programs. Earlier papers describe and argue for the use of the non-classical "Logic of Partial Functions" (LPF) to facilitate sound and convenient reasoning about such terms. This paper reviews the fundamental theorem proving algorithms -such as resolution- and identifies where they need revision to cope with LPF. Particular care is needed with "refutation" procedures. The modified algorithms are justified with respect to a semantic model. Indications are provided of further work which could lead to efficient support for LPF.

Publication metadata

Author(s): Jones CB, Lovert MJ, Steggles LJ

Publication type: Report

Publication status: Published

Series Title: School of Computing Science Technical Report Series

Year: 2014

Pages: 25

Print publication date: 01/03/2014

Source Publication Date: March 2014

Report Number: 1414

Institution: School of Computing Science, University of Newcastle upon Tyne

Place Published: Newcastle upon Tyne

URL: http://www.cs.ncl.ac.uk/publications/trs/papers/1414.pdf

Share