Please use this identifier to cite or link to this item:
Authors: Cleary, John G.
Keywords: Computer Science
Issue Date: 1-Mar-1986
Abstract: In the past, implementations of real arithmetic within logic programming have been non-logical. Difficulties include an inability to alter the order of execution of statements and incorrect handling of the different results caused by finite precision arithmetic. Using interval analysis a simple description of real arithmetic is possible. This can be translated to an implementation within Prolog. As well as having a sound logical basis the resulting system allows a very concise and powerful programming style and is potentially very efficient.
Appears in Collections:Cleary, John

Files in This Item:
File Description SizeFormat 
1986-235-9.pdf2.27 MBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.