Cleary, John G.2008-02-272008-02-271986-03-01http://hdl.handle.net/1880/45818In 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.EngComputer Scienceunknown1986-235-910.11575/PRISM/30551