LOGICAL ARITHMETIC
| dc.contributor.author | Cleary, John G. | eng |
| dc.date.accessioned | 2008-02-27T16:56:20Z | |
| dc.date.available | 2008-02-27T16:56:20Z | |
| dc.date.computerscience | 1999-05-27 | eng |
| dc.date.issued | 1986-03-01 | eng |
| dc.description.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. | eng |
| dc.description.notes | We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.ca | eng |
| dc.identifier.department | 1986-235-9 | eng |
| dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/30551 | |
| dc.identifier.uri | http://hdl.handle.net/1880/45818 | |
| dc.language.iso | Eng | eng |
| dc.publisher.corporate | University of Calgary | eng |
| dc.publisher.faculty | Science | eng |
| dc.subject | Computer Science | eng |
| dc.title | LOGICAL ARITHMETIC | eng |
| dc.type | unknown | |
| thesis.degree.discipline | Computer Science | eng |