Toggle Main Menu Toggle Search

Open Access padlockePrints

The Newcastle University research output collection, currently available on ePrints, will shortly be moving to a new open repository platform, Figshare. To prepare for the data migration we have paused adding new content to ePrints, and will resume once the new repository is launched. During this time you will continue to have access to ePrints (but no new content will appear). We will share updates here when available.

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

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

Downloads

Licence

This is the final published version of a report that has been published in its final definitive form by School of Computing Science, University of Newcastle upon Tyne, 2014.

For re-use rights please refer to the publisher's terms and conditions.

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