Skip to main content
Article thumbnail
Location of Repository

Transforming general program proofs: a meta interpreter which expands negative literals

By MM West, CH Bryant and TL McCluskey

Abstract

This paper provides a method for generating a proof tree from an instance and a general logic program viz one which includes negative literals. The method differs from previous work in the field in that negative literals are first unfolded and then transformed using De Morgan's laws so that the tree explicitly includes negative rules. The method is applied to a real-world example - a large executable specification providing rules for separation for two aircraft. Given an instance of a pair of aircraft whose flight paths potentially violate seperation rules,the tree contains both positive and negative rules which contribute to the proof

Topics: QA75, other
OAI identifier: oai:usir.salford.ac.uk:1768

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.