Transforming general program proofs: a meta interpreter which expands negative literals
West, MM, Bryant, CH and McCluskey, TL 1997, Transforming general program proofs: a meta interpreter which expands negative literals , in: 7th International Workshop on Logic Program Synthesis and Transformation, 10-12 July 1997, Leuven, Belgium.
Download (184kB) | Preview
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.
|Item Type:||Conference or Workshop Item (Paper)|
|Additional Information:||Published in the preliminary proceedings of this conference|
|Themes:||Subjects / Themes > Q Science > QA Mathematics > QA075 Electronic computers. Computer science|
Subjects outside of the University Themes
|Schools:||Colleges and Schools > College of Science & Technology|
Colleges and Schools > College of Science & Technology > School of Computing, Science and Engineering
Colleges and Schools > College of Science & Technology > School of Computing, Science and Engineering > Data Mining and Pattern Recognition Research Centre
|Depositing User:||Dr Chris H. Bryant|
|Date Deposited:||17 Feb 2009 14:27|
|Last Modified:||20 Aug 2013 16:56|
Document DownloadsMore statistics for this item...
Actions (login required)
|Edit record (repository staff only)|